Multiple path routing algorithm for IP networks

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Wai-Kai Chen.  Theory of nets - flows in networks , 1990 .

[5]  Cengiz Alaettinoglu,et al.  Performance comparison of routing protocols under dynamic and static file transfer connections , 1992, CCRV.

[6]  A. Udaya Shankar,et al.  Design and implementation of MaRS: a routing testbed , 1992 .

[7]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[8]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[9]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[10]  Kai-Yeung Siu,et al.  New dynamic SPT algorithm based on a ball-and-string model , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.