Abstract
Multipath routing plays an important role in communication networks. It can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built model for vertex-disjoint paths problem and then proposed algorithm for finding the shortest pair of vertex-disjoint paths. We consider in this paper the shortest-path problem in networks in which the length (or weight) of the edges are considered. We present algorithms for finding the shortest-path. In more restricted transit. Furthermore, we can extend this algorithm to find any k disjoint paths whose sum-weight is minimized.
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.
