Reducing Randomization in the Power of Two Choices Load Balancing Algorithm
The performance evaluation of many modern communication and manufacturing systems has been made possible by modeling them as queueing networks. Due to the limitations of exact algorithms to analyze general queueing networks, researchers have been focusing on developing approximations. Most of the approximations are lower order approximations in the sense that only a few parameters of the interarrival and service time distributions are used. This could lead to large errors in many conditions. In this paper, higher order approximations are developed for the single server queue with splitting, merging and feedback phenomena, which can then be integrated along with parametric decomposition to develop higher order approximations for queueing networks. Not only are the higher order approximations more accurate, but they can also be used to estimate the higher moments of the performance measures. Ó 2000 Elsevier Science B.V. All rights reserved.