Asymptotics of overflow probabilities in Jackson networks.

DOI10.1016/J.ORL.2003.07.002zbMath1045.90009OpenAlexW2031402803MaRDI QIDQ1426731

Ji-Yeon Lee

Publication date: 15 March 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.07.002

zbMATH Keywords

AsymptoticsJackson networkOverflow probability

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Point processes and queues. Martingale dynamics
• Asymptotics of first passage times for random walk in an orthant
• The non-ergodic Jackson network
• A quick simulation method for excessive backlogs in networks of queues
• The optimal buffer allocation problem
• Correctness within a constant of an optimal buffer allocation rule of thumb
• Analysis of an importance sampling estimator for tandem queues
• Networks of Waiting Lines

This page was built for publication: Asymptotics of overflow probabilities in Jackson networks.