Disjoint multipath routing using colored trees

— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath routing (DMPR) requires the multiple paths to be link- or node-disjoint. Both MPR and DMPR poses significant challenges in terms of obtaining loop-free multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being particularly significant in IP datagram networks. This paper develops a two-disjoint multipath routing strategy using colored trees. Two trees, red and blue, that are rooted at a designated node called the drain are formed. The paths from a given source to the drain on the two trees are link- or node-disjoint. Such an approach requires every node to maintain only two preferred neighbors for each destination, one on each tree. This paper (1) formulates the problem of colored-trees construction as an integer linear program (ILP); and (2) develops the first ...

• Type: Journal
• Year: 2007
• Where: CN
• Authors: Srinivasan Ramasubramanian, Harish Krishnamoorthy, Marwan Krunz
• Keywords: CN 2007, Disjoint Multipath, Multiple Paths, Routing