Abstract

Due to the development of information technology and widespread use of telecommunications networks, the design of mesh-survivable net works has received considerable attention in recent years. This paper deals with spare capacity planning scheme in mesh-based fiber-optic networks. In this study, a new spare capacity planning scheme is proposed utilizing path restoration with maximal sharing of share capacity that is traced by the spare capacity incremental factor (after this, we called SCIF). We compare it with three other spare capacity planning scheme : link capacity of IP (Integer Programming), SLPA(Spare Link Placement Algorithm) and GA(Genetic Algorithm). The approach shows better performance with heuristics algorithm for determining the spare capacity assignment and the computational time is easily controlled allowing the approach to scale to large networks. The major advantages of the new approach are reduction of spare capacity and a polynomial time complexity.omplexity.

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.