19th IEEE International Conference on Distributed Computing Systems (ICDCS'99) (1999)
May 31, 1999 to June 4, 1999
Colette Johnen , Universite de Paris-Sud
Sebastien Tixeuil , Universite de Paris-Sud
Luc O. Alima , Universite Catholique de Louvain
Ajoy K. Datta , University of Nevada at Las Vegas
We propose a self-stabilizing synchronization technique, called the "Neighborhood Synchronizer" (NS), that synchronizes nodes with their neighbors in a tree network. The NS scheme has extremely small memory requirement---only 1 bit per processor. Algorithm NS is inherently self-stabilizing. We apply our synchronizer to design a broadcasting algorithm (BA) in tree networks. Algorithm BA is also inherently self-stabilizing and needs only 2h+2m-1 rounds to broadcast m messages, where h is the height of the tree.
Broadcasting, distributed algorithms, self-stabilization, spanning tree, synchronizer.
A. K. Datta, L. O. Alima, S. Tixeuil and C. Johnen, "Self-Stabilizing Neighborhood Synchronizer in Tree Networks," 1999 ICDCS Workshop on Electronic Commerce and Web-Based Applications(ICDCS), Austin, Texas, 1999, pp. 0487.