State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design

DOI10.1007/BF02023088zbMath0768.90024MaRDI QIDQ1197746

R. J. Gibbens, Debasis Mitra

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

aggregated-least-busy-alternative; asymptotically optimum trunk reservation parameter; circuit-switched loss networks

Mathematics Subject Classification ID

90B18: Communication networks in operations research

Related Items

Optimal trunk reservation for an overloaded link, Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic, Optimization via trunk reservation in single resource loss systems under heavy traffic, Loss circuit switched communication network -- performance analysis and dynamic routing, An effective numerical method for controlled routing in large trunk line networks, A numerical method for reflected diffusions: Control of the reflection directions and applications, Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic

Cites Work

• Unnamed Item
• Investigation of a fully connected channel switching network with many nodes and alternative routes
• On critically loaded loss networks
• Dynamic Routing in Fully Connected Networks
• Heavy-Traffic Approximations for Service Systems With Blocking
• Blocking probabilities in large circuit-switched networks
• A Class of Closed Markovian Queuing Networks: Integral Representations, Asymptotic Expansions, and Generalizations*
• Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
• State-dependent routing on symmetric loss networks with trunk reservations. I
• Some Properties of the Erlang Loss Function