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

Generalised model of the limited-availability group with finite source population

Authors

[ 1 ] Instytut Elektroniki i Telekomunikacji (IEt), Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication

2004

Chapter type

paper

Publication language

english

Abstract

EN This paper presents a method of estimating blocking probabilities in a generalised model of the limited-availability group which is offered multi-service traffic streams generated by a finite population of two-state sources (pseudo-random traffic). The method is based on approximation of multi-dimensional Markov process – occurring in the considered system – by the appropriately constructed 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 traffic offered in particular states of service process in the group. The accuracy of the proposed method is elaborated by comparing the results of analytical calculations of blocking probability with simulation results.

Pages (from - to)

P40-1 - P40-10

Comments

Zarchiwizowany pełny tekst:

https://web.archive.org/web/20070221145933/http://www.comp.brad.ac.uk/het-net/HET-NETs04/CameraPapers/P40.pdf

Book

IFIP International Working Conference on Performance Modelling and Evaluation of Heterogenous Networks HET-NETs 2004, Ilkley, UK, 2004

Presented on

2nd International Working Conference on Performance Modelling and Evaluation of Heterogenous Networks HET-NETs 2004, 26-28.07.2004, Ilkley, United Kingdom

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