An efficient multipath forwarding method
暂无分享,去创建一个
[1] Fred Baker,et al. RIP Version 2 MIB Extension , 1994, Request for Comments.
[2] Ram Krishnan,et al. Choice of allocation granularity in multipath source routing schemes , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[3] David Griffin,et al. A management system for load balancing through adaptive routing in multi-service ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[4] John Moy,et al. OSPF specification , 1989, Request for Comments.
[5] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[6] Tohru Kikuno,et al. A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.
[7] Jeffrey M. Jaffe,et al. SNA Routing: Past, Present, and Possible Future , 1983, IBM Syst. J..
[8] E. Martins,et al. An algorithm for the ranking of shortest paths , 1993 .
[9] Deepinder P. Sidhu,et al. Finding disjoint paths in networks , 1991, SIGCOMM '91.
[10] Hiroshi Suzuki,et al. Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[11] Wai Sum Lai,et al. Bifurcated routing in computer networks , 1985, CCRV.
[12] Donald M. Topkis,et al. A k shortest path algorithm for adaptive routing in communications networks , 1988, IEEE Trans. Commun..
[13] David C. Walden,et al. The ARPA Network Design Decisions , 1977, Comput. Networks.
[14] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[15] James P. Gray,et al. SNA Multiple-System Networking , 1979, IBM Syst. J..
[16] Saewoong Bahk,et al. Dynamic Multi-Path Routing and How It Compares With Other Dynamic Routing Algorithms for High Speed Wide Area Network , 1992, SIGCOMM.