Blocking Probabilities for Trunk Reservation Policy
From MaRDI portal
Recommendations
- Blocking probabilites for a single link with trunk reservation
- scientific article; zbMATH DE number 786520
- 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
- Blocking Probability in a Switching Center With Arbitrary Routing Policy
Cited in
(12)- Using program package NSPCG to analyze the trunk reservation service protection method
- Selective trunk with multiserver reservation
- Blocking probabilites for a single link with trunk reservation
- Integration of dispatch and interconnect traffic in a land mobile trunking system. Waiting time distributions
- Blocking Probability in a Switching Center With Arbitrary Routing Policy
- scientific article; zbMATH DE number 176333 (Why is no real title available?)
- Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
- Approximation for overflow moments of a multiservice link with trunk reservation
- A simple approximation of the link model with reservation by a one-dimensional Markov chain
- Blocking probabilities in Erlang loss queues with advance reservation
- Routing and Capacity Allocation in Networks with Trunk Reservation
- Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic
This page was built for publication: Blocking Probabilities for Trunk Reservation Policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724407)