In this paper, we propose a new routing algorithm by using shared bandwidth among secondary LSPs of multiple primary LSPs. This algorithm provides efficient network-level LSP design. This algorithm takes three approaches of dynamically changing OSPF Link-cost metrics to improve efficiency of shared LSPs. The approaches are as follows; (1) the distribution of primary LSPs to reduce detouring LSPs by a single failure, (2) the concentration of secondary LSPs to increase probability of bandwidth sharing, and (3) the distribution of secondary LSPs for a certain failure to increase detouring LSPs which are independent of each other in a Link. This scheme is a sLight improvement over the Dijkstra calculation in conventional OSPF.
展开▼
