Abstract
In the context of computer networks, most conventional algorithms are designed to work under no-failure conditions for dealing with the routing problem. This paper investigates a more realistic situation where the flow assignment takes into account the possibility of a link failure. The method proposed to deal with this problem guarantees the survivability and allows analyzing the network behavior after a link failure. Further, it can be applicable to networks during their design phase as well as during the operational phase. Result analysis reveals the capacity of this method to design networks which satisfy the survivability constraints and to largely improve the delay obtained by other methods.
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.
