Poly-symmetry in processor-sharing systems

DOI10.1007/S11134-017-9525-2MaRDI QIDQ1696946zbMATH OpenOpenAlexFDO

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

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

balanced fairnessperformancepoly-symmetryprocessor-sharing queueing systems

Mathematics Subject Classification ID

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

Abstract: We consider a system of processor-sharing queues with state-dependent service rates. These are allocated according to balanced fairness within a polymatroid capacity set. Balanced fairness is known to be both insensitive and Pareto-efficient in such systems, which ensures that the performance metrics, when computable, will provide robust insights into the real performance of the system considered. We first show that these performance metrics can be evaluated with a complexity that is polynomial in the system size if the system is partitioned into a finite number of parts, so that queues are exchangeable within each part and asymmetric across different parts. This in turn allows us to derive stochastic bounds for a larger class of systems which satisfy less restrictive symmetry assumptions. These results are applied to practical examples of tree data networks, such as backhaul networks of Internet service providers, and computer clusters.

Recommendations

• Processor sharing: a survey of the mathematical theory
• Stable strategies for processor sharing systems
• The impact of symmetry on software distributed shared memory
• scientific article; zbMATH DE number 4195188
• scientific article; zbMATH DE number 1902275

Cites work

• Bandwidth sharing and admission control for elastic traffic
• scientific article; zbMATH DE number 1350310 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
• Insensitive bandwidth sharing in data networks
• On stochastic bounds for monotonic processor sharing networks
• Resource pooling in congested networks: Proportional fairness and product form
• Submodular functions and optimization.

Cited in

(2)

• On stochastic bounds for monotonic processor sharing networks
• Stochastic non-bipartite matching models and order-independent loss queues

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

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