A Study on Service Recovery QoS Rerouting Algorithm Based on PFC


KIPS Transactions on Computer and Communication Systems, Vol. 9, No. 5, pp. 655-664, Oct. 2002
10.3745/KIPSTC.2002.9.5.655,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Han and J. W. Chung, "A Study on Service Recovery QoS Rerouting Algorithm Based on PFC," KIPS Journal C (2001 ~ 2012) , vol. 9, no. 5, pp. 655-664, 2002. DOI: 10.3745/KIPSTC.2002.9.5.655.

[ACM Style]
Jeong Soo Han and Jin Wook Chung. 2002. A Study on Service Recovery QoS Rerouting Algorithm Based on PFC. KIPS Journal C (2001 ~ 2012) , 9, 5, (2002), 655-664. DOI: 10.3745/KIPSTC.2002.9.5.655.