Journal of the Institute of Electronics Engineers of Korea TC (대한전자공학회논문지TC)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Adaptive and Strict Packet Dropping Mechanism for the Congestion Control of AF Packets in Differentiated Service

차별화 서비스에서 AF 패킷의 혼잡제어를 위한 적응적 엄격 패킷 폐기 메커니즘

  • Kim, Su-Yeon (Department of Electronics & Information Engineering, Korea University) ;
  • Kahng, Hyun-Kook (Department of Electronics & Information Engineering, Korea University)
  • 김수연 (고려대학교 전자정보공학과) ;
  • 강현국 (고려대학교 전자정보공학과)
  • Published : 2001.11.25
Download PDF
⟨ Previous Next ⟩

Abstract

Adaptive and Strict Packet Dropping mechanism we proposed in this paper drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes the wastes of the bandwidth being capable of predicting in Dynamic and Strict Packet Dropping (DSPD) mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic and compared RIO and the DSPD. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class than RIO and the DSPD mechanism.

본 논문에서 제안한 적응적 엄격 패킷 폐기 메커니즘은 사이클 사이의 트래픽 변화를 예측하여 혼잡제어를 위한 패킷 폐기를 적응적으로 처리할 수 있다. 따라서 제안된 메커니즘은 RIO 메커니즘의 단순 폐기율적용에 대한 단점을 보완하고, 동적 엄격 패킷 폐기 메커니즘(DSPD)의 예측 가능한 대역폭의 낭비를 최소화하였다. 시뮬레이션을 수행하여 망 트래픽의 상태에 따라 동적으로 변하는 전송가능 폐기순위에 따른 처리율과 패킷 폐기율을 RIO, DSPD 메커니즘과 비교 분석하였다. 시뮬레이션을 분석한 결과 제안된 메커니즘은 트래픽의 양에 상관없이 각 AF 클래스의 폐기순위를 엄격하게 적용하고 폐기순위에 따른 패킷 전송 능력을 RIO, DSPD에 비하여 개선하였음을 증명하였다.

Keywords

References

  1. S. Blake, et al., 'An Architecture for Differentiated Services,' Internet RFC 2475, December 1998
  2. 한국전자통신연구원, 'ATM 상의 인터넷 서비스 기술 개발', ISBN 89-86328-44-5, 1999년 1월 10일
  3. K. Nichols, et al., 'Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers,' Internet RFC 2474, December 1998
  4. A. Demers, S.Keshav, and S. Shenker, 'Analysis and simulation of fair queueing algorithm', In Journal of Internetworking Research and Proceedings of ACM SIGCOMM '89, PP. 3-12 https://doi.org/10.1145/75246.75248
  5. D. D. Clark and W. Fang, 'Explicit Allocation of Best-Effort Packet Delivery Service,' IEEE/ACM Trans. on Networking, Vol. 6, No. 4, PP. 362-373, August 1998 https://doi.org/10.1109/90.720870
  6. 김수연, 이호균, 김철범, 'Assured Forwarding 클래스를 위한 동적 엄격 패킷 폐기 메커니즘,' 한국정보처리학회 논문지 제 6권 제 11S호 별쇄, PP 3251-3260, November, 1999
  7. B. Widrow, S. D. Steams, 'Adaptive Signal Processing', Prentice-Hall, ISBN 0 13 004029 0, 1985
  8. J. Heinanen, et al., 'Assured Forwarding PHB Group,' Internet RFC 2597, June 1999
  9. V. Jacobson, et al., 'Expedited Forwarding Per Hop Behavior,' Internet RFC 2598, June 1999
  10. Dimitrios stiliadis, Anujan Varma, 'Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms,' IEEE/ACM Transactions on networking Vol. 6, NO. 2, April 1998 https://doi.org/10.1109/90.664265
  11. S. Floyd, V. Jacobson, 'Link-Sharing and Resource Management Models for Packet Networks,' IEEE/ACM Trans. On Networking, Vol. 3, No. 4, PP 365-386, August 1995 https://doi.org/10.1109/90.413212