Resilient Multipath Routing with Independent Directed Acyclic Graphs
暂无分享,去创建一个
[1] Stein Gjessing,et al. Fast IP Network Recovery Using Multiple Routing Configurations , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[2] Stewart Bryant,et al. IP Fast Reroute Using Not-via Addresses , 2006 .
[3] Stewart Bryant,et al. IP Fast Reroute Framework , 2010, RFC.
[4] Chen-Nee Chuah,et al. Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.
[5] G. Jayavelu,et al. Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures , 2009, IEEE/ACM Transactions on Networking.
[6] Jin Seek Choi,et al. A survey of multipath routing for traffic engineering , 2002 .
[7] Marwan Krunz,et al. Linear time distributed construction of colored trees for disjoint multipath routing , 2007, Comput. Networks.
[8] Marwan Krunz,et al. Distributed Linear Time Construction of Colored Trees for Disjoint Multipath Routing , 2006, Networking.
[9] Muriel Médard,et al. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.
[10] Srihari Nelakuditi,et al. Failure insensitive routing for ensuring service availability , 2003, IWQoS'03.
[11] Li Chen,et al. Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..
[12] Amund Kvalbein,et al. Fast Recovery from Dual Link Failures in IP Networks , 2009, IEEE INFOCOM 2009.
[13] Andreas Huck. Independent trees in graphs , 1994, Graphs Comb..