Bounding functions of Markov processes and the shortest queue problem

DOI10.2307/1427770zbMATH Open0707.60086OpenAlexW2021644081MaRDI QIDQ3488985FDOQ3488985

Authors: John A. Gubner, B. Gopinath, S. R. S. Varadhan 

Publication date: 1989

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

Full work available at URL: http://hdl.handle.net/1903/4709

Recommendations

• scientific article; zbMATH DE number 3919514
• Bounding Stationary Expectations of Markov Processes
• Stability of join the shortest queue networks
• Martingales and buffer overflow for the symmetric shortest queue model
• Heavy traffic limit theorems for a queueing system in which customers join the shortest line

zbMATH Keywords

Lyapunov functionsupermartingalesparallel queues

Mathematics Subject Classification ID

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

Cited In (3)

• On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
• Bounding Stationary Expectations of Markov Processes
• Serve the shortest queue and Walsh Brownian motion

This page was built for publication: Bounding functions of Markov processes and the shortest queue problem

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