한국정보과학회논문지:정보통신 (Journal of KIISE:Information Networking)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

차등 서비스 네트워크의 확신 서비스에서 공평성 향상을 위한 3색 마킹 메커니즘

A Three-Color Marking Mechanism for Fairness Improvement in the Assured Service of the Diffserv Network

  • 모상덕 (광운대학교 전자통신공학과) ;
  • 정광수 (광운대학교 전자공학부)
  • 발행 : 2003.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

차등 서비스 네트워크(Diffserv network)의 확신 서비스(Assured Service)에 대한 기존 연구는 TCP 플로우의 RTT(Round Trip Time) 및 계약한 목표 전송률(CTR: Committed Target Rate)에 따른 전송률 분배의 공평성에 대한 고려가 부족하다. 본 논문에서는 기존 연구에서의 문제점들을 개선한 TRA3CM(Target rate and RTT Aware 3 Color Marker) 메커니즘을 제안한다. TRA3CM에서는 평균 전송률을 예측하기 위한 시간 창 길이로 RTT를 이용하며, 3색 마킹을 제공하고, RTT와 목표 전송률을 동시 고려하여 집합 플로우들 사이에 공평하게 전송률을 분배할 수 있다. 또한 under-provisioned 네트워크에서도 RTT의 영향을 완화시켜 집합 플로우들 사이에 공평성을 보장하고 있다. 기존 방식들과 비교한 결과 제안한 TRA3CM은 RTT의 영향을 완화시키는 데 있어 좋은 성능을 보이며, 목표 전송률에 비례하는 전송률 제공에서도 우수한 성능을 확인할 수 있었다.

Previous works for the assured service in the Diffserv network have no sufficient consideration on the fairness of bandwidth share based on RTTs and the target rates of TCP flows. In this paper, in order to solve these problems, we propose a TRA3CM(Target rate and RTT Aware 3 Color Marking) mechanism. The TRA3CM mechanism provides three color marking and fair transmission rates among aggregate flows by considering RTT and target rate simultaneously. In case of higher target rate than bottleneck bandwidth, the TRA3CM mechanism is able to mitigate the RTT effect and provides fair transmission rates. In the results of comparing the performance among existing mechanisms and the TRA3CM, the TRA3CM mechanism was able to mitigate the RTT effect better than the former. The TRA3CM is shown to provide good performance for transmission rates proportional to various target rates.

키워드

참고문헌

  1. S. Blake, D. Blake, M. Carlson, E. Davies, Z. Wang, W. Weiss, 'An Architecture for Differentiated Services,' IETF RFC 2475, Dec. 1998
  2. V. Jacobson, K. Nichols, and K. Poduri, 'An Expedited Forwarding PHB,' IETF RFC 2598, June 1999
  3. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, 'Assured Forwarding PHB Group,' IETF RFC 2597, June 1999
  4. S. Floyd and V. Jacobson, 'Random Early Detection gateways for Congestion Avoidance,' IEEE/ACM Transactions on Networking, Vol. 1, No. 4, pp. 397-413, Aug. 1993 https://doi.org/10.1109/90.251892
  5. D. Clark and W. Fang, 'Explicit Allocation of Best Effort Packet Delivery Service,' IEEE/ACM Transactions on Networking, Vol. 6, No. 4, pp. 362-373, Aug. 1998 https://doi.org/10.1109/90.720870
  6. J. Heinanen, and R. Guerin, 'A Single Rate Three Color Marker,' IETF RFC 2697, Sep. 1999
  7. J. Heinanen, and R. Guerin, 'A Two Rate Three Color Marker,' IETF RFC 2698, June 2000
  8. W. Fang, N. Seddigh, and B. Nandy, 'A Time Sliding Window Three Colour Marker(TSWTCM),' IETF RFC 2859, June 2000
  9. B. Nandy, N. Seddigh, P. Pieda, and J. Ethridge, 'Intelligent Traffic Conditioners for Assured For warding based Differentiated Services networks,' IFIP High Performance Networking, June 2000
  10. I.B.H. Alves, J.F. Rezende, and L.F.M. Moraes, 'Evaluating Fairness in the Aggregated Traffic Marking,' Proceeding of IEEE Global Telecommunications Conference. Nov. 2000 https://doi.org/10.1109/GLOCOM.2000.892044
  11. I. Andrikopoulos, L. Wood, and G. Pavlou, 'A Fair Traffic Conditioner for the Assured Service in a Differentiated Services Internet,' Proceeding of IEEE International Conference on Communications, June 2000 https://doi.org/10.1109/ICC.2000.853610
  12. M. Mathis, J. Semke, J. Mahdavi, T. Ott, 'The macroscopic behavior of the TCP congestion avoidance algorithm,' ACM SIGCOMM Computer Communication Review, Vol. 27, No. 3, pp. 67-82, 1997 https://doi.org/10.1145/263932.264023
  13. R. Jain, 'The art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling,' pp.387, John Wiley and Sons Inc., New York, 1991