차별화된 서비스제공을 위한 트래픽 모델

A Traffic Model based on the Differentiated Service Routing Protocol

  • 발행 : 2003.10.01

초록

NGN(Next Generation Network)을 목표로 최근에 들어 사용자의 QoS요구 시, 다양한 QoS를 패킷네트워크에서 처리한 수 있도록 IETF에서 DiffServ, RSVP, MPLS등과 같은 패킷 QoS기법에 대한 표준화 작업이 진행중이며, 그 중에서 DiffServ네트워크가 대표적이다. 따라서 본 논문에서는 이 DiffServ패킷 네트워크상에서 다양하게 유입되는 트래픽의 종류에 따라 사용자의 응용에 적절히 대응하여 트래픽을 처리하는 라우팅 기법트래픽 모델 및 알고리즘을 연구하고 기존의 최선형(Best effort) 즉, 지연에 민감하지 않은 트래픽을 처리하기 위한트래픽 분산 라우팅 프로토콜(Traffic-Balanced Routing Protocol : TBRP), 최적의 중간 노드를 선택하여 유무선 통합과 높은 순위의 상호형 데이터를 처리하기 위한 계층적 라우팅 프로토콜(Hierarchical Traffic-Traffic-Scheduling Routing Protocol : HTSRP), 대화형 또는 스트리밍 패킷서비스를 위한 즉, QoS파라미터을 기반으로 엑세스 계층의 자원 활용도를 최대화하고 지연에 민감한 트래픽 처리하는 HTSRP_Q(HTSRP for QoS)를 연구하였고, 이를 기반으로 각 트래픽 모델에 대한 매핑기법과 관리기법을 연구하였다. 본 연구에서 제시한 프로토콜은 트래픽 모델은 다양한 엑세스망과 백본망에 유연한 트래픽 처리기법으로서 NGN의 효율성과 안정성에 적합하였다.

The current IP Routing Protocolspacket networks also need to provide the network QoS based of DiffServ, RSVP, MPLStraffic model which is standardized as IETF reference model for NGN. The first topic of this paper is to propose Traffic-Balanced Routing Protocol(TBRP) to process existing best effort traffic. TBRP will process low priority interactive data and background data which is not sensitive to dealy. Secondly Hierarchical Traffic-Traffic-Scheduling Routing Protocol(HTSRP) is also proposed. HTSRP is the hierarchical routing algorithm for backbone and access networkin case of fixed-wireless convergence network. Finally, HTSRP_Q is proposed to meet the QoS requirement when user want interactive or streaming packet service. This protocol will maximize the usage of resources of access layer based on the QoS parameters and process delay-sensitive traffic. Service classes are categorized into 5 types by the user request, such as conversational, streaming, high priority interactive, low priority interactive, and background class. It could be processed efficiently by the routing protocolstraffic model proposed in this paper. The proposed routing protocolstraffic model provides the increase of efficiency and stability of the next generation network thanks to the routing according to the characteristic of the specialized service categories.

키워드

참고문헌

  1. J. A. Cobb and M. G. Gouda, Balanced Routing,IEEE Proceedings of the International Conferenceon Network Protocols, 1997
  2. D. Sidhu, R. Nair and S. Abdallah, Finding Disjoint Paths in Networks, Proceedings of the1991 ACM SIGCOMM Conference, 1991
  3. E. W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, pp. 269- 271, 1959
  4. C. Alaettinoglu, K. Dussa-Zieget, I. Matta, O.Gudmundsson, and A.U. Shankar, MaRS Maryland Routing Simulator Version 1.0.Department of Computer Science, University of Maryland, 1991
  5. J. Moy, OSPF Version 2, Internet Request For Comments 2178, July 1997. Available fromhttp://www.ietf.cnri.reston.va.us
  6. Segall and M. Sidi, A Failsafe Distributed Protocol for Minimum Delay Routing, IEEE Trans. on Commun., C0M-29(5), 686-695, May1981
  7. D. Sidhu, R. Nair and S. Abdallah, Finding Disjoint Paths in Networks, Proceedings of the 1991 ACM SIGCOMM Conference, 1991
  8. L. G. Valiant, A Scheme for Fast Parallel Communication, SIAM Journal on Computing, Vol. 11, No.2, May 1982
  9. Z. Wang and J. Crowcroft, Shortest Path First with Emergency Exits, Proceedings of the 1990 ACM SIGCOMM Conference, 1990
  10. 제한된 난수에 의한 트래픽 분산 라우팅 기법, 한국통신학회 논문지 제 25권 제 11A호
  11. 3GPP, 'General Architecture', 3G TS23.101
  12. 3GPP, 'Network Architecture', 3G TS23.002
  13. 3GPP, 'UTRAN Overall Description', 3GTS25.401
  14. Lei Yao, M. Doroslovacki, A Bandwidth Constrained QoS Routing Algorithm, IEEE, 2001
  15. 3GPP TS 22.105 'Service aspects; Services andService Capabilities', Ver 3.10.0, OCT. 2001
  16. M. Katavenis, S. Sidiropoulos, and C.Courcoubetis, 'Weighted Round-Robin CellMultiplexing in a General-Purpose ATM SwitchChip,' IEEE J. Select. Areas Commun.. Vol. 9No. 8, pp. 1265-1279, OCT. 1991 https://doi.org/10.1109/49.105173
  17. H. Ahn, J. Kim, S. Chong, B. Kim, B. D. Choi,'A Video Traffic Model based on theShifting-Level Process: the Effects of SRD andLRD on Queueing Behavior,' INFOCOM 2000.Nineteenth Annual Joint Conference of the IEEEComputer and Communications Societies.Proceedings. IEEE , Vol. 2, pp. 1036-1045, 2000