Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Blocking probability calculation in a FAG with bandwidth reservation

Authors

[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Year of publication

2006

Chapter type

paper

Publication language

english

Abstract

EN This paper presents a new method for blocking probability calculation in the full-availability group (FAG) with multi-rate traffic streams and bandwidth reservation. The proposed method is based on Iversen convolution algorithm worked out for systems without bandwidth reservation. The algorithm consists in calculation of system state probabilities by the convolution operation. In the paper special attention is paid to the method of calculating state probabilities in a reservation space of the system. Analytical results of the blocking probabilities in the FAG with bandwidth reservation, obtained on the basis of the proposed method, are compared with simulation results.

DOI

10.1109/AICT-ICIW.2006.54

URL

https://ieeexplore.ieee.org/document/1602157

Book

International Conference on Internet and Web Applications and Services / Advanced International Conference on Telecommunications, 2006 AICT-ICIW '06, 19 - 25 February 2006, Gosier, Guadeloupe

Presented on

Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 19-25.02.2006, Gosier, Guadeloupe

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.