Abstract
Dynamic routing of restorable bandwidth guaranteed path is an important issue in the intelligent optical mesh networks. A restorable path routing algorithm usually consists of two parts: the selection of a working path and the selection of a backup path. In this paper, we study the effect of using different working path selection methods on network utilization when a shared backup selection method is given. Specifically, two restorable path routing algorithms are analyzed. In the first separate optimization based algorithm, the working path is selected by the shortest path algorithm to minimize the working capacity. In the second joint optimization based algorithm, the working path is selected jointly with the backup path to minimize the sum of the working and backup capacity. Based on the analysis result, we propose a new restorable routing algorithm that treats the link usage related to a link as part of the link cost when the shortest path algorithm is performed to compute the working path. Our results show that the proposed algorithm outperforms both existing algorithms mentioned above.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
