Show simple item record

Stepwise Assertional Design of Distance-Vector Routing Algorithms

dc.contributor.authorAlaettinoglu, Cengizen_US
dc.contributor.authorShankar, A. Udayaen_US
dc.date.accessioned2004-05-31T22:22:12Z
dc.date.available2004-05-31T22:22:12Z
dc.date.created1993-08en_US
dc.date.issued1998-10-15en_US
dc.identifier.urihttp://hdl.handle.net/1903/567
dc.description.abstractThere 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.extent378546 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-2869.1en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-92-39.1en_US
dc.titleStepwise Assertional Design of Distance-Vector Routing Algorithmsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record