Quantitative analysis of 'BET-TER' scheduling algorithm capabilities in handling best effort traffic in ATM networks

• Autorzy: Burakowski W. , Ahmed A.M.
• Języki publikacji: EN

Abstrakty

EN

ATM networks have to handle at least two types of traffic. A Guaranteed Bandwidth Traffic (GBT), and the so-called Best Effort Traffic (BET). In order to handle these types of traffic properly, ATM network must, firstly, guarantee the QoS of the GBT, and secondly, at the same time, obtain a high level of network resources utilization by serving the BET traffic. Some schedulers guarantee the quality of service of GBT, but cause the starvation of BET traffic. Other schedulers such as WFQ assign a non-zero weight to BET in order to avoid its starvation. In the paper we demonstrate that the proposed earlier BET-TER scheduling algorithm handles the GBT and BET without the above mentioned drawbacks of known scheduling disciplines. This is proven, in the paper, via analytical quantitative analysis and simulation experiments.

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 1999
• Tom: Vol. 25, nr 4
• Strony: 71--81
• Opis fizyczny: Bibliogr. 9 poz., rys. 6,

Twórcy

autor

Burakowski W.

autor

Ahmed A.M.

• Warsaw University of Technology, Institute of Telecommunications, ul. Nowowiejska 15/19, 00-665 Warsaw, Poland