Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Introduction to algorithms
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium 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)
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Introduction to Computer Organization
Introduction to Computer Organization
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Call Admission Control Schemes under the Generalized Processor Sharing Scheduling
Call Admission Control Schemes under the Generalized Processor Sharing Scheduling
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource
Lottery and stride scheduling: flexible proportional-share resource management
Lottery and stride scheduling: flexible proportional-share resource management
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
WF2Q: worst-case fair weighted fair queueing
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
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
The unprecedent development of the World Wide Web, and the emerging of new types of applications such as video-on-demand and teleconferencing put an increasing pressure on the communication infrastructure. One of the main components that directly determine the communication bandwidth and the quality of services that are provided are the communication switches. In this paper, we propose a new scheduling algorithm for servicing the output sessions of a high-speed ATM switch that is both accurate and efficient. To each session we associate a weight w that represents the share of the communication bandwidth it should receive. To characterize the allocation accuracy we give bounds for the difference (called lag) between the number of time slots that each session should receive and the number of time slots it actually receives. Specifically, we show that in the particular case in which the aggregate weight W over all sessions is a power of two, the lag of a session with weight w is bounded by O(ones(w)), where ones(w) represents the number of ones in the binary representation of w. In the general case in which the aggregate weight has an arbitrary value, we show that the session's lag is bounded by O(logw). The selection of the session to be serviced during the next time slot takes O(loglogW). We also propose a simple hardware implementation that reduces the selection time complexity to O(1). Finally, we discuss the application of our algorithm in the context of both work-conserving and non-work-conserving disciplines.