Connecting Renewal Age Processes with M/D/1 and M/D/∞ Queues Through Stick Breaking

DOI10.1080/15326340903517147zbMath1196.60157MaRDI QIDQ3562377

Andreas Löpker, Johan S. H. van Leeuwaarden, Augustus J. E. M. Janssen

Publication date: 21 May 2010

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326340903517147

zbMATH Keywords

queues; processor sharing; stick breaking; Lambert W functions; renewal age process

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

97I80: Complex analysis (educational aspects)

Related Items

Hitting Times and the Running Maximum of Markovian Growth-Collapse Processes, Importance Sampling for Failure Probabilities in Computing and Data Transmission

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential-difference equations
• Laws of the iterated logarithm for order statistics of uniform spacings
• On the Lambert \(w\) function
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• The busy period of the queueing system M/G/∞
• On the probability of covering the circle by random arcs
• On the lengths of the pieces of a stick broken at random
• Covering the circle with random arcs of random sizes
• Applied Probability and Queues
• Some Time-Dependent Properties of Symmetric M/G/1 Queues
• Uniform renewal theory with applications to expansions of random geometric sums
• A DISCRETE QUEUE, FOURIER SAMPLING ON SZEGÖ CURVES AND SPITZER FORMULAS