Numerical Studies on Braess-Like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems
Numerical Studies on Braess-Like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems
复制标题
DOI:
--
复制
发表时间:
--
期刊:
影响因子:
--
通讯作者:
Said Fathy;Hisao El-Zoghdy;Kameda Jie;Li
中科院分区:
文献类型:
--
作者:
Said Fathy;Hisao El-Zoghdy;Kameda Jie;Li
Distributed computer systems consists of nodes (hosts, computers) and a communication means that connects nodes. Jobs arrive at each node and can be forwarded through the communication means to the other nodes for remote processing. Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Unlike the original Braess paradox, in the models examined, this behavior occurs only in the case of finitely many users and not in the case of infinite number of users, and the degree of performance degradation can increase without bound. This study examines numerically, some examples around the Braess-like paradox. From the numerical examples, it is observed that, in the class optimum, the worst ratio of performance degradation in the paradox is largest ( i.e. , the worst performance is obtained) in the complete symmetry case with the arrival rate is closest to the processing rate. And, as the system parameter setting gradually departs the above-mentioned symmetric case without keeping any kind of symmetries, the worst ratio of performance degradation decreases rapidly. It decreases slowly (more slowly) if the system parameter setting departs the complete symmetry while keeping the individual (overall) symmetry property. Indeed, it is also observed that in complete symmetry, if the communication means of type (C) is used, the worst ratio of performance degradation may increase without bound as the arrival rate gets very close to the processing rate.