Blocking probabilites for a single link with trunk reservation
From MaRDI portal
(Redirected from Publication:1815453)
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
Cited in
(9)- Asymptotic Analysis of a Loss Model with Trunk Reservation II: Trunks Reserved for Slow Traffic
- 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
- Optimal trunk reservation for an overloaded link
- Blocking Probabilities for an Underloaded or Overloaded Link with Trunk Reservation
- Fixed Point Approximations for Retrial Networks
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)
