Dynamics of distributed shortest-path routing algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dynamics of distributed shortest-path routing algorithms

Full text

Pdf (1.08 MB)

Source

Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the conference on Communications architecture & protocols table of contents

Zurich, Switzerland

Pages: 31 - 42

Year of Publication: 1991

ISBN:0-89791-444-9

Also published in ...

Authors

William T. Zaumen	SRI International, 333 Ravenswood Avenue, Menlo Park, California
J. J. Garcia-Luna Aceves	SRI International, 333 Ravenswood Avenue, Menlo Park, California

Sponsor

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 81, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/115992.115997 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BERT-87	Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	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.
	CHEN-89	C. Cheng , R. Riley , S. P. R. Kumar , J. J. Garcia-Luna-Aceves, A loop-free extended Bellman-Ford routing protocol without bouncing effect, ACM SIGCOMM Computer Communication Review, v.19 n.4, p.224-236, Sep. 1989
	COLT-89	R. Coltun, 1989: "OSPF: An internet Routing Protocol," ConneXions, Vol. 3, No. 8, pp. 19-25.
	DIJK-59	E.W. Dijkstra, 1959: "A Note on Two Problems in Connection with Graphs," Numer. Math., Vol. 1, pp. 269-271.
	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.
	FORD-62	L.R. Ford and D.R. Fulkerson, 1962: Flows in Networks. Princeton, NJ: Princeton University Press.
	GARC-89a	J. J. Garcia-Luna-Aceves, A minimum-hop routing algorithm bases on distributed information, Computer Networks and ISDN Systems, v.16 n.5, p.367-382, May 1989 [doi>10.1016/0169-7552(89)90011-1]
	GARC-89b	J. J. Garcia-Luna-Aceves, A unified approach to loop-free routing using distance vectors or link states, ACM SIGCOMM Computer Communication Review, v.19 n.4, p.212-223, Sep. 1989
	HEDR-88	C. Hedrick, 1988: "Routing Information Protocol," RFC 1058, Network Information Center, SRI International, Menlo Park, CA 94025 (June).
	HIND-82	R. Hinden and A. Sheltzer, 1982: "DARPA Internet Gateway," RFC 823, Network Information Center, SRI International, Menlo Park, CA 94025, (September).
	ISO-89	International Standards Organization, 1989: "Intra-Domain IS-IS Routing Protocol," ISO/IEC JTC1/SC6 WG2 N323, (September).
	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.
	JAFF-86	J. M. Jaffe , Alan E. Baratz , Adrain Segall, Subtle design issues in the implementation of distributed, dynamic routing algorithms, Computer Networks and ISDN Systems, v.12 n.3, p.147-158, March 1986 [doi>10.1016/0169-7552(86)90053-X]
	LOUG-89	K. Lougheed and Y. Rekhter, "A Border Gateway Protocol," 1989: RFC 1105, SRi International, Menlo Park, CA 94025 (June).
	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.
	MCQU-74	J. McQuinan, 1974: "Adaptive Routing Algorithms for Distributed Computer Networks," BBN Rep. 2831, Bolt Beranek and Newman Inc., Cambridge MA (May).
	MCQU-80	J. McQuillan, et al., 1980: "The New Routing Algorithm for the ARPANET," IEEE Transactions on Communications, Vol. COM-28, (May).
	MILL-83	D. Mills, 1983: "DCN Local-Network Protocols,'' RFC 891, Network Information Center, SKI International, Menlo Park, CA 94025 (December).
	MILL-84	D. Mills, 1983: "Exterior Gateway Protocol Formal Specification," RFC 904, Network Information Center, SKI International, Menlo Park, CA 94025, (December).
	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).
	SCHW-86	Mischa Schwartz, Telecommunication networks: protocols, modeling and analysis, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	SHIN-87	K. G. Shin , M.-S. Chen, Performance analysis of distributed routing strategies free of ping-pong type looping, IEEE Transactions on Computers, v.36 n.2, p.129-137, Feb. 1987 [doi>10.1109/TC.1987.1676875]
	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).
	ZAUM-91	W.T. Zaumen, 1991: "Simulations in Drama," Network Information System Center, SKI International, Menlo Park, CA 94025 (January).

CITED BY 11

	Ellen W. Zegura , Kenneth L. Calvert , Michael J. Donahoo, A quantitative comparison of graph-based models for Internet topology, IEEE/ACM Transactions on Networking (TON), v.5 n.6, p.770-783, Dec. 1997
	A. Udaya Shankar , Cengiz Alaettinoğlu , Ibrahim Matta , Klaudia Dussa-Zieger, Performance comparison of routing protocols using MaRS: distance-vector versus link-state, ACM SIGMETRICS Performance Evaluation Review, v.20 n.1, p.181-192, June 1992
	J. J. Garcia-Lunes-Aceves, Loop-free routing using diffusing computations, IEEE/ACM Transactions on Networking (TON), v.1 n.1, p.130-141, Feb. 1993
	Craig Labovitz , Abha Ahuja , Abhijit Bose , Farnam Jahanian, Delayed Internet routing convergence, IEEE/ACM Transactions on Networking (TON), v.9 n.3, p.293-306, June 2001
	Anindo Banerjea, Fault recovery for guaranteed performance communications connections, IEEE/ACM Transactions on Networking (TON), v.7 n.5, p.653-668, Oct. 1999
	Anindya Basu , Jon Riecke, Stability issues in OSPF routing, ACM SIGCOMM Computer Communication Review, v.31 n.4, p.225-236, October 2001
	Craig Labovitz , Abha Ahuja , Abhijit Bose , Farnam Jahanian, Delayed Internet routing convergence, ACM SIGCOMM Computer Communication Review, v.30 n.4, p.175-187, October 2000
	Jochen Behrens , J. J. Garcia-Luna-Aceves, Distributed, scalable routing based on link-state vectors, ACM SIGCOMM Computer Communication Review, v.24 n.4, p.136-147, Oct. 1994
	Brad Karp , H. T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, Proceedings of the 6th annual international conference on Mobile computing and networking, p.243-254, August 06-11, 2000, Boston, Massachusetts, United States
	Jyh-haw Yeh , Wei Zhang , Wen-chen Hu , Chung-wei Lee, Design and simulation of a supplemental protocol for BGP, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.49 n.2, p.172-200, 5 October 2005
	A. Udaya Shakar , Cengiz Alaettinoğlu , Klaudia Dussa-Zieger , Ibrahim Matta, Performance comparison of routing protocols under dynamic and static file transfer connections, ACM SIGCOMM Computer Communication Review, v.22 n.5, p.39-52, Oct. 1992