Abstract
Shared path protection routing for bandwidth guaranteed connections in multi-domain networks is difficult due to the lack of complete and global knowledge on the network topology and bandwidth allocation. To overcome this difficulty, we propose an aggregated network modelling by overestimation and a two-step routing strategy. In the first step, a rough routing solution is sketched in a compact network which is the topology aggregation of the multi-domain network. A complete routing is then determined by solving routing problems within the original single-domain networks. Each routing step can be solved by either using an exact mathematical or a heuristic method. Computational results show the relevance of the aggregate network modelling and the scalability as well as the efficiency of the proposed routing for multi-domain networks.
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 callMore From: International Journal of Computers and Applications
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.
