High Speed, Scalable, and Accurate Implementation of Packet Fair Queueing Algorithms in ATM Networks (0)
Cached
Download Links
- [redriver.cmcl.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.lb.cs.cmu.edu]
- [www-2.cs.cmu.edu]
- [www.ieee-icnp.org]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of IEEE ICNP '97 |
| Citations: | 19 - 4 self |
BibTeX
@INPROCEEDINGS{Bennett_highspeed,,
author = {Jon C.R. Bennett and Donpaul C. Stephens and Hui Zhang},
title = {High Speed, Scalable, and Accurate Implementation of Packet Fair Queueing Algorithms in ATM Networks},
booktitle = {In Proceedings of IEEE ICNP '97},
year = {},
pages = {7--14}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The fluid Generalized Processor Sharing (GPS) algorithm has desirable properties for integrated services networks and many Packet Fair Queueing (PFQ) algorithms have been proposed to approximate GPS. However, there have been few high speed implementations of PFQ algorithms that can support large number of sessions with diverse rate requirements and at the same time maintain all the important properties of GPS. The implementation cost of a PFQ algorithm is determined by two components: (1) computation of the system virtual time function and (2) maintaining the relative ordering of the packets via their timestamps in a priority queue mechanism. While most of the recently proposed PFQ algorithms reduce the complexity of computing the system virtual time function, the complexity of maintaining the priority queue, and therefore the overall complexity of implementing PFQ, is still a function of the number of active sessions. In addition, while reducing the algorithmic or asymptotic complexit...
