MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Stepwise assertional design of distance--vector routing algorithms (1992)

Download:
Download as a PDF | Download as a PS
by Cengiz Alaettinoglu, A. Udaya Shankar
In IFIP Protocol Specification Testing and Verification '92
ftp://ftp.isi.edu/pub/cengiz/publications/MISC:ExBF.ps.gz
Add To MetaCart

Abstract:

There are many kinds of distance--vector algorithms for adaptive routing in wide--area computer networks, ranging from the classical Distributed Bellman--Ford to several recent algorithms that have better performance. However, these algorithms have very complicated behaviors and their analyses in the literature has been incomplete (and operational). In this paper, we present a stepwise assertional design of a recently proposed distance--vector algorithm. Our design starts with the Distributed Bellman--Ford and goes through two intermediate algorithms. The properties established for each algorithm hold for the succeeding algorithms. The algorithms analyzed

Citations

263 An axiomatic proof technique for parallel programs – Owicki, Gries - 1976
218 Termination detection for diffusing computations – Dijkstra, Scholten - 1980
75 A failsafe distributed routing protocol – Merlin, Segall - 1979
55 A responsive distributed routing algorithm for computer networks – Jaffe, Moss - 1982
50 An introduction to assertional reasoning for concurrent systems – Shankar - 1999
33 A Review of the Development and Performance of the ARPANET Routing Algorithm – McQuillan, Falk, et al. - 1978
30 Another Adaptive Distributed Shortest Path Algorithm – Humblet - 1991
28 Performance analysis of distributed routing strategies free of ping-pong-type looping – Shin, Chen - 1987
27 A New Responsive Distributed Shortest-Path Routing Algorithm – Rajagopalan, Faiman - 1989
18 Routing Information Protocol, Request For Comments (RFC – Hedrick - 1988
18 An introduction to IGRP – Hedrick - 1991
15 A relational notation for state transition systems – Lam, Shankar - 1990
11 Garcia-Luna-Aceves. A loop-free Bellman-Ford routing protocol without bouncing effect – Cheng, Riley, et al. - 1989
9 Garcia-Luna-Aceves. A loop-free Bellman-Ford routing protocol without bouncing e ect – Cheng, Riley, et al. - 1989
8 Adequate Proof Principles for Invariance and – Manna, Pnueli - 1984
7 A unified approach to loop free routing using distance vectors or link states – Garcia-Luna-Aceves - 1989
5 Inter-domain routing protocol (idrp). Available from the author – Rekhter - 1992
5 Advances in Verifiable Fail-safe Routing Procedures – Segall - 1981
1 Parallel Program Design, chapter 2,3 and 8 – Chandy, Misra - 1988
1 Border gateway protocol (bgp). Request for Comment RFC-1105, Network Information – Lougheed, Rekhter - 1989