Tail asymptotics for processor-sharing queues

DOI10.1239/aap/1086957584zbMath1054.60094OpenAlexW2083942236MaRDI QIDQ4819494

Fabrice M. Guillemin, Philippe Robert, Bert Zwart

Publication date: 24 September 2004

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

Full work available at URL: https://research.tue.nl/nl/publications/tail-asymptotics-for-processor-sharing-queues(1683e12e-77f3-4c70-9af7-08abd7a4574c).html

zbMATH Keywords

heavy tailprocessor sharing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (14)

Evaluation and prediction of an optimal control in a processor sharing queueing system with heterogeneous servers ⋮ On the stability of the multi-queue multi-server processor sharing with limited service ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduced load equivalence under subexponentiality
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• The multiple phase service network with generalized processor sharing
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Sampling at subexponential times, with queueing applications
• Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues
• Tail Asymptotics for the Busy Period in the GI/G/1 Queue
• Insensitivity in queueing systems
• Networks of queues
• Processor-shared buffers with reneging
• Intermediate Regular and Π Variation
• Insensitivity in processor-sharing networks
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
• The busy period of the M/GI/\(\infty\) queue

This page was built for publication: Tail asymptotics for processor-sharing queues