Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing

  • Srinivasan Ramasubramanian
  • Mithun Harkara
  • Marwan Krunz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3976)


Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks, where data is forwarded along multiple link- or node-disjoint paths. 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 datagram networks. One approach to reduce the number of routing table entries for multipath forwarding is to construct two trees, namely red and blue, rooted at a destination node such that the paths from a source to the destination on the two trees are link/node-disjoint. This paper develops the first distributed algorithm for constructing the colored trees whose running time is linear in the number of links in the network. The paper also demonstrates the effectiveness of employing generalized low-point concept rather than traditional low-point concept in the DFS-tree to reduce the average path lengths on the colored trees.


Multiple Path Average Path Length Backup Path Path Search IEEE INFOCOM 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Ye, Z., Krishnamurthy, S., Tripathi, S.: A framework for reliable routing in mobile adhoc networks. In: Proceedings of IEEE INFOCOM 2003, pp. 270–280 (2003)Google Scholar
  2. 2.
    Pham, P.P., Perreau, S.: Performance analysis of reactive shortest path and multipath routing mechanism with load balance. In: Proceedings of IEEE INFOCOM, vol. 1, pp. 251–259 (2003)Google Scholar
  3. 3.
    Murthy, S., Garcia-Luna-Aceves, J.J.: Congestion-oriented shortest multipath routing. In: Proceedings of IEEE INFOCOM, vol. 3, pp. 1028–1036 (1996)Google Scholar
  4. 4.
    Ganesan, D., Govindan, R., Shenker, S., Estrin, D.: Highly resilient energy-efficient multipath routing in wireless sensor networks. ACK SIGMOBILE Mobile Computing and Communications Review 4(5), 11–25 (2001)CrossRefGoogle Scholar
  5. 5.
    Bhandari, R.: Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
  6. 6.
    Grover, W.D.: Mesh-based Survivable Networks: Options and Strategies for Optical. In: MPLS, SONET and ATM Networking. Prentice Hall Publishers, New Jersey (2003)Google Scholar
  7. 7.
    Begen, A.C., Altunbasak, Y., Ergun, O.: Multi-path selection for multiple description encoded video streaming. In: Proceedings of IEEE International Conference on Communications, vol. 3, pp. 1583–1589 (2003)Google Scholar
  8. 8.
    Lee, S., Gerla, M.: Split multipath routing with maximally disjoint paths in ad hoc networks. In: Proceedings of IEEE ICC, pp. 3201–3205 (2001)Google Scholar
  9. 9.
    Nasipuri, A., Das, S.R.: On-demand multipath routing for mobile ad hoc networks. In: Proceedings of IEEE International Conference on Computer Communications and Networks, pp. 64–70 (1999)Google Scholar
  10. 10.
    Wu, J.: An extended dynamic source routing scheme in ad hoc wireless networks. In: Proceedings of 35th Annual Hawaii International Conference on System Sciences, pp. 3832–3838 (2002)Google Scholar
  11. 11.
    Marina, M.K., Das, S.R.: On-demand multipath distance vector routing in ad hoc networks. In: Proceedings of IEEE ICNP, pp. 14–23 (2001)Google Scholar
  12. 12.
    Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of IEEE INFOCOM, pp. 1405–1413 (1997)Google Scholar
  13. 13.
    Raju, J., Garcia-Luna-Aceves, J.J.: A new approach to on-demand loop-free multipath routing. In: Proceedings of IEEE International Conference on Computer Communications and Networks (ICCCN), pp. 522–527 (1999)Google Scholar
  14. 14.
    Valera, A., Seah, W.K.G., Rao, S.V.: Cooperative packet caching and shortest multipath in mobile adhoc networks. In: Proceedings of IEEE INFOCOM, pp. 260–269 (2003)Google Scholar
  15. 15.
    Lee, S., Gerla, M.: Aodv-br: Backup routing in ad hoc network. In: Proceedings of IEEE WCNC, pp. 1311–1316 (2000)Google Scholar
  16. 16.
    Ramasubramanian, S., Krishnamoorthy, H., Krunz, M.: Disjoint multipath routing using colored trees. Technical Report, University of Arizona (2005)Google Scholar
  17. 17.
    Medard, M., Barry, R., Finn, S., Gallager, R.: Redundant trees for preplanned recovery in arbitrary vertex- redundant or edge redundant graphs. IEEE/ACM Transactions on Networking 7(5), 641–652 (1999)CrossRefGoogle Scholar
  18. 18.
    Xue, G., Chen, L., Thulasiraman, K.: Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees. IEEE Journal on Selected Areas in Communication 21(8), 1332–1345 (2003)CrossRefGoogle Scholar
  19. 19.
    Zhang, W., Xue, G., Tang, J., Thulasiraman, K.: Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. In: Proceedings of IEEE INFOCOM, Miami, FL, USA, pp. 2702–2710 (2005)Google Scholar
  20. 20.
    Waxman, B.M.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communications 6(9), 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Srinivasan Ramasubramanian
    • 1
  • Mithun Harkara
    • 1
  • Marwan Krunz
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of ArizonaTucson

Personalised recommendations