The waiting time distribution for the random order service \(M/M/1\) queue

DOI10.1214/AOAP/1034625337zbMath0883.60086OpenAlexW1988031188MaRDI QIDQ1364393

Leopold Flatto

Publication date: 28 September 1997

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

Full work available at URL: https://doi.org/10.1214/aoap/1034625337

zbMATH Keywords

queueLittle's lawwaiting time distributionrandom order service discipline

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Conformal mappings of special domains (30C20) Entire functions of one complex variable (general theory) (30D20)

Related Items (22)

Large deviations of the waiting time in the GI/G/1 queue with random order service ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ On a processor sharing queue that models balking ⋮ Maxima of waiting times for the random order service \(M|M|1\) queue ⋮ The equivalence between processor sharing and service in random order. ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline ⋮ Processor sharing: a survey of the mathematical theory ⋮ Sojourn time asymptotics in processor sharing queues with varying service rate ⋮ Sojourn time in an M/M/1 processor sharing queue with permanent customers ⋮ Batch sojourn time in the processor sharing queue with geometric batch size ⋮ Sojourn time in a Processor Sharing queue with batch arrivals ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Heavy-traffic asymptotics for the single-server queue with random order of service ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ When random-order-of-service outperforms first-come-first-served ⋮ 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 ⋮ Random-order-of-service for heterogeneous customers: waiting time analysis

This page was built for publication: The waiting time distribution for the random order service \(M/M/1\) queue