The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Various Algorithms of Service Recovery in IP Network

IP 네트워크 상의 다양한 서비스 복구 알고리즘

  • 한정수 (신구대학 인터넷 정보과)
  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In case of failure in the IP network, services should be provided via a backup path which fully meets QoS requirements. In this regard, we in this paper suggest simple-PFC(s-PFC) to restore single link failure, iterative-PFC(i-PFC) for multiple link failures, and fault_node Avoidance-PFC(a-PFC) for failures of nodes such as routers. Taking the minimum cost rerouting problem into account, we compare and analyze performance of those three mechanisms carrying out Direct-destination Rerouting(DR).

네트워크 상에 장애가 발생 시에는 서비스들의 QoS 요구사항을 만족시킬 수 있는 또 다론 백업 경로를 사용 하여 서비스해야 한다. 따라서 본 논문에서는 IP 네트워크 상에 발생된 단일 회선 장애를 위해 simple PFC(s-PFC) 기법과 다중 회선 장애를 위한 iterative PFC(i-PFC) 그리고 라우터와 같은 노드 장애를 복구하기 위한 fault_node Avoidance PFC(a-PFC) 기법들을 제안하고 이를 기반으로 Direct_destination Rerouting(DR) 기법 을 최소 재라우팅 비용 문제를 통해 성능 비교 분석하기로 한다.

Keywords

References

  1. 한정수, 정진욱, '암시적 3단계 정보를 갖는 분산 Qos 라우팅 성능 연구', 한국정보처리학회논문지 (C), 제9-C권 제1호 2002년 2월 pp.141-145
  2. Anindo Banerjea, 'Fault Recovery for Guaranteed Perfonnance Communications Connections' , IEEF/ACM Trans on Networking, Vol 7, No 5, October 1999, pp 653-668 https://doi.org/10.1109/90.803381
  3. Murali Kodialam and T.V. Lakshman, 'Restorable Dynamic Quality of Service Routing', IEEE Communications Maga ine June 2002. pp 72-81
  4. D.Medhi and R.Khurana 'Optimization and Performance of Network Restoration Schemes for Wide-Area Teletraffic Networks', Journal of Network and Szstems Management, Vol 3, No 3, Sept. 1995
  5. Christopher Metz, 'IP Protection and Restoration', Internet Computing, MarchApril 2000, pp 97-102
  6. Demetios Stamatelakis, Wayne D.Grover 'IP Layer Restoration and Network Planning Based on Virtual Protection Cycles', IEEE Journal on Selected Area in Communications Vol 18, No. 10, Oct 2000, pp 1938-1949 https://doi.org/10.1109/49.887914
  7. Muriel Medard, Steven G, Finn, Richard A.Barry, Robert G.Gallager, 'Redundant Trees for Preplanned Recovery in Arbitrary Vertex-Redundant or Edge Redundant Graphs', IEEE/ACM Trans on Networking, Vol 7, No 5, Octorber 1999, pp 641-645 https://doi.org/10.1109/90.803380
  8. W P. Wang, D.Tipper, B.Jaeger, and D.Medhi, 'Fault Recovery routing in Wide Area packet Networks', in Proceedings of 15th International Teletraffic Congress, Washington, DC, June 1997 , pp 1938-1949
  9. Bartos, R, Raman, M, 'A heuristic approach to service restoration in MPLS networks', Communication, 2001, ICC 2001, IEEE International conference on, Vol 1, 2001, pp 117-121
  10. Jozsa, B.G, Magyar, G 'Reroute sequence planning for label switched paths in multiprotocol label switching networks', computers and Communications, 2001, Proceedings, 6th IEEE Szmposium on, 2001, pp 319-325
  11. Ken Owens, Vishal Sharma, Srinivas Makam, Changcheng Huang, 'A Path Protection/Restoration Mechanism for MPLS Networks', IETF Draft Jan 2002