Blocking probabilites for a single link with trunk reservation
From MaRDI portal
Publication:1815453
DOI10.1006/JMAA.1996.0388zbMATH Open0858.90059OpenAlexW1966523353MaRDI QIDQ1815453
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
Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (4)
A critically loaded multirate link with trunk reservation โฎ Optimal trunk reservation for an overloaded link โฎ Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic โฎ Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic
Recommendations
- Optimal trunk reservation for an overloaded link ๐ ๐
- A critically loaded multirate link with trunk reservation ๐ ๐
- Computational algorithms for blocking probabilities in circuit-switched networks ๐ ๐
- Blocking Probability in a Switching Center With Arbitrary Routing Policy ๐ ๐
- Blocking probabilities in large circuit-switched networks ๐ ๐
- Blocking Probability in Link-Frame Systems from the Viewpoint of Overflow Processes ๐ ๐
- Computing blocking probabilities in multiclass wavelength routing networks ๐ ๐
- Blocking Probabilities for Trunk Reservation Policy ๐ ๐
- Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation ๐ ๐
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)