期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：3
页码：487-491
语种：English
出版社：Ayushmaan Technologies
摘要：Resilient multipath routing achievement makes us to introduce the concept of Independent Directed Acyclic Graphs (IDAGs). we develop a new algorithm called polynomial- time algorithms which compute link-independent and node-independent DAGs. which provides multipath routing by utilizing all possible edges with link failure recovery and achieves a god speed in data transmission to overcome the overhead when routing is based on destination address and incoming edge. IDAGs approach shows a good result in performance wise, which can be compute by using by comparing key performance through extensive simulations.
