Towards an Erlang formula for multiclass networks

DOI10.1007/s11134-010-9185-yzbMath1194.90020OpenAlexW2087084611MaRDI QIDQ993483

Matthieu Jonckheere, Jean Mairesse

Publication date: 20 September 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-010-9185-y

zbMATH Keywords

admission controlinsensitivityload balancingstochastic knapsackWhittle networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

From Erlang formula to robust control ⋮ Asymptotics of insensitive load balancing and blocking phases ⋮ Insensitive, maximum stable allocations converge to proportional fairness

Cites Work

• Insensitive bandwidth sharing in data networks
• A survey on statistical bandwidth sharing
• Optimal robust policies for bandwidth allocation and admission control in wireless networks
• Insensitive traffic models for communication networks
• Insensitive load balancing in data networks
• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• Insensitivity in processor-sharing networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards an Erlang formula for multiclass networks