Stability of a Processor-Sharing Queue with Varying Throughput

DOI10.1239/JAP/1231340226zbMath1154.60352arXiv0803.2459OpenAlexW2964093452MaRDI QIDQ5504152

Pascal Moyal

Publication date: 21 January 2009

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

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

zbMATH Keywords

stabilityqueueing systemprocessor sharingmeasure-valued processstochastic recurrence

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Functional limit theorems; invariance principles (60F17) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12)

Related Items (2)

On queues with impatience: stability, and the optimality of earliest deadline first ⋮ The queue with impatience: construction of the stationary workload under FIFO

Cites Work

• Stochastically recursive sequences and their generalizations
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability of a Processor-Sharing Queue with Varying Throughput