SIMULATION

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Register here to gain access to SAGE's 500+ Journals Online

Sign In to gain access to subscriptions and/or personal tools.
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Yang, J.-P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?
SIMULATION, Vol. 83, No. 2, 189-198 (2007)
DOI: 10.1177/0037549707080608

Self-Configured Fair Queueing

Jui-Pin Yang

Industrial Technology Research Institute No. 31, Gongye 2nd Rd Annan District Tainan City 709 Taiwan (R.O.C.), jpyang{at}itri.org.tw

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.

Key Words: Self-configured • robust • core-stateless • fairness • scalability


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?