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

Bandwidth reservation in the generalised model of the limited availability group

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 In this paper reservation algorithms for a limited-availability group composed of links of various capacities are presented. The group is offered a mixture of different multi-rate traffic streams. A recurrent method of blocking probability calculation in the considered group is also proposed. The method is based on approximation of service process occurring in the group by appropriately constructed one-dimensional Markov chain. The idea of this approximation consists in introducing relevant state-dependent probabilities of passing between adjacent states of the chain. The calculation method of the mentioned probabilities for various reservation algorithms is proposed. Analytical results of the blocking probabilities in limited-availability groups are compared with simulation results.

Pages (from - to)

P53-1 - P53-8

Comments

Zarchiwizowany pełny tekst:

https://web.archive.org/web/20070221152554/http://www.comp.brad.ac.uk/het-net/HET-NETs04/CameraPapers/P53.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.