New dynamic SPT algorithm based on a ball-and-string model
暂无分享,去创建一个
[1] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[2] Stephen E. Deering,et al. Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.
[3] M. Steenstrup. Routing in communications networks , 1995 .
[4] Daniele Frigioni,et al. Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.
[5] Daniele Frigioni,et al. Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.
[6] Alberto Marchetti-Spaccamela,et al. Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..
[7] Giuseppe F. Italiano,et al. Incremental algorithms for minimal length paths , 1991, SODA '90.
[8] R. Perlman. A comparison between two routing protocols: OSPF and IS-IS , 1991, IEEE Network.
[9] Paul Traina,et al. BGP-4 Protocol Analysis , 1995, RFC.
[10] John Moy,et al. OSPF Version 2 , 1998, RFC.
[11] SiuKai-Yeung,et al. New dynamic SPT algorithm based on a ball-and-string model , 2001 .
[12] Pawel Gburzynski,et al. Routing in multihop packet switching networks: Gb/s challenge , 1995, IEEE Netw..
[13] Deborah Estrin,et al. Design of inter-administrative domain routing protocols , 1990, SIGCOMM 1990.
[14] Dave Katz,et al. Application of the Border Gateway Protocol in the Internet , 1990, RFC.
[15] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[16] Christian Huitema,et al. Routing in the Internet , 1995 .
[17] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[18] Vern Paxson,et al. End-to-end routing behavior in the Internet , 1996, TNET.
[19] V. Paxson. End-to-end routing behavior in the internet , 2006, CCRV.
[20] Christian Huitema,et al. An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..
[21] G. Varghese,et al. Pitfalls in the design of distributed routing algorithms , 1988, SIGCOMM 1988.
[22] P. Hoffman. Internet Draft , 1998 .
[23] Deborah Estrin,et al. Design of inter-administrative domain routing protocols , 1990, SIGCOMM '90.
[24] Daniele Frigioni,et al. Incremental algorithms for single-source shortest path trees , 1994 .
[25] Kai-Yeung Siu,et al. New dynamic algorithms for shortest path tree computation , 2000, TNET.
[26] A. Pan,et al. On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..
[27] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[28] Farnam Jahanian,et al. Internet routing instability , 1997, SIGCOMM '97.
[29] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[30] T. B. Boffey. Linear Network Optimization: Algorithms and Codes , 1994 .