Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures

Colored trees (CTs) is an efficient approach to route packets along link- or node-disjoint paths in packet-switched networks. In this approach, two trees, namely red and blue, are constructed rooted at a drain such that the path from any node to the drain are link- or node-disjoint. For applications where both the trees are used simultaneously, it is critical to maintain the trees after link or node failures. To this end, this paper develops an algorithm, referred to as SimCT, that efficiently constructs and maintains colored trees under failures using only local information. Even when the entire tree needs to be recomputed, the SimCT algorithm requires 40% lesser messages than previous techniques. The convergence time of the SimCT algorithm is linear in the number of nodes. We show through extensive simulations that the average length of the disjoint paths obtained using the SimCT algorithm is lesser compared to the previously known techniques. The above-mentioned improvements are obtained by exploiting the relationship between DFS numbering, lowpoint values, and the potentials employed for maintaining partial ordering of nodes. The SimCT algorithm is also extended to obtain colored trees in multi-drain networks.

[1]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[2]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Yuguang Fang,et al.  A simulation study of security performance using multipath routing in ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[4]  Marwan Krunz,et al.  Linear time distributed construction of colored trees for disjoint multipath routing , 2007, Comput. Networks.

[5]  J. J. Garcia-Luna-Aceves,et al.  Congestion-oriented shortest multipath routing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[8]  Marwan Krunz,et al.  Disjoint multipath routing using colored trees , 2007, Comput. Networks.

[9]  Abtin Keshavarzian,et al.  Load balancing in ad hoc networks: single-path routing vs. multi-path routing , 2004, IEEE INFOCOM 2004.

[10]  Jian Tang,et al.  Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Preetha Thulasiraman,et al.  Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[12]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..