Worst-Case Efficiency Analysis of Queueing Disciplines

DOI10.1007/978-3-642-02930-1_45zbMATH Open1248.90040OpenAlexW1595532028MaRDI QIDQ5321685FDOQ5321685

Authors: Damon Mosk-Aoyama, Tim Roughgarden 

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_45

Recommendations

• Utility Optimization in Congested Queueing Networks
• A private good/public good decomposition for optimal flow control of an<tex>M/M/1</tex>queue
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Efficiency Loss in a Network Resource Allocation Game
• The curse of the first-in-first-out queue discipline

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cited In (3)

• A private good/public good decomposition for optimal flow control of an<tex>M/M/1</tex>queue
• Optimal cost-sharing in general resource selection games
• Restoring Pure Equilibria to Weighted Congestion Games

This page was built for publication: Worst-Case Efficiency Analysis of Queueing Disciplines

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