| Popis: |
Core communication networks have seen significant traffic increases in recent years, and availability requirements also continue to increase. This fact has led to a wide array of network design improvements, particularly in the area of network survivability. The various survivability mechanisms and accompanying design models that have been developed use diverse strategies to provision spare capacity throughout a network to restore traffic in case of a failure. The break of a fiber line continues to be the most common type of network failure, and this paper addresses at a common protection mechanism called shared backup path protection (SBPP), which is quite efficient at dealing with this type of failure. SBPP is a popular survivability mechanism, and there has been a significant amount of work done with it in recent years. However, the SBPP integer linear program (ILP) design model has proven difficult to solve using reasonable computing and time resources. While many algorithms and heuristics have been developed to design SBPP-based networks, it has been difficult to know how well these designs perform compared to ILP optimized networks. This paper presents a new SBPP-type protection mechanism and accompanying ILP model that solves in a couple orders of magnitude less time than the benchmark approach by allowing multiple working and backup routes (we compare to one representative version of the traditional approach as our benchmark). This new mechanism and accompanying model will allow better benchmarking of SBPP-like network designs, and enhance further study into the performance of SBPP relative to other network survivability approaches. |
