JAVA IEEE Final Year Projects 2012 Independent Directed Acyclic Graphs for Resilient Multipath Routing in Networking

   August 6, 2012    One Comment    Posted in: Final year projects

Java IEEE Final Year Projects 2012 Independent Directed Acyclic Graphs for Resilient Multipath Routing in Networking

Independent Directed Acyclic Graphs for Resilient Multipath Routing

Abstract:

To achieve resilient multipath routing, the concept of Independent Directed Acyclic Graphs (IDAGs) is introduced. Link-independent (Node-independent) DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. DAGs supports: (1) multipath routing; (2) use all possible edges; (3) recovery from single link failure; and (4) one bit per packet as overhead.

   Tags: ,

Comments are closed.