Shortest path routing/Bibliography: Difference between revisions
Jump to navigation
Jump to search
imported>David MacQuigg (New page: {{subpages}} E.W. Dijkstra (1959) "A note on two problems in connexion with graphs", ''Numerische Mathematik'' 1: 269–271. Section 5.2 "Routing Algorithms" in "Computer Networks", 4th ...) |
imported>David MacQuigg (Added latest edition of Kurose & Ross) |
||
| Line 6: | Line 6: | ||
Section 4.2 "Routing" in "Computer Networks: A Systems Approach", 4th ed, L.L. Peterson, B.S. Davie, Morgann Kaufmann 2007. | Section 4.2 "Routing" in "Computer Networks: A Systems Approach", 4th ed, L.L. Peterson, B.S. Davie, Morgann Kaufmann 2007. | ||
Section 4.5 "Routing Algorithms" in "Computer Networking: A Top-Down Approach", 5th ed, J.F. Kurose, K.W. Ross, Addison-Wesley 2010. | |||
Latest revision as of 03:33, 3 February 2011
- Please sort and annotate in a user-friendly manner. For formatting, consider using automated reference wikification.
E.W. Dijkstra (1959) "A note on two problems in connexion with graphs", Numerische Mathematik 1: 269–271.
Section 5.2 "Routing Algorithms" in "Computer Networks", 4th ed, A.S. Tanenbaum, Prentice-Hall 2003.
Section 4.2 "Routing" in "Computer Networks: A Systems Approach", 4th ed, L.L. Peterson, B.S. Davie, Morgann Kaufmann 2007.
Section 4.5 "Routing Algorithms" in "Computer Networking: A Top-Down Approach", 5th ed, J.F. Kurose, K.W. Ross, Addison-Wesley 2010.