| dc.contributor.author | Alaettinoglu, Cengiz | en_US |
| dc.contributor.author | Shankar, A. Udaya | en_US |
| dc.date.accessioned | 2004-05-31T22:22:12Z | |
| dc.date.available | 2004-05-31T22:22:12Z | |
| dc.date.created | 1993-08 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1903/567 | |
| dc.description.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
here are representative of various internetwork routing protocols.
(Also cross-referenced as UMIACS-TR-92-39.1) | en_US |
| dc.format.extent | 378546 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-2869.1 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-92-39.1 | en_US |
| dc.title | Stepwise Assertional Design of Distance-Vector Routing Algorithms | en_US |
| dc.type | Technical Report | en_US |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
