Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2002.9C.5.655

A Study on Service Recovery QoS Rerouting Algorithm Based on PFC  

Han, Jeong-Soo (성균관대학교 대학원 정보통신공학부)
Chung, Jin-Wook (성균관대학교 정보통신공학부)
Publication Information
The KIPS Transactions:PartC / v.9C, no.5, 2002 , pp. 655-664 More about this Journal
Abstract
The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.
Keywords
QoS Routing; Protection Cycle; Rerouting; Integer Program; Fault Recovery;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Medhi and R. Khurana 'Optimization and Performance of Network Restoration Schemes for Wide-Area Teletraffic Network,' Journal of Network and Systems Management, Vol.3, No.3, Sept., 1995   DOI
2 Christopher Metz, 'IP Protection and Restoration,' Internet Computing, pp.97-102, March-April, 2000   DOI   ScienceOn
3 Bartos, R. Raman, M, 'A heuristic approach to service restoration in MPLS networks,' Communication, 2001, ICC 2001, IEEE International conference, Vol.1, pp.117-121, 2001   DOI
4 한정수, 정진욱 '암시적 3단계 정보를 갖는 분산 QoS 라우팅 성능 연구', 정보처리학회논문지C, 제9-C권 제1호, pp.141-145, 2002
5 Anindo Banerjea 'Fault Recovery for Guaranteed Performance Communication Connections,' IEEE/ACM Trans on Networking, Vol.7, No.5, pp.653-668, October, 1999   DOI   ScienceOn
6 Murali Kodialam and T. V. Lakshman, 'Restorable Dynamic Quality of Service Routing,' IEEE Communications Magazine, pp.72-81, June, 2002   DOI   ScienceOn
7 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, pp.1938-1949, Oct., 2000   DOI   ScienceOn
8 Murial 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, pp.641-645, October, 1999   DOI   ScienceOn
9 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
10 Jozsa, B. G, Magyer, G., 'Reroute sequence planning for label switched paths in multiprotocol label switching networks,' computers and Communications,2001, Proceedings, 6th IEEE symposium on, pp.319-325, 2001   DOI
11 Ken Owens, Vishal Sharma, Srinivas Makam, Changcheng Huang, 'A Path Protection/Restoration Mechanism for MPLS Networks,' IETF Draft Jan., 2002