CELL SCHEDULING FOR ATM SWITCH WITH DELAY-SENSITIVE AND LOSS-SENSITIVE TRAFFIC

The flexibility of asynchronous transfer mode (ATM) allows it to suppo rt various types of applications with diversified quality of service r equirements. We broadly classified these services into the delay-sensi tive (DS) class and the loss-sensitive (LS) class. The scheduling prob lem for two priority classes is much more complex than the single prio rity class counterpart. The scheduling algorithm is required to satisf y two conflicting requirements: (i) maintaining the cell delay of DS t raffic within an acceptable range by giving it a higher transmission p riority; (ii) minimizing the cell loss probability of LS traffic. In t his paper, we present a distributed reservation-based scheduling algor ithm that can effectively handle the requirements of both the DS and L S classes at the same time. The performance of the proposed method is compared with two other scheduling approaches via simulation (C) 1998 Elsevier Science B.V.