William T. Zaumen
- BERT-87.D. Bertsekas and R. Oallager, 1987: Data Networks. Englewood Cliffs, NF: Prentice- Hall, Inc.]] Google Scholar
Digital Library
- CEGR-75.T. Cegrell, 1975: '% Routing Procedure for the TIDAS Message-Switching Network," IEEE Transactions on Communications, Vol. COM-23, No. 6, pp. 575-585.]]Google Scholar
- CHEN-89.C. Cheng, 1989: "A Loop-Free Extended BeUman-Ford Routing Protocol without Bouncing Effect," ACM Computer Communication Review, Vol. 19, No. 4, pp. 224-236.]] Google ScholarDigital Library
- COLT-89.R. Coltun, 1989: "OSPF: An internet Routing Protocol," ConneXions, Vol. 3, No. 8, pp. 19-25.]]Google Scholar
- DIJK-59.E.W. Dijkstra, 1959: "A Note on Two Problems in Connection with Graphs," Numer. Math., Vol. 1, pp. 269-271.]]Google ScholarDigital Library
- DIJK-80.E.W. Dijlcstra and C.S. Scholten, 1980: "T~ation Detection for Diffusing Computations,'' Information Processing Letters, Vol. 11, No. 1, pp. 1--4.]]Google ScholarCross Ref
- FORD-62.L.R. Ford and D.R. Fulkerson, 1962: Flows in Networks. Princeton, NJ: Princeton University Press.]]Google Scholar
- GARC-89a.lJ. Garcia-Luna-Aceves, 1989: "A Minimum-Hop Routing Algorithm Based on Distributed Information," Computer Networks and ISDN Systems, Vol. 16, No. 5, pp. 367-382.]] Google ScholarDigital Library
- GARC-89b.l.J. Garcia-Luna-Aceves, 1989: "A Unified Approach for Loop-Free Routing Using Link States or Distance Vectors," ACM Computer Communication Review, Vol. 19, No. 4, pp. 212-223.]] Google ScholarDigital Library
- HEDR-88.C. Hedrick, 1988: "Routing Information Protocol," RFC 1058, Network Information Center, SRI International, Menlo Park, CA 94025 (June).]] Google ScholarDigital Library
- HIND-82.R. Hinden and A. Sheltzer, 1982: "DARPA Internet Gateway," RFC 823, Network Information Center, SRI International, Menlo Park, CA 94025, (September).]] Google ScholarDigital Library
- ISO-89.International Standards Organization, 1989: "Intra-Domain IS-IS Routing Protocol," ISO/IEC JTC1/SC6 WG2 N323, (September).]]Google Scholar
- JAFF-82.J.M. Jaffe and F.M. Moss, 1982: '% Responsive Routing Algorithm for Computer Networks," IEEE Transactions on Communica. tions, Vol. COM-30, No. 7, pp. 1758-1762.]]Google Scholar
- JAFF-86.J.M. laffe, A.E. Baratz, and A. Segall, 1986: "Subtle Design Issues in the Implementation of Distributed, Dynamic Routing Algorithms," Computer Networks and ISDN Systems, Vol. 12, No. 3, pp. 147-158.]] Google ScholarDigital Library
- LOUG-89.K. Lougheed and Y. Rekhter, "A Border Gateway Protocol," 1989: RFC 1105, SRi International, Menlo Park, CA 94025 (June).]]Google Scholar
- MERL-79.P.M. Merlin and A. Segall, 1979: "A Failsafe Distributed Routing Protocol," IEEE Transactions on Communication, Vol. COM-27, No. 9, pp. 1280-1288.]]Google Scholar
- MCQU-74.J. McQuinan, 1974: "Adaptive Routing Algorithms for Distributed Computer Networks," BBN Rep. 2831, Bolt Beranek and Newman Inc., Cambridge MA (May).]]Google Scholar
- MCQU-80.J. McQuillan, et al., 1980: "The New Routing Algorithm for the ARPANET," IEEE Transactions on Communications, Vol. COM-28, (May).]]Google Scholar
- MILL-83.D. Mills, 1983: "DCN Local-Network Protocols,'' RFC 891, Network Information Center, SKI International, Menlo Park, CA 94025 (December).]] Google ScholarDigital Library
- MILL-84.D. Mills, 1983: "Exterior Gateway Protocol Formal Specification," RFC 904, Network Information Center, SKI International, Menlo Park, CA 94025, (December).]] Google ScholarDigital Library
- NAYL-75.W.E. Naylor 1975: "A Loop-Free Adaptive Routing Algorithm for Packet Switched Networks," Proceedings of the Fourth Data Commumcations Symposium, Quebec City, Canada, pp. 7.9-7.15 (October).]]Google Scholar
- SCHW-86.M. Schwartz, 1986: Telecommunication Networks: Protocols, Modeling and Analysis, Chapter 6, Menlo Park CA: Addison-Wesley Publishing Co.]] Google ScholarDigital Library
- SHIN-87.K.G. Shin and M. Chert, 1987: "Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping," IEEE Transactions on Computers, Vol. COMP-36, No. 2, pp. 129-137.]] Google ScholarDigital Library
- STER-80.T.E. Stem, 1980: "An Improved Routing Algorithm for Distributed Computer Networks," IEEE International Symposium on Circuits and Systems, Workshop on Large- Scale Networks and Systems, Houston, Texas (April).]]Google Scholar
- ZAUM-91.W.T. Zaumen, 1991: "Simulations in Drama," Network Information System Center, SKI International, Menlo Park, CA 94025 (January).]]Google Scholar
Index Terms
- Dynamics of distributed shortest-path routing algorithms
Recommendations
Asymptotic optimality of shortest path routing algorithms
Many communication networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates ...
Complexity of inverse shortest path routing
INOC'11: Proceedings of the 5th international conference on Network optimizationThe inverse shortest path routing problem is to decide if a set of tentative routing patterns is simultaneously realizable. A routing pattern is defined by its destination and two arc subsets of required shortest path arcs and prohibited non-shortest ...
Comments