Self-Configured Fair Queueing

Authors:
Jui-Pin Yang
Affiliations:
Industrial Technology Research Institute No. 31, Gongye2nd Rd Annan District Tainan City 709 Taiwan (R.O.C.)
Venue:
Simulation
Year:
2007

Citing 9
Cited 2

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Wide-area traffic: the failure of Poisson modeling

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Self-similarity in the web

ACM Transactions on Internet Technology (TOIT)
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
Performance analysis of threshold-based selective drop mechanism for high performance packet switches

Performance Evaluation
Enhancing Internet Robustness against Malicious Flows Using Active Queue Management

ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems

Controlling resource hogs in mobile delay-tolerant networks

Computer Communications
Stateless Fair Admission Control

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many core-stateless mechanisms have been proposed to resolve the scalability problem in the core routers. However, they place considerable reliance on the edge routers or anterior core routers to mark correct flow information in corresponding packets. As a result, the condition of incorrect flow information may severely degrade the fairness among different flows. To achieve the robust fairness, an approximately core-stateless fair sharing mechanism, self-configured fair queuing (SCFQ) is proposed in this paper. This mechanism is mainly composed of two rate estimators; one estimator is used to estimate the arrival rate of the malicious flows that can be adopted to emend the incorrect flow information of the arrival packets. The other one is used to estimate the fair share rate. Computer Simulation is applied to compare the fairness of the SCFQ, core-stateless fair queuing (CSFQ), linear fair sharing estimation (LFSE), deficit round robin (DRR), and first in first out (FIFO). From the simulation results, the SCFQ is capable of supporting much better fairness than that of other compared mechanisms under a variety of traffic conditions. Also, the overhead of the SCFQ is low, so it is very suitable to be deployed in high-speed core routers.