By Topic

An efficient distributed orientation algorithm (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

An algorithm for constructing and maintaining full information on the structure of a communication network is presented. The algorithm uses distributed computation. It can be used as an information-gathering step, to be followed by special-purpose algorithms which are to be executed within the nodes, without any additional communication. The load of the lines of the network is measured and shown to be better than any known algorithm for determining connectivity, suggesting shortest path, routing, etc., when the number of topological changes is big enough. It is shown that the network will recover in finite time from a finite number of topological changes in the network. Other, more powerful, recovery criteria are also given.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 4 )