DocumentCode
3333071
Title
Convolution algorithm for overflow calculation in integrated services networks
Author
Glabowski, Mariusz ; Kaliszan, Adam
Author_Institution
Dept. of Commun. & Comput. Networks, Poznan Univ. of Technol., Poznan, Poland
fYear
2011
fDate
2-5 Oct. 2011
Firstpage
428
Lastpage
433
Abstract
The present article proposes a new method for modelling multi-service packet networks with implemented traffic overflow mechanisms. The basis for the proposed method is a special convolution algorithm that enables to determine the occupancy distribution and the blocking probability in network systems in which packet streams (calls) of individual traffic classes can be serviced by both direct and alternative resources. The algorithm worked out by the authors makes it possible to model systems with any type of traffic offered to direct groups. The methods that are to be found and are described in the literature of the subject permit the researcher to model systems in which direct groups are offered either Erlang or Engset streams.
Keywords
IntServ networks; probability; telecommunication traffic; Engset stream; Erlang stream; blocking probability; convolution algorithm; integrated service networks; multiservice packet network modelling; occupancy distribution; overflow calculation; packet streams; traffic classes; traffic overflow mechanisms; Accuracy; Analytical models; Convolution; Equations; IP networks; Mathematical model; Probability;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (APCC), 2011 17th Asia-Pacific Conference on
Conference_Location
Sabah
Print_ISBN
978-1-4577-0389-8
Type
conf
DOI
10.1109/APCC.2011.6152847
Filename
6152847
Link To Document