|Title:||An Efficient Distributed Orientation Algorithm
|Abstract:||An algorithm for constructing and maintaining full information on the structure of a corrmunication network is presented. The algorithm uses distributed computaiton. The load on the lines of the network is measured. It is shown that the network will recover in finite time from a finite number of topological changes in the network. This means that every two nodes in the same 'final' connected component in the network ultimately maintain the same 'picture' of the network. Another, more powerful, validity criterion is also given.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1980/CS/CS0177), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1980
To the main CS technical reports page
Computer science department, Technion