Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Traffic scheduling in packet-switched networks: analysis, design, and implementation
Hardware-efficient fair queueing architectures for high-speed networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
A novel architecture for queue management in the ATM network
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
A service architecture for ATM: from applications to scheduling
IEEE Network: The Magazine of Global Internetworking
Weighted fair discard scheme for buffer management in the presence of network congestion
Computer Communications
| Hi-index | 0.24 |
B-ISDNs are required to support a variety of services such as audio, data, and video, so that the guarantee of Quality-of-Service (QoS) has become an increasingly important problem. An effective fair scheduling algorithm permits high-speed switches do divide link bandwidth fairly among competing connections. Together with the connection admission control, it can guarantee the QoS of connections. In this paper, we propose a novel fair scheduling algorithm, Virtual-Time-based Round Robin (VTRR). Our scheme maps the priorities of packets into classes and provides service to the first non-empty class in each round, and it uses an estimation method of the virtual time necessary to this service discipline. To find the first non-empty class, VTRR adopts a priority queuing system using a bitvector which decreases the number of instructions that are needed to be carried out in one packet transmission time segment. These policies help VTRR implementation in software, which presents flexibility for upgrade. Our analysis has demonstrated that VTRR provides bounded unfairness and its performance is close to that of Weighted Fair Queuing. Therefore, VTRR gives a good performance and is simple as well, and hence is suitable for B-ISDN.