다중 DiffServ 도메인 상에서 QoS 보장을 위한 동적 클래스 재협상 알고리즘

Dynamic Class Mapping Mechanism for Guaranteed Service with Minimum Cost over Differentiated Services Networks

  • 이대붕 (홍익대학교 전파통신공학과 멀티미디어 통신 시스템 연구실) ;
  • 송황준 (홍익대학교 전파통신공학과 멀티미디어 통신 시스템 연구실)
  • 발행 : 2004.07.01

초록

네트웍 환경에서 quality of service(QoS) 에 대한 요구가 증대함에 따라 여러 가지 방안들이 제시되고 있는 가운데, Differentiated services (DiffServ) 모델은 확장성을 보장하며 QoS를 제공할 수 있는 방법으로서 제시되고 있다. 그러나 대부분의 DiffServ 관련 연구들은 통합된 트래픽에 관한 확장성 문제와, 단일 도메인에서의 per hop behavior(PHB)에 관한 문제에만 관심을 두고 있기 때문에, 시간적으로 변화하는 네트웍 조건하에서 다중 도메인의 단대단 QoS를 제공하는 데 있어서는 많은 어려움 들이 있다. 따라서 본 연구에서는 다중 DiffServ 도메인에서 네트웍 cost를 최소화하는 가운데 멀티미디어 데이터의 단대단 QoS를 제공할 수 있는 동적 클래스 재협상알고리즘을 제안하였다. 본 논문은 DiffServ의 relative 서비스 모델을 효과적으로 구현할 수 있는 방법과 QoS 레벨 전달 메카니즘, 그리고 동적 클래스 재협상 방법으로 구성되어 있으며, 실험 결과를 통해 제안된 알고리즘의 성능을 측정한다.

Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

키워드

참고문헌

  1. RFC2475 An architecture for differentiated services S. Blake;D. Blake;M. Carlson;E. Davies;Z. Wang;W. Weiss
  2. RFC3086 Definition of Differentiated Services Per Domain Behaviors and Rules for their Specification K. Nichols;B. Carpenter
  3. RFC2638 A two-bit differentiated service architecture for the Internet K. Nichos;V. Jacobson;L. Zhang
  4. Proc. ACM SIGCOMM Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services Z. Zhang;Z. Duan;L. Gao;Y. T. Hou
  5. Proc. IEEE ICC Network Services Definition and deployment in a differentiated services architecture E. Nikolouzou(et al.)
  6. Proc. IEEE INFOCOM A quantitative assured forwarding service N. Christin;J. Liebeherr;T. F. Abdelzaher
  7. Proc. IEEE INFOCOM Individual QoS versus Aggregate QoS: A Loss Performance Study Y. Xu;R. Guerin
  8. Proc. ICNP 2001 Dynamic class selection:from relative differentiation to absolute QoS C. Dovrolis;P. Ramanathan
  9. RFC2597 Assured Forwarding PHB Group J. Heinanen;F. Baker;W. Weiss;J. Wroclawski
  10. IEEE Network v.13 no.5 A case for Relative Differentiated Services and the Proportional differentiation Model Constantinos Dovrolis;Parameswaran Ramanathan https://doi.org/10.1109/65.793688
  11. RFC2859 A Time Sliding Window Three Color Marker Fang, W.;N. Seddigh;B. Nandy
  12. RFC2697 A Single Rate Three Color Marker Heinanen, J.;T. Finland;R. Guerin
  13. RFC2698 A Two Rate Three Color Marker Heinanen, J.;T. Finland;R. Guerin
  14. Principle of Digital Communication and Coding A. J. Viterbi;J. K. Omura
  15. IEEE Trans. On Image Processing v.3 no.1 Optimal trellis-based buffered compression and fast approximations A. Ortega;K. Ramchandran;M. Vetterli
  16. Nonlinear Programming D. P. Bertsekas
  17. Probability, Random ariables, and Stochastic Process A. Papoulis
  18. IEEE Trans. Signal Processing v.36 Efficient bit allocation for an arbitrary set of quantizers Y. Shoham;A. Gersho https://doi.org/10.1109/29.90373
  19. Linear and Nonlinear Programming D. G. Lueberger
  20. Network Simulator ns (ver. 2) UCB/LBNL/VINT
  21. Berkeley Multimedia Research Center
  22. KAIST
  23. NS by Example WPI Computer Science