Large deviations problems for star networks: the min policy.

DOI10.1214/105051604000000198zbMath1047.60021arXivmath/0406181OpenAlexW3098892735MaRDI QIDQ1879900

Franck Delcoigne, Arnaud de La Fortelle

Publication date: 15 September 2004

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

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

zbMATH Keywords

telecommunication networksbandwidth sharingempirical generator

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Large deviations (60F10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Large deviations problems for star networks: the min policy.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A viscosity solution approach to the asymptotic analysis of queueing systems
• Large deviations for Markov processes with discontinuous statistics. I: General upper bounds
• Large deviations for Markov processes with discontinuous statistics. II: Random walks
• Large deviation principle for Markov chains in continuous time
• Large deviations rate function for polling systems
• Large deviations and queueing networks: Methods for rate function identification
• Large deviations of Jackson networks.
• Large deviations problems for star networks: the min policy.
• Sharing a Processor Among Many Job Classes
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Generalized analytic functions
• The Large Deviation Principle for a General Class of Queueing Systems I