A novel service recovery method based upon Bellman dynamic programming

摘要

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.