Least Busy Alternative Routing in Queueing and Loss Networks

DOI10.1017/S0269964800002667MaRDI QIDQ3416062zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(3)

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

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)