Abstract
This investigation presents several backup path building schemes for multicast connections in self-healing ATM networks. These restoration schemes are formulated as combinatorial optimization problems in which the objective functions minimize bandwidth usage and the constraints required to satisfy the survivability and physical limitations. Lagrangian based and greedy based heuristic algorithms are also developed to obtain the sub-optimal feasible solutions efficiently. In addition, the Lagrangian lower bounds are used to assess the quality of our heuristic solutions. Moreover, closely examining the gap between the heuristic upper bounds and the Lagrangian lower bounds reveal that the proposed algorithm can efficiently provide a nearly optimal solution for multicast connections in self-healing ATM networks.
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.
