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 in multi-service switching networks with finite source population

Authors

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

Year of publication

2007

Chapter type

paper

Publication language

english

Keywords
EN
  • Generalised Multiclass Engset Model
  • multi-rate model
  • full-availability group
Abstract

EN This paper presents a new approximate calculation method of the occupancy distribution and the blocking probability in switching networks which are offered multi-service traffic streams generated by a finite population of two-state sources. The proposed method belongs the class of methods known as the effective availability methods. The basis of the proposed calculation algorithm is the occupancy distributions in interstage links as well as in the outgoing links (forming outgoing directions). These distributions are calculated with the help of the full-availability group model and the limited-availability group model. The results of analytical calculations of the blocking probabilities are compared with the simulation results of three- stage switching networks with infinite source population, and, therefore, the validity of the assumptions used in the model is proved.

Pages (from - to)

793 - 798

DOI

10.1109/ICTMICC.2007.4448590

URL

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

Book

ICT-MICC 2007. 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications. Proceeding

Presented on

2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, ICT-MICC 2007, 14-17.05.2007, Penang, Malaysia

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