A NOVEL SCHEME FOR RELIABLE MULTIPATH ROUTING THROUGH NODE-INDEPENDENT DIRECTED ACYCLIC GRAPHS

Srinivas.Vaida, N.Raghava Rao, R.V.Krishnaiah

Abstract: Multipath routing is essential in the wake of voice over IP, multimedia streaming for efficient data transmission. The growing usage of such network requirements also demands fast recovery from network failures. Multipath routing is one of the promising routing schemes to accommodate the diverse requirements of the network with provision such as load balancing and improved bandwidth. Cho et al. introduced a resilient multipath routing scheme known as directed acyclic graphs. These graphs enable multipath routing with all possible edges while ensuring guaranteed recovery from single point of failures. We also built a prototype application that demonstrates the efficiency of the scheme. The simulation results revealed that the scheme is useful and can be used in real world network applications

Keywords: Multipath routing, failure recovery, directed acyclic graphs

DOI: https://doi.org/10.15623/ijret.2013.0208029