Poly-symmetry in processor-sharing systems

DOI10.1007/S11134-017-9525-2zbMath1391.60221arXiv1610.00560OpenAlexW2996146329MaRDI QIDQ1696946

Céline Comte, Thomas Bonald, Gustavo de Veciana, Virag Shah

Publication date: 15 February 2018

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

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

zbMATH Keywords

performanceprocessor-sharing queueing systemsbalanced fairnesspoly-symmetry

Mathematics Subject Classification ID

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 (1)

Stochastic non-bipartite matching models and order-independent loss queues

Cites Work

• Unnamed Item
• Unnamed Item
• Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
• Insensitive bandwidth sharing in data networks
• Bandwidth sharing and admission control for elastic traffic
• On stochastic bounds for monotonic processor sharing networks
• Resource pooling in congested networks: Proportional fairness and product form
• Submodular functions and optimization.

This page was built for publication: Poly-symmetry in processor-sharing systems