DOI QR코드

DOI QR Code

Congestion Control Scheme for Wide Area and High-Speed Networks

초고속-장거리 네트워크에서 혼잡 제어 방안

  • 양은호 (서울대학교 컴퓨터공학부) ;
  • 함성일 (서울대학교 컴퓨터공학부) ;
  • 조성호 (서울대학교 컴퓨터공학부) ;
  • 김종권 (서울대학교 컴퓨터공학부)
  • Published : 2005.08.01

Abstract

In fast long-distance networks, TCP's congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

초고속-장거리 네트워크(fast long-distance network)에서 TCP의 혼잡 제어(congestion control) 알고리즘은 대역폭을 효과적 사용하지 못하는 문제점을 가지고 있다. 이 문제를 해결하기 위하여 TCP 혼잡 제어 알고리즘을 수정한 여러 윈도우 기반 혼잡 제어 프로토콜(window-based protocol)이 제안되었다 이러한 프로토콜들은 주로 확장성(scalability), TCP-친밀성(TCP-friendliness), 그리고 RTT-공평성(RTT-fairness) 등의 세 가지의 요구사항을 고려하고 있다. 하지만 기존에 제안된 프로토콜은 위 세 가지 특성의 균형관계(trade-off)로 인하여 이들 세 특성을 동시에 만족시키지 못한다. 본 논문에서는 EIMD (Exponential Increase/ Multiplicative Decrease)라고 하는 윈도우 기반 TCP 혼잡 제어 알고리즘을 제안한다. EIMD는 위의 세 가지 특성을 동시에 제공함은 물론이고, 초고속-장거리 네트워크에서 중요하게 고려해야 할 빠른 공정배분 수렴성(fair share convergence)도 제공한다. EM는 패킷 손실(packet loss)이 없는 한, 지수적으로 윈도우를 증가시켜 큰 대역폭을 효과적으로 사용하면서도, 혼잡제어 알고리즘의 반응 함수(response function)에 RTT를 반영하여 RTT-공평성와 TCP-친밀성을 제공한다. 또한 패킷 손실이 생기기 직전의 혼잡 윈도우 크기에 반비례하게 윈도우를 증가시킴으로써 공정배분(fair share) 값에 빠르게 수렴할 수 있다. 모의실험을 통해 제안된 프로토콜이 초고속-장거리 네트워크에서 위 4가지 특성들을 모두 만족하는지 검증하였다.

Keywords

References

  1. S. Floyd, S. Ratnasamy, and S. Shenker, 'Modifying TCP's Congestion Control for High Speeds', http://www.icir.org/floyd/hstcp.html. May, 2002
  2. S. Floyd, 'HighSpeed TCP for Large Congestion Windows', RFC 3649, December, 2003
  3. J. Nagle, 'Congestion Control in IP/TCP,' IETF RFC 896, Jan., 1984
  4. T. Kelly, 'Scalable TCP: Improving performance in highspeed wide area networks', ACM SIGCOMM Computer Communication Review, Vol.33, Issue 2, pp.83-91, April, 2003
  5. L. Xu, K. Harfoush, I. Rhee, 'Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks', IEEE INFOCOM '04, March, 2004
  6. C. Jin, D. Wei, and S. H. Low, 'FAST TCP: Motivation, Architecture, Algorithms, Performance', IEEE INFOCOM '04, March, 2004 https://doi.org/10.1109/INFCOM.2004.1354670
  7. D. Katabi, M. Handley, and C. Rohrs, 'Congestion Control for High Bandwidth-Delay Product Networks', ACM SIGCOMM '02, August, 2002 https://doi.org/10.1145/633025.633035
  8. Y. Gu, X. Hong, M. Mazzucco, and R. L. Grossman, 'SABUL: A High Performance Data Transfer Protocol', Submitted for publication, 2002
  9. D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker, 'Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms', SIGCOMM '01, August, 2001 https://doi.org/10.1145/964723.383080
  10. S. Jin, L. Guo, I. Matta, A. Bestavros, 'TCP-friendly SIMD Congestion Control and Its Convergence Behavior', ICNP'2001: The 9th IEEE International Conference on Newtork Protocols, Riverside, CA, November, 2001
  11. S. Jin, L. Guo, I. Matta, and A. Bestavros, 'A Spectrum of TCP-friendly Window-based Congestion Control Algorithms', IEEE/ACM Transactions on Networking, Vol.11, No 3, pp.341-355, Jun., 2003 https://doi.org/10.1109/TNET.2003.813046
  12. S. Floyd, E. Kohler, 'Internet research needs for better models', http://www.icir.org/models /bettermodels.html, October, 2002
  13. HighSpeed TCP Simulation Reports, http://www-itg.lbl.gov/~evandro/hstcp/simul/simul.html
  14. Simulation Code and Scripts for BI-TCP Paper, http:// www.csc.ncsu.edu/faculty/rhee/export/bitcp/scripts/scripts.htm
  15. D.-M. Chiu, R. Jain, 'Analysis of the increase and decrease algorithms for congestion avoidance in computer networks', Computer Networks and ISDN systems, 17:1-14, 1989 https://doi.org/10.1016/0169-7552(89)90019-6
  16. S. Bhandarkar, S. Jain, A. L. N. Reddy, ' LTCP : A Layering Technique for Improving the Performance of TCP in Highspeed Networks', draft-bhandarkar-ltcp-01.txt, August, 2004
  17. H. Sivakumar, S. Bailey, and R. L. Grossman, 'PSockets : The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks', High-Performance Network and Computing Conference, November, 2000 https://doi.org/10.1109/SC.2000.10040
  18. B. Allcock, J. Bester, J. Bresnahan, A. L. Chervenak, I. Foster, C. Kesselman, S. Meder, V. Nefedova, D. Quesnal, and S. Tuecke, 'Data Management and Transfer in High-Performance Computational Grid Environments', High-Performance Network and Computing Conference, November, 2002
  19. T. Hacker, B. Noble, and B. Athey, 'Improving Throughput and Maintaining Fairness using Parallel TCP', IEEE INFOCOM '04, March, 2004
  20. T. Hacker, B. Athey, and B. Noble, 'The End-to-End Performance Effects of Parallel TCP Sockets on a Lossy Wide-Area Network', International Parallel and Distributed Processing Symposium, April, 2002 https://doi.org/10.1109/IPDPS.2002.1015527
  21. T. V. Lakshman, U. Madhow, 'The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss', IEEE/ACM Transactions on Networking, Vol.5, No 3, pp.336-350, July, 1997 https://doi.org/10.1109/90.611099
  22. Y. Gu, X. Hong, M. Mazzucco, and R. L. Grossman, 'SABUL: A High Performance Data Transfer Protocol', Submitted for publication, 2002