Least Busy Alternative Routing in Queueing and Loss Networks

DOI10.1017/S0269964800002667zbMATH Open1134.90327OpenAlexW2077591256MaRDI QIDQ3416062FDOQ3416062

Authors: P. J. Hunt, C. N. Laws 

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800002667

Recommendations

• Alternative routeing in fully connected queueing networks
• Asymptotically Optimal Loss Network Control
• scientific article; zbMATH DE number 786519
• scientific article; zbMATH DE number 934460
• A limit result respecting graph structure for a fully connected loss network with alternative routing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic network models in operations research (90B15)

Cites Work

• Loss networks
• Open Queueing Networks in Heavy Traffic
• Equilibria for diffusion models of pairs of communicating computers--Symmetric case
• Dynamic Routing in Fully Connected Networks
• A limit result respecting graph structure for a fully connected loss network with alternative routing

Cited In (3)

• Asymptotically optimal control of parallel tandem queues with loss
• Alternative routeing in fully connected queueing networks
• Filtering policies in loss queueing network location problems

This page was built for publication: Least Busy Alternative Routing in Queueing and Loss Networks

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