Self-configured fair queueing

Simulation

Volumn 83, Issue 2, 2007, Pages 189-198

  Yang, Jui Pin ^a  

^a INDUSTRIAL TECHNOLOGY RESEARCH INSTITUTE   (Taiwan)

Author keywords

Core stateless; Fairness; Robust; Scalability; Self configured

Indexed keywords

COMPUTER SIMULATION; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION TRAFFIC;

CORE-STATELESS FAIR QUEUEING; LINEAR FAIR SHARING ESTIMATION; SELF-CONFIGURED FAIR QUEUEING;

QUEUEING NETWORKS;

EID: 34447107692     PISSN: 00375497     EISSN: 17413133     Source Type: Journal    
DOI: 10.1177/0037549707080608     Document Type: Article

References (20)

1. Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., Peterson, L., Ramakri, K., Shenker S., Wroclawski J., and Zhang, L. 1998. Recommendations on queue management and congestion avoidance in the Internet, IETF RFC 2309.
2. Mankin, A., and Ramakrishnan K. 1991. Gateway congestion control survey, IETF RFC 1254.
3. Parekh, A., and R. Gallager. 1993. A generalized processor sharing approach to flow control: The single node case. IEEE/ACM Transactions on Networking 1 (3): 344-57.
4. Hasegawa, G., T. Matsuo, M. Murata, and H. Miyahara. 2000. Comparisons of packet scheduling algorithms for fair service among connections on the Internet. In Proceedings of IEEE INFOCOM, pp. 1253-62.
5. Shreedhar, M., and G. Varghese. 1996. Efficient fair queuing using deficit round-robin. IEEE/ACM Transactions on Networking 4 (3): 375-85.
6. Hasegawa, G., and M. Murata. 2001. Survey on fairness issues in TCP congestion control mechanisms. IEICE Transactions on Communications E84-B (6): 1461-72.
7. Lin, D., and R. Morris. Dynamics of random early detection. In Proceedings of ACM SIGCOMM, 1997, pp. 127-37.
8. Anjum, F.M., and L. Tassiulas. 1999. Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet. In Proceedings of IEEE INFOCOM, pp. 1412-20.
9. Stoica, I., S. Shenker, and H. Zhang. 2003. Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high-speed networks. IEEE/ACM Transactions on Networking 11 (1): 33-46.
10. Floyd, S., and V. Jacobson. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking 1 (4): 397-413.
11. Yang, J.P., M.C. Liang, and Y.S. Chu. 2004. Linear fair sharing estimation. In Proceedings of WTC/ISS2004, pp. 10-15.
12. Cao, Z., Z. Wang, and E. Zegura. 2000. Rainbow fair queueing: Fair bandwidth sharing without per-flow state. In Proceedings of IEEE INFOCOM, pp. 922-31.
13. Kurimoto, T., T. Shimizu, and R. Kawamura. 2001. Core-stateless RED algorithm for improving fairness in a best-effort network. IEICE Transactions on Communications E84-B (5): 1413-21.
14. Pan, R., B. Prabhakar, and K. Psounis. 2000. CHOKEs: A stateless active queue management scheme for approximating fair bandwidth allocation. In Proceedings of the IEEE INFOCOM, pp. 942-51.
15. Stoica, I., H. Zhang, and S. Shenker. 2002. Self-verifying CSFQ. In Proceedings of IEEE INFOCOM, pp. 21-30.
16. Zheng, J., M. Hu, and L. Zhao. 2005. Enhancing Internet robustness against malicious flows using active queue management. In Proceedings of ICESS, pp. 501-6.
17. Chu, Y.S., J.P. Yang, C.S. Wu, and M.C. Liang. 2002. Partial sharing and partial partitioning buffer management scheme for shared buffer packet switches. IEICE Transactions on Communications E85-B (1): 79-88.
18. Yang, J.P. 2004. Performance analysis of threshold-based selective drop mechanism for high performance packet switches. Performance Evaluation 89-103.
19. Paxson, V., and S. Floyd. 1994. Wide-area traffic: The failure of Poisson modeling. In Proceedings of ACM SIGCOMM, pp. 257-68.
20. Dill, S., Kumar, R., McCurley, K., Rajagopalan, S., Sivakumar, D., and Tomkins, A. 2002. Self-similarity in the web, ACM Trans. Internet Technology, 2 (3): 205-223.