DocumentCode
1094030
Title
Asymmetric convolution algorithm for blocking probability calculation in full-availability group with bandwidth reservation
Author
Glabowski, Mariusz ; Kaliszan, A. ; Stasiak, M.
Author_Institution
Dept. of Electron. & Telecommun., Poznan Univ. of Technol., Poznan
Volume
2
Issue
1
fYear
2008
fDate
2/1/2008 12:00:00 AM
Firstpage
87
Lastpage
94
Abstract
The paper proposes a new approximate calculation method of occupancy distribution and blocking probability in the full-availability group (FAG) with multi-rate traffic streams and bandwidth reservation. The algorithm involves calculation of system state probabilities by a convolution operation. In the paper, an effective method of calculating state probabilities in a reservation space of the system is derived. The analytical results of blocking probabilities in the FAG with bandwidth reservation, obtained on the basis of the proposed analytical method, are compared with the data obtained on the basis of other known analytical methods and with the simulation results. The accuracy of the proposed method is evaluated for different multi-rate Bernoulli (Erlang), Poisson (Engset), Pascal traffic streams. The method proposed is characterised by lower complexity than the convolution algorithm for the FAG with bandwidth reservation devised earlier.
Keywords
bandwidth allocation; communication complexity; convolution; probability; stochastic processes; telecommunication traffic; approximate calculation method; asymmetric convolution algorithm; bandwidth reservation; blocking probability calculation; computational complexity; full-availability group; multirate Bernoulli traffic stream; multirate Pascal traffic stream; multirate Poisson traffic stream; occupancy distribution;
fLanguage
English
Journal_Title
Circuits, Devices & Systems, IET
Publisher
iet
ISSN
1751-858X
Type
jour
DOI
10.1049/iet-cds:20070037
Filename
4464146
Link To Document