Abstract

Pre-configuration Cycle (p-cycle) is a promising approach for protecting working capacities in wavelength-division-multiplexing (WDM) mesh networks because of its ability to achieve ring-like recovery speed while maintaining the capacity efficiency of a mesh-restorable network. The p-cycle design in WDM mesh networks is to determine a set of p-cycles requiring near-minimal spare capacity to fully protect a capacitated network with individually different working capacity quantities on each span. The spare capacity allocation for the p-cycles is to decide where to place spare capacity in the network and how much spare capacity must be reserved on the p-cycles to guarantee seamless communications services survivable to a set of failure scenarios. The p-cycles are formed in the spare capacity of the network, so a spare capacity allocation of the p-cycles can be done without affecting the working traffic. This paper investigates the spare capacity allocation problem for p-cycles in WDM mesh networks. We propose a heuristic method, called the Joint p-Cycle capacity allocation (JCCA), for p-cycles spare capacity allocation in WDM mesh networks. This method can allocate optimal spare capacity for p-cycles and ensure 100% restorability without using Integer Linear Programming (ILP). JCCA configures the p-cycles with considering the distribution of the capacity distribution of the networks and first assigns p-cycles with good actual efficiency. The performance of JCCA is evaluated by computer simulations on the real world network topology. And the comparisons of this method and traditional design algorithms are presented in the paper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.