Analysis of input and output queueing for nonblocking ATM switches
IEEE/ACM Transactions on Networking (TON)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Call admission control schemes: a review
IEEE Communications Magazine
Queueing in high-performance packet switching
IEEE Journal on Selected Areas in Communications
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Credit-based flow control for ATM networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
The flexibility of asynchronous transfer mode (ATM) allows it to support various types of applications with diversified quality of service requirements. We broadly classified these services into the delay-sensitive (DS) class and the loss-sensitive (LS) class. The scheduling problem for two priority classes is much more complex than the single priority class counterpart. The scheduling algorithm is required to satisfy two conflicting requirements: (i) maintaining the cell delay of DS traffic within an acceptable range by giving it a higher transmission priority; (ii) minimizing the cell loss probability of LS traffic. In this paper, we present a distributed reservation-based scheduling algorithm that can effectively handle the requirements of both the DS and LS classes at the same time. The performance of the proposed method is compared with two other scheduling approaches via simulation.