Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks

Authors:
Tibor Cinkler;László Ast
Affiliations:
-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 5
Cited 0

Congestion probabilities in a circuit-switched integrated services network

Performance Evaluation
Multicasting on the Internet and Its Applications

Multicasting on the Internet and Its Applications
Routing and Dimensioning in Circuit-Switched Networks

Routing and Dimensioning in Circuit-Switched Networks
Multiservice Loss Models for Broadband Telecommunication Networks

Multiservice Loss Models for Broadband Telecommunication Networks
A new degree of freedom in ATM network dimensioning: optimizing the logical configuration

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the end-to-end call blocking probability computation in multi-rate loss networks the so called reduced load approximation under link independence assumption is often used, because it allows derivation of analytical results. However, its accuracy and extendibility to multirouting or multicasting networks (like the B-ISDN) is seldom studied. This paper proposes new analytical methods for approximating the call blocking probabilities for alternative routing and point-to-multipoint connections. The results are derived for different cases and techniques and further generalised for Whitt's summation bound.