Data networks
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
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
Hi-index | 0.00 |
In this paper, we present an analysis of an existing rate-based ABR scheduling algorithm described in [1], and propose an enhanced rate-based round robin (RBR) scheduling algorithm for ATM switches and end systems. One of the novel aspects of RBR is that the scheduler supports available bit rate (ABR) traffic as well as guaranteed bandwidth reservations. In addition, bandwidth overbooking is allowed by the scheduler for ABR services to improve link efficiency as recommended by most flow control schemes. Under competition, the scheduler distributes the bandwidth in a max-min fair way. Any unused reservations for guaranteed services are reallocated to ABR services. Finally, the operations performed during each scheduling cycle are constant, independent of the number of connections. Simulation results are also presented and analyzed.