Shared Segment Protection (SSP), compared to Shared Path Protection (SPP) or Shared Link Protection (SLP), provides an optimal protection configuration, since SSP can increase the number of connections sharing the same protection segments and can reduce the restoration time in case of single link failure. This paper provides a thorough study on SSP under the GMPLS-based recovery framework, where an effective survivable routing algorithm for SSP is proposed, called Shared Segment Protection (SSP) algorithm. The main advantage of the SSP algorithm is to reduce the high computation complexity in solving the ILP formulation first introduced in . With an efficient iterative approach the design space is significantly reduced by excluding all the links that result intolerably long routes. The tradeoff between the price (i.e., cost representing the amount of resources, and the blocking probability) and the restoration time is extensively studied by simulations on three networks with highly dynamic traffic. It is demonstrated that the SSP algorithm can be a powerful solution in the GMPLSbased recovery with a stringent delay upper bound for achieving high availability and restorability of the transport services . The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP.
|Number of pages||10|
|Publication status||Published - Dec 1 2005|
|Event||2nd International Conference on Broadband Networks, BROADNETS 2005 - Boston, MA, United States|
Duration: Oct 3 2005 → Oct 7 2005
|Other||2nd International Conference on Broadband Networks, BROADNETS 2005|
|Period||10/3/05 → 10/7/05|
ASJC Scopus subject areas