Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks

Hisao KAMEDA; Yongbing ZHANG

Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks

Hisao KAMEDA, Yongbing ZHANG

Full Text Views

0

Share
Cite this

Summary :

Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.4 pp.535-542

Publication Date: 1992/07/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Computer Networks

Cite this

Copy

Hisao KAMEDA, Yongbing ZHANG, "Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 4, pp. 535-542, July 1992, doi: .
Abstract: Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e75-d_4_535/_p

Copy

@ARTICLE{e75-d_4_535,
author={Hisao KAMEDA, Yongbing ZHANG, },
journal={IEICE TRANSACTIONS on Information},
title={Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks},
year={1992},
volume={E75-D},
number={4},
pages={535-542},
abstract={Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Uniqueness of Performance Variables for Optimal Static Load Balancing in Open BCMP Queueing Networks
T2 - IEICE TRANSACTIONS on Information
SP - 535
EP - 542
AU - Hisao KAMEDA
AU - Yongbing ZHANG
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - July 1992
AB - Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.
ER -