loading...
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
Cambridge, Massachusetts July 27-July 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/NCA.2005.4Fourth IEEE International Symposium o ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Peng Wang, David L. Mills, "A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ," Network Computing and Applications, IEEE International Symposium on, pp. 59-66, Fourth IEEE International Symposium on Network Computing and Applications, 2005.
 
 
BibTex
x
 
@article{ 10.1109/NCA.2005.4,
author = {Peng Wang and David L. Mills},
title = {A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ},
journal ={Network Computing and Applications, IEEE International Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2326-9},
pages = {59-66},
doi = {http://doi.ieeecomputersociety.org/10.1109/NCA.2005.4},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Network Computing and Applications, IEEE International Symposium on
TI - A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
SN - 0-7695-2326-9
SP59
EP66
A1 - Peng Wang,
A1 - David L. Mills,
PY - 2005
KW - null
VL - 0
JA - Network Computing and Applications, IEEE International Symposium on
ER -
 
Peng Wang, Department of Electrical & Computer Engineering,University of Delaware Newark, DE
David L. Mills, Department of Electrical & Computer Engineering,University of Delaware Newark, DE

The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by dropping the extra packets beyond the fair share bandwidth at the routers. A heuristic method is used to estimate the fair share in CSFQ. Furthermore, we know that SRED (Stabilized RED) uses a probabilistic method based on a Zombie list to estimate the number of flows at the router. In this paper, we take the probabilistic idea from SRED and apply it in CSFQ to estimate the fair share without using the Zombie list. Simulation results show that the new probabilistic approach achieves a comparable or even better performance than the original heuristic approach.

Citation:
Peng Wang, David L. Mills, "A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ," nca, pp.59-66, Fourth IEEE International Symposium on Network Computing and Applications, 2005
Usage of this product signifies your acceptance of the Terms of Use.