Assigning distinct identities to sites on an anonymous distributed system

A distributed algorithm that assigns distinct and ordered identities to the sites of a connect anonymous distributed system is presented. The basis for this algorithm is the sequential distributed traversal scheme, the sequential aspect of which ensures that all sites are systematically visited in m...

Full description

Saved in:
Bibliographic Details
Published inWorkshop on the Future Trends of Distributed Computing Systems in the 1990s: Proceedings pp. 82 - 86
Main Authors Helary, J.-M., Raynal, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Algorithm design and analysis
Clocks
Concurrency control
Control systems
Distributed algorithms
Distributed control
Identity management systems
Routing
Synchronization
System recovery
Online AccessGet full text
ISBN9780818608971
0818608978
DOI10.1109/FTDCS.1988.26683

Cover

More Information
Summary:A distributed algorithm that assigns distinct and ordered identities to the sites of a connect anonymous distributed system is presented. The basis for this algorithm is the sequential distributed traversal scheme, the sequential aspect of which ensures that all sites are systematically visited in mutual exclusion. Such an algorithm allows the definition of sites to be independent of particular of initial values (as far as identities are concerned).< >
ISBN:9780818608971
0818608978
DOI:10.1109/FTDCS.1988.26683