DocumentCode :
3185543
Title :
A novel service recovery method based upon Bellman dynamic programming
Author :
Jun-bo, Xu ; Hui-qiang, Wang ; Feng, Guangsheng
Author_Institution :
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
fYear :
2010
fDate :
3-5 Dec. 2010
Firstpage :
110
Lastpage :
115
Abstract :
To resolve node failure in service path caused by network system complexity, a novel service recovery method based upon Bellman dynamic programming is proposed in this paper. First, in view of service path strategy, an optimal path selected from all existed ones is servicing as the failure recovery foundation. Then, the service recovery decision is transferred to dynamic programming problem by logical layer network self-organization and utility function definition. Last, the optimal path is calculated by Bellman dynamic programming. According to the problem scale, the dynamic migration or reconstruction technology could be applied to service recovery. Experimental results show that the proposed Bellman dynamic programming method has higher performance, and the recovery rate is also higher than traditional service backup path method.
Keywords :
dynamic programming; system recovery; Bellman dynamic programming; dynamic migration; failure recovery foundation; logical layer network self-organization; network system complexity; node failure; optimal path; reconstruction technology; service path; service recovery; utility function; Computers; Dynamic programming; Heuristic algorithms; Information systems; Network topology; Planning; Servers; Bellman dynamic programming; network system; node failure; path selection; service recovery;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Application (ICCIA), 2010 International Conference on
Conference_Location :
Tianjin
Print_ISBN :
978-1-4244-8597-0
Type :
conf
DOI :
10.1109/ICCIA.2010.6141550
Filename :
6141550
Link To Document :
بازگشت