VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
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
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
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
Network delay analysis of a class of fair queueing algorithms
IEEE Journal on Selected Areas in Communications
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
PLM: fast convergence for cumulative layered multicast transmisson schemes
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Integrated Provision of QoS Guarantees to Unicast and Multicast Traffic in Packet Switches
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
A Scalable Architecture for Fair Leaky-Bucket Shaping
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A theory of multi-channel schedulers for quality of service
Journal of High Speed Networks
Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Providing quality of service guarantees in wireless LANs compliant with 802.11e
Computer Networks: The International Journal of Computer and Telecommunications Networking - Wireless IP through integration of wireless LAN and cellular networks
WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Space priority queue with fuzzy set threshold
Computer Communications
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
IEEE/ACM Transactions on Networking (TON)
Improving communication-phase completion times in HPC clusters through congestion mitigation
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
Providing quality of service guarantees in wireless LANs compliant with 802.11e
Computer Networks: The International Journal of Computer and Telecommunications Networking - Wireless IP through integration of wireless LAN and cellular networks
Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
ARS: an efficient agent-based routing system for QoS guarantees
Computer Communications
QFQ: efficient packet scheduling with tight guarantees
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We introduce a general methodology for designing integrated shaping and scheduling algorithms for packet networks that provide fairness, low end-to-end delay, and low burstiness. The methodology is based on integrating a shaping mechanism with a scheduler from the class of Rate-Proportional Servers (RPS) defined in [Stiliadis 96]. The resulting algorithms provide an end-to-end delay bound identical to that of Weighted Fair Queueing. Their worst-case fairness, in terms of minimizing the worst-case time to empty the session backlog, is much superior to that of Weighted Fair Queueing, and equal to the best known for any scheduling algorithm. In addition, the algorithms achieve a level of fairness in the distribution of free bandwidth among competing sessions better than that of Weighted Fair Queueing. We show that, under this framework, even an unfair scheduling algorithm belonging to the RPS class, such as VirtualClock, can yield worst-case fairness identical to that obtained with Weighted Fair Queueing. We also develop an integrated shaper-scheduler that provides optimal output burstiness and is attractive for use in both network adapters and in switches that support traffic re-shaping. We describe an efficient implementation of this integrated shaping and scheduling algorithm with log_2(V) complexity, where V is the number of sessions sharing the outgoing link.