DMCA
Hierarchical Packet Fair Queueing Algorithms (1997)
Cached
Download Links
- [popeye.snu.ac.kr]
- [redriver.cmcl.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE/ACM Transactions on Networking |
| Citations: | 341 - 7 self |
BibTeX
@INPROCEEDINGS{Bennett97hierarchicalpacket,
author = {Jon C. R. Bennett and Hui Zhang},
title = {Hierarchical Packet Fair Queueing Algorithms},
booktitle = {IEEE/ACM Transactions on Networking},
year = {1997},
pages = {143--156}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS by using one-level variable-rate PFQ servers as basic building blocks. By computing the system virtual time and per packet virtual start/finish times in unit of bits instead of seconds, most of the PFQ algorithms in the literature can be properly defined as variable-rate servers. We develop techniques to analyze delay and fairness properties of variable-rate and hierarchical PFQ servers. We demonstrate that in order to provide tight delay bounds with an H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new PFQ algorithm called WF 2 Q+ that is the first to have all the following three properties: (a) providing the tightest...
Keyphrases
hierarchical packet fair queueing algorithm variable-rate server one-level variable-rate pfq server packet virtual start finish time fairness property hierarchical pfq server rate-adaptive best-effort system virtual time new pfq algorithm small worst-case fair index pfq algorithm idealized hierarchical generalized processor sharing one-level pfq server hierarchical packet fair queueing tight delay basic building block link-sharing service h-pfq server
