Weighted Independent Directed Acyclic Graphs for resilient and efficient multipath routing

In order to achieve resilient multipath routing with efficient path choosing dynamically, we introduce the concept of Weighted Independent Directed Acyclic Graphs (WIDAGs). In a given network we develop polynomial-time algorithms to compute link-independent and node-independent DAGs. We use Heuristic methods to dynamically choose the maximum profitable (least cost) route upon a single link failure. The algorithm developed in this paper takes the advantage of the resiliency provided by IDAG and in addition, improves efficiency by choosing least cost path dynamically.