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.


Download BibTeX


Asymmetric convolution algorithm for full-availability group with bandwidth reservation


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

Year of publication


Chapter type


Publication language



EN In the paper a new asymmetric convolution algorithm for the calculation of the occupancy distribution and the blocking probability in the full-availability group (FAG) with bandwidth reservation and multirate traffic streams is proposed. In the paper, an effective method of calculating state probabilities in a reservation space of the system is derived. The analytical results of the blocking probabilities in the FAG with bandwidth reservation obtained on the basis of the proposed method, are compared with the simulation results. This comparison has proved a high accuracy of the proposed algorithm. The proposed asymmetric convolution algorithm can be applied for systems with bandwidth reservation and with arbitrary multirate traffic streams.

Physical description

Dokument elektroniczny





The 12th Asia-Pacific Conference on Communications : August 31 - September 2, 2006, Busan, Republic of Korea

Presented on

12th Asia-Pacific Conference on Communications, APCC 2006, 31.08.2006 - 02.09.2006, Busan, South Korea

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