Download:
by Atsushi Inoie, Hisao Kameda, Corinne Touati
Proc. of the IEEE CDC’04
http://www.osdp.is.tsukuba.ac.jp/~corinne/Articles/MMm.pdf
Add To MetaCart
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.
Citations
|
217
|
Queueing Systems, volume II. Computer Applications
– Kleinrock
- 1976
|
|
33
|
Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment
– Zhang, Douligeris
- 1992
|
|
32
|
Congestion resulting from increased capacity in single-server queueing networks
– Cohen, Jeffries
- 1997
|
|
23
|
Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users
– Altman, Ba¸sar, et al.
- 1999
|
|
19
|
A game theoretic perspective to flow control in telecommunication networks
– Douligeris, Mazumdar
- 1992
|
|
17
|
and deterministic rules of thumb for probabilistic problems in computer communications
– Power
- 1979
|
|
17
|
Braess's paradox in a queueing network with state depending routing
– Calvert, Solomon, et al.
- 1997
|
|
12
|
On Flow Control in Computer Networks
– Kleinrock
- 1978
|
|
9
|
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
– Kameda, Pourtallier
- 2002
|
|
4
|
Über ein paradoxien aus der verkehrsplanung
– Braess
- 1968
|
|
4
|
The convexity of a general performance measure for multiserver queues
– Harel, Zipkin
- 1987
|
|
4
|
Strong convexity results for queueing systems
– Harel, Zipkin
- 1987
|
|
2
|
Non-cooperative games
– JF
- 1951
|
|
2
|
Architecting noncooperative networks
– KorilisYA, Orda
- 1995
|
|
2
|
Existence and uniqueness of equilibrium points for concave N-person games. Econometrica 1965;33:153–63
– JB
|
|
1
|
Hänle J, König A, Pade E. Free buffer allocation—an investigation by simulation. Computer Networks
– Giessler
- 1978
|
|
1
|
Optimal decentralized flow control of Markovian queueing networks with multiple controllers. Performance Evaluation
– MT, AA
- 1991
|
|
1
|
On the existence of equilibria in noncooperative optimal flow control
– YA, AA
- 1995
|
|
1
|
Optimal flow control of an M/M/m queue
– AA
|
|
1
|
Braess’ paradox in a loss network
– NG, FP, et al.
- 1997
|
|
1
|
FP. Aparadox of congestion in a queueing network
– JE, Kelly
- 1990
|
|
1
|
Kozawa T, Hosokawa Y. Braess-like paradoxes in distributed computer systems
– Kameda, Altman
|
|
1
|
Avoiding the Braess paradox in non-cooperative networks
– YA, AA, et al.
- 1999
|
|
1
|
How bad is selflsh routing
– Roughgarden, Tardos
|
|
1
|
The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
– Glassmann
- 1983
|
|
1
|
A note on the convexity of performance measures of M/M/c queueing systems
– HL, MA
- 1983
|
