Utility Optimization in Congested Queueing Networks

DOI10.1239/jap/1300198137zbMath1223.60079arXiv0908.3787OpenAlexW1972668250MaRDI QIDQ5391083

N. S. Walton

Publication date: 5 April 2011

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.3787

zbMATH Keywords

large deviationLittle's lawquasi-reversibilityqueueing networkcongestion controlsequences of networkscongestion windowUtility optimization

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Proportional fairness and its relationship with multi-class queueing networks
• On a class of approximations for closed queueing networks
• Big queues.
• The mathematics of internet congestion control
• On stochastic bounds for monotonic processor sharing networks
• Resource pooling in congested networks: Proportional fairness and product form
• Fairness and stability of end-to-end congestion control
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
• Applied Probability and Queues
• Stable, scalable, fair congestion control and aqm schemes that achieve high utilization in the internet
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Utility Optimization in Congested Queueing Networks