Independent Directed Acyclic Graph Using Colored Tree Approach.

A B S T R A C T The independent directed acyclic graph (IDAGs) introduces the new concept of Green tree approach, which used to solve the problem of single link failure and the dual link failure. The colored tree approach allows every node to split its traffic between the three trees, thus offering disjoint multipath routing. The polynomial- time algorithms used to compute link-independent and node-independent DAGs. This algorithm provides multipath routing, utilizes all possible edges, recovery from single and dual link failure, selection of shortest path on the basis of available paths. And reduce the number of overhead bit required in the packet header. The proposed system will prepare in JAVA platform by using Dynamic Programming.