PATH IDENTIFICATION IN MULTIPATH ROUTING
暂无分享,去创建一个
[1] David Thaler,et al. Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.
[2] Ariel Orda,et al. QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.
[3] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[4] David Thaler,et al. Using name-based mappings to increase hit rates , 1998, TNET.
[5] Jennifer Rexford,et al. Toward internet-wide multipath routing , 2008, IEEE Network.
[6] Subhash Suri,et al. Finding the k shortest simple paths , 2007, ALENEX.
[7] Kai-Yeung Siu,et al. Efficient Algorithms for Multi-Path Link-State Routing , 1999 .
[8] Marta M. B. Pascoal,et al. The k Shortest Paths Problem , 1998 .
[9] Pawel Gburzynski,et al. Multiple path routing in networks with inaccurate link state information , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[10] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] J. Y. Yen,et al. Finding the K Shortest Loopless Paths in a Network , 2007 .
[12] John Moy,et al. OSPF Version 2 , 1998, RFC.
[13] Curtis Villamizar,et al. OSPF Optimized Multipath (OSPF-OMP) , 1999 .