On the optimization of the inter - flow fairness in the Internet

• Autorzy: Adamczyk B. , Chydziński A.

Warianty tytułu

PL

O poprawie sprawiedliwości podziału pasma pomiędzy przepływy w Internecie

• Języki publikacji: EN

Abstrakty

EN

All known active queue management algorithms invented to provide fair bandwidth allocation between TCP flows are designed to cooperate with the classic TCP congestion control (New Reno). However, some new congestion control schemes are becoming more and more popular nowadays (e.g. the Cubic algorithm). Therefore, the following question arises: will these fair queue management algorithms work well in the presence of a new congestion control scheme? To answer this questions, we present a comprehensive study of the performance of seven fair queue management algorithms in the presence of seven TCP variants. In particular, the fairness index, queue size and throughput were measured in scenarios with diversified RTTs, traffic patterns and congestion levels. Not only do the results allow us to answer the aforementioned question, but also to formulate recommendation on how to provide the best cross-layer fairness optimization in the Internet.

PL

Wszystkie znane z literatury algorytmy aktywnego zarządzania kolejkami (AQM) ukierunkowane na zapewnienie sprawiedliwego podziału pasma pomiędzy przepływy w Internecie były opracowywane z myślą o współpracy z (klasycznym dziś) algorytmem kontroli zatłoczenia TCP, tzn. New Reno. W ostatnich latach można zauważyć w Internecie istotne zwiększanie się udziału nowych algorytmów kontroli zatłoczenia TCP (jak np. algorytmu Cubic). Dlatego te˙z pojawia się naturalne pytanie: czy algorytmy sprawiedliwego podziału pasma zaprojektowane dla New Reno bedą równie dobrze działać w obecnosci tych nowych wariantów TCP? Aby uzyskać odpowiedź na to pytanie, przeprowadzone zostały szeroko zakrojone studia symulacyjne. Studia te uwzględniały siedem najważniejszych algorytmów AQM do sprawiedliwego podziału pasma, siedem wersji TCP (w tym najnowocześniejsze warianty), różne scenariusze zatłoczenia sieci oraz czasy RTT połączeń TCP. Uzyskane wyniki pozwoliły nie tylko udzielić odpowiedzi na sformułowane powyżej pytanie, ale także wskazać, które wersje TCP i AQM najlepiej realizują ideę optymalizacji międzywarstwowej w celu zapewnienia sprawiedliwego podziału pasma pomiędzy przepływy w Internecie.

Słowa kluczowe

EN

fairness; active queue management; congestion control

• Wydawca: Instytut Informatyki Teoretycznej i Stosowanej Polskiej Akademii Nauk
• Czasopismo: Theoretical and Applied Informatics
• Rocznik: 2012
• Tom: Vol. 24, No. 3
• Strony: 205--225
• Opis fizyczny: Bibliogr. 34 poz., rys.

Twórcy

autor

Adamczyk B.

autor

Chydziński A.

• Institute of Informatics, Silesian University of Technology Akademicka 16, 44-100 Gliwice, Poland,

Bibliografia

• 1. C. Caini, R. Firrincieli: TCP Hybla: a TCP Enhancement for Heterogeneous Networks.International Journal of Satellite Communications and Networking, Volume: 22, Number: 5, pp. 547-566, 2004.
• 2. I. Rhee, L. Xu: CUBIC: A New TCP-Friendly High-Speed TCP Variant, SIGOPS Operating Systems Review vol. 42 (5), pp. 64-74, July 2008.
• 3. G. Chatranon, M.A. Labrador, S. Banerjee: A survey of TCP-friendly router-based AQM schemes, Computer Communications 27, pp. 1424–1440, 2004.
• 4. R. Pan, B. Prabhakar, K. Psounis: CHOKe — A Stateless Active Queue Management Scheme For Approximating Fair Bandwidth Allocation, Proceedings of IEEE INFOCOM 2000, vol. 2, pp. 942-951.
• 5. Z. Rosberg, J. Matthews, M. Zukerman: A network rate management protocol with TCP congestion control and fairness for all, Computer Networks, vol. 54, issue 9, pp. 1358-1374, 2010.
• 6. Z. Rosberg: Control Plane for End-to-End QoS Guarantee: A Theory and Its Application,Proc. IWQoS’08, pp. 269–278, 2008.
• 7. Z. Rosberg, C. Russell, V. Sivaraman: Rate and End-to-End Delay Control for Multicast and Unicast Flows, IEEE International Conference on Communications, pp. 1-6, 2009.
• 8. Z. Rosberg, F. Sabrina, S. Dealy, J. Matthews, C. Russell: Rate and delay controlled core networks: an experimental demonstration, in: Proceedings of IWQoS’09, Charelston, S. Caraolina, 2009.
• 9. A. Chydzinski, A. Brachman: Performance of AQM Routers in the Presence of New TCP Variants, Proc. of International Conference on Advances in Future Internet, pp. 88–93, Venice, July 2010.
• 10. Mohammad Abu Obaida, Md. Sanaullah Miah, Md. Abu Horaira: Random Early Discard (RED-AQM) Performance Analysis in Terms of TCP Variants and Network Parameters: Instability in High-Bandwidth-Delay Network, International Journal of Computer Applications, Vol. 27, No.8, pp.40-44, August 2011.
• 11. T. Bonald, M. May, J.C. Bolot: Analytic evaluation of RED performance, Proc. 19’th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1415–1424, 2002.
• 12. W. Hao, Y. Wei: An extended GIX/M/1/N queueing model for evaluating the performance of AQM algorithms with aggregate traffic, vol. 3619 of Lecture Notes in Computer Science, pp. 395–404, 2005.
• 13. A. Chydzinski, L. Chrost: Analysis of AQM queues with queue-size based packet dropping, International Journal of Applied Mathematics and Computer Science, Vol. 21, No. 3, pp. 567–577, 2011.
• 14. D. Lin, R. Morris: Dynamics of Random Early Detection, Proceedings of SIGCOMM, pp. 127-137, 1997.
• 15. B. Suter, T. Lakshman, D. Stiliadis, A. Choudhury: Design Considerations for Supporting TCP with Per-Flow Queuing, Proceedings of IEEE INFOCOM, pp. 299-306, 1998.
• 16. F. Anjum, L. Tassiulas: Fair Bandwidth Sharing Among Adaptive and Non-Adaptive Flows in the Internet, Proceedings of IEEE INFOCOM, pp. 1412-1420, 1999.
• 17. T. Ott, T. Lakshman, L. Wong(Eds.): SRED Stabilized RED, IEEE INFOCOM ’99 vol. 3, pp. 1346-1355, 1999.
• 18. M. Chan, M. Hamdi: An Active Queue Management Scheme Based on a Capture–Recaptured Model, IEEE Journal on Selected Areas in Communication 21 (4), pp. 572-583, 2003.
• 19. G. Chatranon, M.A. Labrador, S. Banerjee: BLACK: Detection and Preferential Dropping of High Bandwidth Unresponsive Flows, Proceedings of IEEE ICC vol. 1, pp. 664-668, 2003.
• 20. S. Floyd, V. Jacobson: Random Early Detection Gateways for Congestion Avoidance, IEEE/ACM Transactions on Networking vol. 1 (4), pp. 397-413, 1993.
• 21. W. Feng, D. Kandlur, D. Saha, K. Shin: Stochastic Fair Blue A Queue Management Algorithm for Enforcing Fairness, Proceedings of IEEE INFOCOM 2001, vol. 3, pp. 1520-1529.
• 22. G.C. White, D.R. Anderson, K.P. Burnham, D.L. Otis: Capture–Recapture and Removal Methods for Sampling Closed Populations, Los Alamos National Laboratory LA-8787-NERP, pp. 235, 1982.
• 23. C.A. Kentand, J.C. Mogul: Fragmentation considered harmful, Proceedings of the ACM workshop on Frontiers in computer communications technology (SIGCOMM), Stowe, Vermont, pp. 390-401, August 1987.
• 24. V. Jacobson: Congestion avoidance and control, ACM SIGCOMM vol.25 (1), pp. 157-187, 1995.
• 25. S. Floyd, T. Henderson: The New-Reno Modification to TCP’s Fast Recovery Algorithm, RFC 2582, Apr 1999.
• 26. M. Mathis, J. Mahdavi, S. Floyd, A. Romanov: TCP selective acknowledgment options, RFC 2018, 1996.
• 27. A. Afanasyev, N. Tilley, P. Reiher, L. Kleinrock: Host-to-Host Congestion Control for TCP, IEEE Communications surveys & tutorials vol.12 (3), pp. 304-342, 2010.
• 28. L.S. Brakmo, S.W. O’Malley, L.L. Peterson: TCP Vegas: New techniques for congestion detection and avoidance, ACM SIGCOMM Computer Communication Review, vol. 24, pp. 24-35, 1994.
• 29. C. Casetti, M. Geria, S.S. Lee, S. Mascolo, M. Sanadidi: TCP with faster recovery, MILCOM 2000. 21st Century Military Communications Conference Proceedings, pp. 320-324, 2000.
• 30. M. Mathis, J. Mahdavi: Forward acknowledgment: refining TCP congestion control, Proc. conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), NewYork, USA, pp. 281-191, 1996.
• 31. D. Leith and R. Shorten: H-TCP: TCP for high-speed and long-distance networks, Proc. of the 2nd Workshop on Protocols for Fast Long Distance Networks, 2004.
• 32. S. Ha, I. Rhee, L. Xu: CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review, vol. 42, issue 5, pp. 64-74, 2008.
• 33. L. Xu, K. Harfoush, I. Rhee: Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks, Proceedings of IEEE INFOCOM, vol. 4, pp. 2514-2524, 2004.
• 34. L. Andrew, C. Marcondes, S. Floyd, L. Dunn, R. Guillier, W. Gang, L. Eggert, S. Ha, I. Rhee: Towards a Common TCP Evaluation Suite, Proc. International Workshop on Protocols for Fast Long-Distance Networks (PFLDnet), Manchester, 2008.