Derivation of a Distributed Algorithm for Finding Paths in Directed Networks
Collections
Author
McCurley, E. Robert
Schneider, Fred B.
Abstract
A distributed algorithm is developed that can be used to compute the topology of a network, given that each site starts with information about sites it is adjacent to, the network is strongly connected, and communication channels are uni-directional. The program is derived and proved correct using assertional reasoning.
Date Issued
1983-12
Publisher
Cornell University
Keywords
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-586
Type
technical report