Title :
Convolution Algorithm for State-Passage Probabilities Calculation in Limited-Availability Group
Author :
Abowski, Mariusz G. ; Kaliszan, Adam ; Stasiak, Maciej
Author_Institution :
Commun. & Comput. Networks, Poznan Univ. of Technol., Poznan
Abstract :
In this paper it is proposed an approximate method of calculations of occupancy distribution and blocking probability in a generalized model of a limited-availability group. The basis of the proposed method is a new algorithm of state-passage probabilities estimation in the limited-availability group. The algorithm is based on the convolution operation of distributions of unavailable resources in the limited-availability group for calls of offered traffic classes. The proposed algorithm is characterized by low order of computational complexity.
Keywords :
computational complexity; convolution; probability; telecommunication computing; telecommunication services; telecommunication traffic; blocking probability; computational complexity; convolution algorithm; occupancy distribution; state-passage probabilities; traffic classes; Availability; Bandwidth; Computational complexity; Computer networks; Convolution; ISDN; Probability; State estimation; Telecommunication traffic; Traffic control; convolution algorithm; limited-availability group; multi-service systems;
Conference_Titel :
Telecommunications, 2008. AICT '08. Fourth Advanced International Conference on
Conference_Location :
Athens
Print_ISBN :
978-0-7695-3162-5
Electronic_ISBN :
978-0-7695-3162-5
DOI :
10.1109/AICT.2008.45
