Alternative routeing in fully connected queueing networks

DOI10.1239/AAP/1013540342MaRDI QIDQ2713151zbMATH OpenOpenAlexFDO

Authors C. N. Laws, Y. C. Teh

Publication date 26 July 2001

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

Full work available at URL https://doi.org/10.1239/aap/1013540342

zbMATH Keywords

alternative routeingdynamic routeingoptimizationqueueing networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 822904
• Least Busy Alternative Routing in Queueing and Loss Networks
• scientific article; zbMATH DE number 4059093
• Optimal static customer routing in a closed queuing network
• Dynamic Routing in Fully Connected Networks

Cited in

(9)

• Least Busy Alternative Routing in Queueing and Loss Networks
• Dynamic Routing in Fully Connected Networks
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• scientific article; zbMATH DE number 822904 (Why is no real title available?)
• The Effect of Increasing Routing Choice on Resource Pooling
• Asymptotically optimal control of parallel tandem queues with loss
• Queuing networks with routing calls at nodes
• A paradox in a queueing network with state-dependent routing and loss
• Control of systems with flexible multi-server pools: a shadow routing approach

This page was built for publication: Alternative routeing in fully connected queueing networks

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