A paradox in optimal flow control of M/M/n queues

A paradox in optimal flow control of M/M/n queues

0.00 Avg rating0 Votes
Article ID: iaor20072099
Country: United Kingdom
Volume: 33
Issue: 2
Start Page Number: 356
End Page Number: 368
Publication Date: Feb 2006
Journal: Computers and Operations Research
Authors: , ,
Keywords: game theory
Abstract:

Optimal flow control problems of multiple-server (M/M/n) queueing systems are studied. Due to enhanced flexibility of the decision making, intuitively, we expect that grouping together separated systems into one system provides improved performance over the previously separated systems. This paper presents a result counter-intuitive against such an expectation. We consider a non-cooperative optimal flow control scheme M/M/n queueing systems where each of multiple players strives to optimize unilaterally its own power where the power of a player is the quotient of the throughput divided by the mean response time for the player. We report a counter-intuitive case where the power of every user degrades after grouping together K(>1) separated M/M/N systems into a single M/M/(K×N) system. Some numerical results are presented.

Reviews

Required fields are marked *. Your email address will not be published.