Stability of Processor Sharing Networks with Simultaneous Resource Requirements

DOI10.1239/JAP/1189717534MaRDI QIDQ5440637zbMATH OpenOpenAlexFDO

Authors Jennie C. Hansen, Cian Reynolds, Stan Zachary

Publication date 5 February 2008

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

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

zbMATH Keywords

stabilityentrainmentprocessor sharing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Abstract: We study the phenomenon of entrainment in processor sharing networks, whereby, while individual network resources have sufficient capacity to met demand, the requirement for simultaneous availability of resources means that a network may nevertheless be unstable. We show that instability occurs through poor control, and that, for a variety of network topologies, only small modifications to controls are required in order to ensure stability. For controls which possess a natural monotonicity property, we give some new results for the classification of the corresponding Markov processes, which lead to conditions both for stability and for instability.

Recommendations

• On stochastic bounds for monotonic processor sharing networks
• Stability of a Processor-Sharing Queue with Varying Throughput
• Processing Networks
• Insensitivity in processor-sharing networks
• Stability of linear EDF networks with resource sharing

Cites work

• scientific article; zbMATH DE number 1193442 (Why is no real title available?)
• Applied Probability and Queues
• Bandwidth sharing and admission control for elastic traffic
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• On stochastic bounds for monotonic processor sharing networks
• Rate control for communication networks: shadow prices, proportional fairness and stability

Cited in

(5)

• Flow-level performance and capacity of wireless networks with user mobility
• Dynamic interactive stabilization of systems of flow with processor sharing
• Instability of sharing systems in the presence of retransmissions
• Fluid limits for networks with bandwidth sharing and general document size distributions
• Stable strategies for processor sharing systems

This page was built for publication: Stability of Processor Sharing Networks with Simultaneous Resource Requirements

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