Label switched path restoration under two random failures
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[2] Murali S. Kodialam,et al. Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[3] Ariel Orda,et al. QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.
[4] Daniel O. Awduche,et al. Requirements for Traffic Engineering Over MPLS , 1999, RFC.
[5] Srinivas V. Makam,et al. Framework for MPLS - based Recovery , 2000 .
[6] Ramki Krishnan,et al. A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute , 2000 .
[7] T. V. Lakshman,et al. Shared backup Label Switched Path restoration , 2001 .
[8] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.