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

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

Interference-Prediction based Online Routing Aglorithm for MPLS Traffic Engineering

MPLS 트래픽 엔지니어링을 위한 간섭 예측 기반의 online 라우팅 알고리듬

  • Lee, Dong-Hoon (Department of Information and Telecommunication Engineering, Graduate School of Hankuk Aviation University) ;
  • Lee, Sung-Chang (School of Avionics and Telecommunications, Hankuk Aviation University) ;
  • Ye, Byung-Ho (Electronics and Telecommunications Research Institute)
  • 이동훈 (한국항공대학교 대학원 정보통신공학과) ;
  • 이성창 (한국항공대학교 항공전자 및 정보통신공학부) ;
  • 예병호 (한국전자통신연구원)
  • Published : 2005.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.

인터넷 규모의 확장과 트래픽의 증가로 인해 발생하는 망 혼잡 상황을 해결하기 위해 본 연구는 망 제어 기술의 일환책으로서 간섭 예측 정보를 이용한 online 라우팅 알고리듬을 제안한다. 차세대 통합망은 사용자 서비스별 요구 수준에 따라 종단간의 QoS를 보장해야 한다. 이를 위해 동적 대역폭 할당이 효율적으로 이루어져야 하며, 망 전체 성능을 고려한 경로 설정 알고리듬이 필요하다. 본 논문에서 제안한 알고리듬은 현재 라우팅 요청이 요구하는 대역폭의 양이 미래의 잠재적인 트래픽을 간섭하는 정도를 예측하여, 이를 최소화시키는 방안을 제시한다. 망 전체 성능을 최대화하고, 한정된 자원이 낭비되는 것을 방지하기 위해 제안 알고리듬은 요구 대역폭, link 상태정보, 그리고 ingress-egress pair 정보 등을 복합적으로 고려한다. 또한 간섭을 예측하는 것은 동적으로 변화하는 망 상황에서 보장된 대역폭을 제공하게 함으로써 사용자의 요구를 최대한 수용할 수 있게 한다. 본 논문에서는 Internet traffic engineering에 적합한 최적 경로 설정 알고리듬을 제안하기 위해 라우팅 알고리듬이 갖추어야 할 요구 조건과 최근 연구동향을 분석하였으며, QoS 라우팅의 대표적인 연구사례를 분석하였다. 그리고 이를 기반으로 기존의 알고리듬의 문제점을 파악하고 최적의 해결 방안을 제시한다. 개선된 사항은 시뮬레이션을 통해 기존 알고리듬과 비교 및 분석되었다.

Keywords

References

  1. Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X., 'Overview and Principles of Internet Traffic Engineering', RFC 3272, May 2002
  2. Moy, J., 'OSPF Version 2', RFC 2328, April 1998
  3. Callon, R., 'Use of OSI IS-IS for Routing in TCP/IP and Dual Environments', RFC 1195, December 1990
  4. Rosen, E., Viswanathan, A., Callon, R., 'Multiprotocol Label Switching Architecture', RFC 3031, January 2001
  5. Aboul-Magd, O., 'Documentation of IANA assignments for Constraint-Based LSP setup using LDP (CR-LDP) Extensions for Automatic Swithced Optical Network', RFC 3475, March 2003
  6. Awaduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V. and G. Swallow, 'RSVP-TE: Extensions to RSVP for LSP Tunnels', RFC 3209, prop, December 2001
  7. Kodialam and Lakshman, 'Minimum Interference Routing with Applications to MPLS TrafficEngineering,' IEEE Infocom 2000. March 2000 https://doi.org/10.1109/INFCOM.2000.832263
  8. Awduche, D., Malcolm, J., Agogbua, J., O'Dell, M., McManus, J., 'Requirements for Traffic Engineering Over MPLS', RFC 2702, September 1999
  9. E.Mykoniati et al., 'Admission Control for Providing QoS in DiffServ IP Networks: The TEQUILA approach', IEEE Communications Magazine, January 2003
  10. Panos Trimintzios, Timothy Bauge, George Pavlou, Paris Flegkas, Richard Egan, 'Quality of service provisioning through traffic engineering with applicability to IP-based production networks', computer communications, 2003 https://doi.org/10.1016/S0140-3664(02)00218-9
  11. Subhash Suri, Marcel Waldvogel, Daniel Bauer, Priyank Ramesh Warkhede, 'Profile-based routing and traffic engineering', computer communications, 2003 https://doi.org/10.1016/S0140-3664(02)00154-8
  12. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, 'Network Flows: Theory, Algorithms, and Applications', Prentice-Hall, Upper Saddle River, NJ, USA, 1993
  13. I. Widjaja, I. Saniee, A. Elwalid and D. Mitra, 'A New Approach for MPLS Traffic Engineering', computer communications, 2003
  14. Roch A. Guerin, Ariel Orda, Douglas Williams, 'QoS Routing Mechanisms and OSPF Extensions', GLOBCOM, 1997 https://doi.org/10.1109/GLOCOM.1997.644603
  15. Koushik Kar, Murali Kodialam. T. V.Lakshman, 'MPLS Traffic Engineering Using Enhanced Minimum Interference Routing: An Approach Based On Lexicographic Max-Flow', IWQOS, 2000 https://doi.org/10.1109/IWQOS.2000.847943
  16. A. V. Goldberg, R. E. Tarjan, 'Solving Minimum Cost Flow Problem by Successive Approximation', Proceedigns of the 19th ACM Symposium on the Theory of Computing, pp.7-18, 1987 https://doi.org/10.1145/28395.28397
  17. ns-2 network simulator. URL : http://www.isi.edu/nsnam/ns
  18. R. Guerin, D. Williams, G. Apostolopoulos, S. Kamat, A. Orda, T. Przygienda, QoS Routing Mechanisms and OSPF extensions, IETF RFC 2676, 1999
  19. H. Smit, T. Li, Intermediate System to Intermediate System (IS-IS) Extensions for Traffic Engineering (TE), IETF RFC 3784, June 2004