Browse > Article

A Traffic Model based on the Differentiated Service Routing Protocol  

인치형 (KTF기술전략팀)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.28, no.10B, 2003 , pp. 947-956 More about this Journal
Abstract
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.
Keywords
QoS; DiffServ;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, pp. 269- 271, 1959
2 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
3 J. Moy, OSPF Version 2, Internet Request For Comments 2178, July 1997. Available fromhttp://www.ietf.cnri.reston.va.us
4 D. Sidhu, R. Nair and S. Abdallah, Finding Disjoint Paths in Networks, Proceedings of the 1991 ACM SIGCOMM Conference, 1991
5 3GPP, 'General Architecture', 3G TS23.101
6 제한된 난수에 의한 트래픽 분산 라우팅 기법, 한국통신학회 논문지 제 25권 제 11A호
7 Z. Wang and J. Crowcroft, Shortest Path First with Emergency Exits, Proceedings of the 1990 ACM SIGCOMM Conference, 1990
8 D. Sidhu, R. Nair and S. Abdallah, Finding Disjoint Paths in Networks, Proceedings of the1991 ACM SIGCOMM Conference, 1991
9 Segall and M. Sidi, A Failsafe Distributed Protocol for Minimum Delay Routing, IEEE Trans. on Commun., C0M-29(5), 686-695, May1981
10 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
11 Lei Yao, M. Doroslovacki, A Bandwidth Constrained QoS Routing Algorithm, IEEE, 2001
12 3GPP TS 22.105 'Service aspects; Services andService Capabilities', Ver 3.10.0, OCT. 2001
13 3GPP, 'UTRAN Overall Description', 3GTS25.401
14 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   DOI   ScienceOn
15 3GPP, 'Network Architecture', 3G TS23.002
16 J. A. Cobb and M. G. Gouda, Balanced Routing,IEEE Proceedings of the International Conferenceon Network Protocols, 1997
17 L. G. Valiant, A Scheme for Fast Parallel Communication, SIAM Journal on Computing, Vol. 11, No.2, May 1982