DMCA
A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness (1997)
| Venue: | In Proceedings of INFOCOM'97 |
BibTeX
@INPROCEEDINGS{Suri97anew,
author = {Subhash Suri and George Varghese and Girish Chandranmenon},
title = {A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness},
booktitle = {In Proceedings of INFOCOM'97},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worstcase time O(log log N ) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the classical virtual clock and the Self-Clocked Fair Queuing schemes can be thought of as special cases of our scheme, by setting the leap forward parameter appropriately. 1 Introduction The study of service disciplines in integrated services networks has gained significance with the emergence of multimedia applications and electronic commerce. Unlike traditional data applications, real-time applications such as video-on-demand and teleconferencing must meet stringent quality-of-service (QoS) standards to be successful. In an integrated services network, applications with widely different com...
Keyphrases
throughput fairness new fair queuing scheme guaranteed delay integrated service network log log efficient fair service discipline leap forward virtual clock worstcase time self-clocked fair queuing scheme different com classical virtual clock electronic commerce stringent quality-of-service leap forward parameter real-time application special case multimedia application end-to-end delay traditional data application
