State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
From MaRDI portal
Publication:1197746
DOI10.1007/BF02023088zbMath0768.90024OpenAlexW2082533690MaRDI QIDQ1197746
Publication date: 16 January 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023088
aggregated-least-busy-alternativeasymptotically optimum trunk reservation parametercircuit-switched loss networks
Related Items
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 ⋮ Optimization via trunk reservation in single resource loss systems under heavy traffic ⋮ Optimal trunk reservation for an overloaded link ⋮ Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic ⋮ Loss circuit switched communication network -- performance analysis and dynamic routing ⋮ 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
This page was built for publication: State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
