Blocking probabilites for a single link with trunk reservation
From MaRDI portal
Publication:1815453
DOI10.1006/JMAA.1996.0388zbMATH Open0858.90059OpenAlexW1966523353MaRDI QIDQ1815453FDOQ1815453
Authors: John A. Morrison
Publication date: 9 December 1996
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1996.0388
Recommendations
- Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation
- Blocking Probabilities for Trunk Reservation Policy
- Blocking probabilities in large circuit-switched networks
- Blocking Probability in a Switching Center With Arbitrary Routing Policy
- A critically loaded multirate link with trunk reservation
- Optimal trunk reservation for an overloaded link
- Computing blocking probabilities in multiclass wavelength routing networks
- Computational algorithms for blocking probabilities in circuit-switched networks
- Blocking Probability in Link-Frame Systems from the Viewpoint of Overflow Processes
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Communication networks in operations research (90B18)
Cited In (9)
- Blocking Probabilities for Trunk Reservation Policy
- Approximation for overflow moments of a multiservice link with trunk reservation
- A critically loaded multirate link with trunk reservation
- A simple approximation of the link model with reservation by a one-dimensional Markov chain
- Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic
- Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation
- Optimal trunk reservation for an overloaded link
- Fixed Point Approximations for Retrial Networks
- Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic
This page was built for publication: Blocking probabilites for a single link with trunk reservation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815453)