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

DOI10.1016/J.COR.2004.06.009zbMATH Open1116.90027OpenAlexW2152365972MaRDI QIDQ2567166FDOQ2567166

Authors: Atsushi Inoie, Hisao Kameda, Corinne Touati 

Publication date: 29 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.06.009

Recommendations

• Optimal Flow Control of an M/M/ m Queue
• Control of \(M|M|1|N\) queue parameters under constraints
• Optimal flow control of an M/M/1 queue with a balanced budget
• Threshold control policies for heterogeneous server systems
• Numerical study of the optimal control of a system with heterogeneous servers

zbMATH Keywords

optimizationNash equilibriumflow controlBraess paradoxnon-cooperative game\(M/M/n\) queueing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Noncooperative games (91A10)

Cites Work

• Non-cooperative games
• How bad is selfish routing?
• Über ein Paradoxon aus der Verkehrsplanung
• Avoiding the Braess paradox in non-cooperative networks
• The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
• Title not available (Why is that?)
• A note on the convexity of performance measures of M/M/c queueing systems
• Optimal decentralized flow control of Markovian queueing networks with multiple controllers
• Braess's paradox in a loss network
• A paradox of congestion in a queuing network
• Braess's paradox in a queueing network with state-dependent routing
• A game theoretic perspective to flow control in telecommunication networks
• On the existence of equilibria in noncooperative optimal flow control
• Strong Convexity Results for Queueing Systems
• Braess-like paradoxes in distributed computer systems
• Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
• Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users
• The convexity of a general performance measure for multiserver queues
• Optimal Flow Control of an M/M/ m Queue
• Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment

Cited In (6)

• Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
• Optimal Flow Control of an M/M/ m Queue
• Inefficiency in stochastic queueing systems with strategic customers
• A private good/public good decomposition for optimal flow control of an<tex>M/M/1</tex>queue
• A paradox of congestion in a queuing network
• Optimal flow control of an M/M/1 queue with a balanced budget

This page was built for publication: A paradox in optimal flow control of \(M/M/n\) queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567166)