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

Hisao KAMEDA  Yongbing ZHANG  

IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.4   pp.535-542
Publication Date: 1992/07/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Computer Networks
distributed computer system,  communication network,  BCMP queueing network,  static load balancing,  static routing,  nonlinear optimization problem,  

Full Text: PDF(645.4KB)
>>Buy this Article

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.