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 virtual circuit switching node with finite source population and multicast connections

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 approximate recurrent calculation method of the blocking probability in a switching node of virtual circuit networks which is offered a mixture of different traffic streams, including multicast traffic streams, generated by a finite population of two-state sources. The method is based on transforming a multi-dimensional service process in the system into a one-dimensional Markov chain. The basis of the proposed calculation algorithm is an assumption about equality of reverse transition rates in both infinite and finite population models. Such an assumption allows us to determine the number of idle sources of particular traffic classes, which consequently leads to determination of offered traffic load in particular states of the group occupancy. Analytical results of the blocking probabilities in exemplary switching nodes are compared with simulation results.

DOI

10.1109/AICT-ICIW.2006.55

URL

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

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.