Stability of a Processor-Sharing Queue with Varying Throughput

DOI10.1239/JAP/1231340226zbMATH Open1154.60352arXiv0803.2459OpenAlexW2964093452MaRDI QIDQ5504152FDOQ5504152

Authors: Pascal Moyal 

Publication date: 21 January 2009

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

Abstract: In this paper, we present a stability criterion for Processor Sharing queues, in which the throughput may depend on the number of customers in the system (in such cases such as interferences between the users). Such a system is represented by a point measure-valued stochastic recursion keeping track of the remaining processing times of the customers.

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

Recommendations

• A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
• On the stability of the multi-queue multi-server processor sharing with limited service
• Tail asymptotics for processor-sharing queues
• Stationarity of measure-valued stochastic recursions: Applications to the pure delay system and the SRPT queue
• On the stability condition of a precedence-based queueing discipline

zbMATH Keywords

stabilityqueueing systemstochastic recurrenceprocessor sharingmeasure-valued process

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Stochastically recursive sequences and their generalizations

Cited In (9)

• Stabilizing performance in a single-server queue with time-varying arrival rate
• Stationarity of measure-valued stochastic recursions: Applications to the pure delay system and the SRPT queue
• Mathematical problems in the theory of processor-sharing queueing systems
• The queue with impatience: construction of the stationary workload under FIFO
• Stability of Processor Sharing Networks with Simultaneous Resource Requirements
• On differential equations arising in the theory of processor sharing queues
• A perturbation method for solving some queues with processor sharing discipline
• On the stability of the multi-queue multi-server processor sharing with limited service
• On queues with impatience: stability, and the optimality of earliest deadline first

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

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