UNIQUENESS OF THE SOLUTION FOR OPTIMAL STATIC ROUTING IN OPEN BCMP QUEUING-NETWORKS

被引:19
作者
KAMEDA, H [1 ]
ZHANG, Y [1 ]
机构
[1] UNIV ELECTROCOMMUN,DEPT COMP SCI & INFORMAT MATH,CHOFU,TOKYO 182,JAPAN
关键词
BCMP QUEUING NETWORK; NONLINEAR OPTIMIZATION; STATIC ROUTING; COMMUNICATION NETWORK; OVERALL OPTIMIZATION; INDIVIDUAL OPTIMIZATION;
D O I
10.1016/0895-7177(95)00188-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Optimal static routing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. They include static routing problems in communication networks and optimal static load balancing problems in distributed computer systems. We consider an overall optimal policy that is the routing policy whereby the overall mean response (or sojourn) time of a job is minimized. We obtain the routing decisions of the overall optimal policy and show that they may not be unique, but that the utilization of each service center is uniquely determined by the overall optimal policy. We also consider an individually optimal policy whereby jobs are routed so that each job may feel that its own expected response time is minimized if it knows the mean delay time for each path.
引用
收藏
页码:119 / 130
页数:12
相关论文
共 14 条
[11]  
Magnanti T.L., 1984, TRANSPORTATION PLANN, P153
[12]  
Tantawi A. N., 1984, PERFORMANCE '84: Models of Computer System Performance. Proceedings of the Tenth International Symposium, P277
[13]   OPTIMAL STATIC LOAD BALANCING IN DISTRIBUTED COMPUTER-SYSTEMS [J].
TANTAWI, AN ;
TOWSLEY, D .
JOURNAL OF THE ACM, 1985, 32 (02) :445-465
[14]  
Wardrop J. G., 1952, P I CIVIL ENG, V1, P325, DOI [10.1680/ipeds.1952.11259, DOI 10.1680/IPEDS.1952.11259]