High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

Authors:
J. C. R. Bennett;D. C. Stephens;Hui Zhang
Affiliations:
-;-;-
Venue:
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Year:
1997

Citing 0
Cited 8

Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
V${\cal V}$-NET: A Versatile Network Architecture for Flexible Delay Guarantees in Real-Time Networks

IEEE Transactions on Computers
Preserving quality of service guarantees in spite of flow aggregation

IEEE/ACM Transactions on Networking (TON)
Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies

Performance Evaluation
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
A hybrid framework of RR scheduler to ensure priority, low complexity and delay with relative fairness

ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
XML-based policy engineering framework for heterogeneous network management

APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services

Quantified Score

Hi-index	0.00

Visualization

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 complexity has been the focus of most analysis, to run at high speed, it is also important to reduce the complexity of basic operations. In this paper, we develop techniques to reduce both types of complexities. In particular, we present a novel grouping architecture for implementing PFQ with an algorithmic complexity that is a function of the number of distinct rates supported, but independent of the number of sessions in the system.