By Topic

Self-stabilizing neighborhood synchronizer in tree networks

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
$31 $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

4 Author(s)
Johnen, C. ; Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France ; Alima, L.O. ; Datta, A.K. ; Tixeuil, S.

Proposes a self-stabilizing synchronization technique, called the Neighborhood Synchronizer (𝒩𝒮), that synchronizes nodes with their neighbors in a tree network. The 𝒩𝒮 scheme has an extremely small memory requirement-only one bit per processor. Algorithm 𝒩𝒮 is inherently self-stabilizing. We apply our synchronizer to design a broadcasting algorithm ℬ𝒜 in a tree network. Algorithm ℬ𝒜 is also inherently self-stabilizing and needs only 2h+2m-1 rounds to broadcast m messages, where h is the height of the tree

Published in:

Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on

Date of Conference: