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

Authors:
Atsushi Inoie;Hisao Kameda;Corinne Touati
Affiliations:
Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Ibaraki 305-8573, Japan;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Ibaraki 305-8573, Japan;Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba Science City, Ibaraki 305-8573, Japan
Venue:
Computers and Operations Research
Year:
2006

Citing 8
Cited 1

Strong convexity results for queueing systems

Operations Research
Optimal decentralized flow control of Markovian queueing networks with multiple controllers

Performance Evaluation
On the existence of equilibria in noncooperative optimal flow control

Journal of the ACM (JACM)
Congestion resulting from increased capacity in single-server queueing networks

IEEE/ACM Transactions on Networking (TON)
Optimal Flow Control of an M/M/m Queue

Journal of the ACM (JACM)
How bad is selfish routing?

Journal of the ACM (JACM)
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers

Journal of the ACM (JACM)
Architecting noncooperative networks

IEEE Journal on Selected Areas in Communications

Minimizing average response time for scheduling stochastic workload in heterogeneous computational grids

HiPC'06 Proceedings of the 13th international conference on High Performance Computing

Quantified Score

Hi-index	0.02

Visualization

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/(KxN) system. Some numerical results are presented.