%0 Journal Article
%T Weighted Independent Directed Acyclic Graphs for resilient and efficient multipath routing
%A M. Ramakrishnan
%A Sowmya Swaminathan
%A Jayaganesan Chandrasekaran
%J International Journal of Mathematics and Soft Computing
%D 2013
%I SweDha Publication
%X 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.
%K Independent Directed Acyclic Graphs (IDAGs)
%K failure recovery
%K weighted independent graphs
%K multipath routing
%K Dijkstra¡¯s algorithm
%K shortest path routing.
%U http://ijmsc.com/index.php/ijmsc/article/view/IJMSC062/3-3-1