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
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
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
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
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
Carry-over round robin: a simple cell scheduling mechanism for ATM 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
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
HOL-EDD: a flexible seirvice scheduling scheme for ATM 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
Dynamic resource-allocation for congestion-control in high-speed LAN Interconnection
Computer Communications
| Hi-index | 0.00 |
A work conserving O(1) per-VC queueing algorithm named QLWFQ (Queue Length based Weighted Fair Queueing) for high-speed ATM networks is proposed. The basic process in QLWFQ is the comparison of the current queue length with the weight when a cell arrival or departure occurs. QLWFQ has upward compatibility with Fair Queueing and FIFO, and can be considered to be a simplified version of Weighted Round Robin. A delay bound and a fairness index are derived analytically for the QLWFQ algorithm. The simulation results for heavily and lightly loaded conditions are also presented. The analytical and simulation results show that QLWFQ achieves a better balance between traffic isolation and traffic sharing than timestamp based algorithms.