Computational algorithms for blocking probabilities in circuit-switched networks
From MaRDI portal
Publication:1197748
DOI10.1007/BF02023089zbMath0760.90042OpenAlexW1998921021MaRDI QIDQ1197748
Eugene Pinsky, Adrian E. Conway
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/bf02023089
fixed routingcomputation of blocking probabilitiesmulti-rate product-form circuit- switched networks
Communication networks in operations research (90B18) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (3)
Properties of recurrent equations for the full-availability group with BPP traffic ⋮ Optimal static pricing for a tree network ⋮ Computational complexity of loss networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teletraffic engineering for product-form circuit-switched networks
- Insensitivity of blocking probabilities in a circuit-switching network
- Algorithms to determine exact blocking probabilities for multirate tree networks
- Blocking probabilities in large circuit-switched networks
- A New Method For Computing The Normalization Constant Of Multiple-Chain Queueing Networks
- RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
- Routing in circuit-switched networks: optimization, shadow prices and decentralization
- A Queueing System in Which Customers Require a Random Number of Servers
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
- A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model
- Store-and-Forward Buffer Requirements in a Packet Switching Network
- Buffer Management in a Packet Switch
- Sharing Memory Optimally
This page was built for publication: Computational algorithms for blocking probabilities in circuit-switched networks
