The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

The Optimal Threshold for ECN Marking

ECN 마킹을 위한 최적의 Threshold

  • 이계영 (동국대학교 공학대학 컴퓨터멀티미디어학과) ;
  • 임재걸 (동국대학교 공학대학 컴퓨터멀티미디어학과) ;
  • 장익현 (동국대학교 공학대학 정보통신공학과)
  • Published : 2005.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

ECN is accurate in determining traffic congestion since it explicitly notifies the incipient congestion. Therefore, ECN method has been thoroughly studied in the field of wireless TCP. This paper introduces a formula to find the optimal threshold for ECN marking. We have implemented a Petri net model of 'TCP with ECN strategy' and performed simulations on it in order to verify the validity of the formula. We have also introduced ideas of applying the formula in practice. The primary contribution of this paper is proposing a formula to find the optimal threshold for ECN marking. However, introducing the Petri net model of 'TCP with ECN strategy' is no less valuable contribution because it can be helpfully used by the researchers in studying network protocols. We have built the Petri net model by modifying the existing Petri net model of TCP. In order to add ECN strategy to the existing model, we have mainly modified the network part. We have also modified sender part and receiver part as well.

ECN 방법은 통신 혼잡 발생 초기에 이 사실을 명백히 알려주기 때문에 통신 혼잡을 판단하는 정확한 방법이다. 그래서, 무선 TCP 분야에서는 ECN 방법이 심도 있게 연구되고 있다. 본 논문은 ECN 마킹을 위한 최적의 임계치(threshold)를 찾는 계산식을 제시하고, ECN 전략을 적용하는 TCP의 페트리 넷 모형을 구축한 다음, 시뮬레이션을 통하여 제시된 식의 타당성을 검증한다. 또한, 제시된 식의 실용화 방안도 제안한다. 본 논문의 주된 공헌은 ECN 마킹을 위한 최적의 임계치를 찾는 공식을 제공하는 것이지만, 본 논문에 소개된 ECN 전략을 적용한 TCP의 페트리 넷 모형도 네트워크 프로토콜을 연구하는 학자에게 도움을 주리라고 믿는다. 소개된 페트리 넷 모형은 기존의 TCP 모형에 ECN 전략을 추가하기 위하여 네트워크 부분을 주로 변형하였으며, 송신자와 수신자도 역시 변형되었다.

Keywords

References

  1. J. Postel, 'Transmission control protocol,' RFC 793, IETF, Sept., 1981
  2. D. Barman and I. Matta, 'How well can TCP infer network state?,' Computer Science Dept. Boston University, BUCS-TR-2003-011, May, 16, 2003
  3. K. Ramakrishnan and S. Floyd, 'A proposal to add explicit congestion notification (ECN) to IP,' RFC 2481, Jan., 1999
  4. The Network Simulator-ns-2. http://www.isi.edu/nsnam/ns
  5. R. Braden and J. Postel, 'Requirements for internet gateways,' RFC 1009, IETF, June, 1987
  6. T.Y. Lin and Y.C. Chen, 'A congestion control approach for LAN/MAN interconnection via ATM,' Proc. IEEE 13th Networking for Global Communications, Vol.2, 1994, Toronto, Ont., Canada, pp.892-901
  7. A. Dracinschi and S. Fdida, 'Congestion avoidance for unicast and multicast traffic,' 1st European Conference on Universal Multiservice Networks, 2000, Colmar, France, pp.360-368 https://doi.org/10.1109/ECUMN.2000.880785
  8. Z. Chen, S. Jiang, S. Zheng, and C. Ko, 'Performance comparison between ECN and BECN,' ICATM 2001, 2001, Seoul, South Korea, pp.305-309 https://doi.org/10.1109/ICATM.2001.932108
  9. F. Peng and V. Leung, 'Fast backward congestion notification mechanism for TCP congestion control,' 21st IEEE International Performance, Computing, and Communications Conference, 3-5 April, 2002, pp.419-424 https://doi.org/10.1109/IPCCC.2002.995179
  10. K. Ramakrishnan and R. Jain, 'A binary feedback scheme for congestion avoidance in computer networks' ACM Trans. On Computer Systems, Vol.8 No.2, 1990, pp.158-181 https://doi.org/10.1145/78952.78955
  11. R. Jain, 'Congestion control in computer networks: issues and trends,' IEEE Network, Vol.4, Issue: 3, pp.24-30, May, 1990 https://doi.org/10.1109/65.56532
  12. S. Floyd and V. Jacobson, 'Random early detection gateways for congestion avoidance,' IEEE/ACM Trans. on Networking, Vol.1, Issue: 4, pp.397-413, Aug., 1993 https://doi.org/10.1109/90.251892
  13. Y. Zhou, T. Murata, and T. DeFanti, 'Modeling and performance analysis using extended fuzzy-timing petri nets for networked virtual environments,' IEEE Trans. on Systems, Man, and Cybernetics-Part B: Cybernetics, Vol.30, No.5, pp.737-756, October, 2000 https://doi.org/10.1109/3477.875449
  14. R. Gaeta, M. Gribaudo, D. Manini, and M. Sereno, 'On the use of petri nets for the computation of completion time distribution for short TCP transfers,' ICATPN 2003, Lecture Notes in Computer Science, Vol.2679, Springer, New York, pp.181-200, 2003
  15. A. Ost and B. Haverkort, 'Analysis of windowing mechanisms with infinite-state stochastic petri nets,' ACM Performance Evaluation Review, Vol.26, No.8, pp.38-46, 1998 https://doi.org/10.1145/288197.288212
  16. T. Murata, T. Suzuki, and S. Shatz, 'Fuzzy-timing high-level petri nets (FTHNs) for time-critical systems,' in J. Cardoso and H. Camargo(editors) Fuzziness in Petri Nets Vol.22 in the series Studies in Fuzziness and Soft Computing , Springer Verlag, New York, pp.88-114, 1999
  17. K. Jensen, Design/CPN [Online]. Dept. Computer Science, Univ. Aarhus, Denmark. Available: http://www.daimi.au.dk/designCPN/
  18. Design/CPN [Online] Jensen, K.
  19. M. Kwon and S. Fahmy, 'On TCP reaction to explicit congestion notification,' Journal of High Speed Networks, Vol.13, pp.123-138, 2004
  20. S. Floyd, M. Handley, J. Padhye, and J. Widner, 'Equation-based congestion control for unicast applications.' Proc. ACM SIGCOMM, 2000, pp.43-56 https://doi.org/10.1145/347057.347397
  21. Y. Yang and S. Lam, 'General AIMD congestion control,' Proc. IEEE ICNP 2000, Osaka, Japan, http://www.cs.utexas.edu/users/lam/Vita/IEEE/YangLam00.pdf
  22. S. Floyd, 'TCP and explicit congestion notification,' ACM Computer Communication Review, Vol.24, No.5, pp.10-23, Oct., 1994
  23. C. Liu and R. Jain, 'Improving explicit congestion notification with the mark-front strategy,' Computer Networks, Vol.35, No.2-3, pp.185-201, 2001 https://doi.org/10.1016/S1389-1286(00)00167-5