@inproceedings{4ccc60cae0d44610ab449221ecbc2c36,
title = "Speeding up the convergence of estimated fair share in CSFQ",
abstract = "Core-stateless Fair Queueing (CSFQ) is a scheme to achieve approximate fair bandwidth sharing without per-flow state in the interior routers. The extra packets that beyond the fair share for each flow are dropped probabilistically based on the attached flow rate in the packet header and the estimated fair share. A heuristic method is used to estimate the fair share in CSFQ. In our previous work CSFQIMP (CSFQ Improvement), we took the probabilistic idea from SRED (Stabilized RED) and applied it in CSFQ to estimate the fair share. The probabilistic approach achieves a comparable or even better performance than the original heuristic approach. However, the convergence speed of the probabilistic approach is slow. Therefore, we propose a method to speed up the convergence of the fair share estimate in this paper. The idea comes from that the router randomly selects k packets instead of one packet to compare with the incoming packet in SRED. We show that the convergence speed is increased in the usual cases. Simulation results show that the speedup approach achieves a quick convergence compared with the original probabilistic method in our previous work.",
keywords = "CSFQ, Convergence, Fairness, Network Management",
author = "Peng Wang and Mills, \{David L.\}",
year = "2005",
language = "English",
isbn = "0889865159",
series = "Proceedings of the Fourth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2005",
pages = "14--20",
editor = "M.H. Hamza",
booktitle = "Proceedings of the Fourth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2005",
note = "Fourth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2005 ; Conference date: 31-10-2005 Through 02-11-2005",
}