Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Product form stationary distributions for queueing networks with blocking and rerouting
Queueing Systems: Theory and Applications
Insensitive queueing models for communication networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimal capacity planning in stochastic loss networks with time-varying workloads
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On processor sharing and its applications to cellular data network provisioning
Performance Evaluation
Insensitive Traffic Models for Communication Networks
Discrete Event Dynamic Systems
Revisiting stochastic loss networks: structures and algorithms
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improved approximations for the Erlang loss model
Queueing Systems: Theory and Applications
Insensitivity and stability of random-access networks
Performance Evaluation
Internet and the Erlang formula
ACM SIGCOMM Computer Communication Review
Blocking probability evaluation of end-to-end dynamic WDM networks
Photonic Network Communications
| Hi-index | 0.00 |
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it is in fact sufficient that users generate sessions according to a Poisson process, each session being composed of a random, finite number of calls and idle periods. A key role is played by the retrial behavior in case of call blocking. We illustrate the results by a number of examples.