Analysis of the M/M/1 queue with processor sharing via spectral theory

DOI10.1023/A:1013913827667zbMath0995.60085OpenAlexW1544480245WikidataQ56771047 ScholiaQ56771047MaRDI QIDQ5959269

Fabrice M. Guillemin, Jacqueline Boyer

Publication date: 26 March 2002

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013913827667

zbMATH Keywords

orthogonal polynomialsspectral theoryasymptoticsojourn timeM/M/1processor sharing

Mathematics Subject Classification ID

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

Related Items (15)

Evaluation and prediction of an optimal control in a processor sharing queueing system with heterogeneous servers ⋮ On a processor sharing queue that models balking ⋮ Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ Processor sharing: a survey of the mathematical theory ⋮ Sojourn time in an M/M/1 processor sharing queue with permanent customers ⋮ Sojourn time in a Processor Sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates ⋮ Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ M/M/∞ Transience: Tail Asymptotics of Congestion Periods ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue ⋮ Sojourn times in the \(M/ PH/1\) processor sharing queue ⋮ Data-Fitted Second-Order Macroscopic Production Models

This page was built for publication: Analysis of the M/M/1 queue with processor sharing via spectral theory