Self-Stabilizing Neighborhood Synchronizer in Tree Networks

Austin, Texas May 31-June 04

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICDCS.1999.776551

19th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Colette Johnen Articles by Sebastien Tixeuil Articles by Luc O. Alima Articles by Ajoy K. Datta

	ASCII Text	x
	Colette Johnen, Sebastien Tixeuil, Luc O. Alima, Ajoy K. Datta, "Self-Stabilizing Neighborhood Synchronizer in Tree Networks," Distributed Computing Systems, International Conference on, pp. 0487, 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99), 1999.

	BibTex	x
	@article{ 10.1109/ICDCS.1999.776551, author = {Colette Johnen and Sebastien Tixeuil and Luc O. Alima and Ajoy K. Datta}, title = {Self-Stabilizing Neighborhood Synchronizer in Tree Networks}, journal ={Distributed Computing Systems, International Conference on}, volume = {0}, year = {1999}, isbn = {0-7695-0222-9}, pages = {0487}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.1999.776551}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Distributed Computing Systems, International Conference on TI - Self-Stabilizing Neighborhood Synchronizer in Tree Networks SN - 0-7695-0222-9 SP EP A1 - Colette Johnen, A1 - Sebastien Tixeuil, A1 - Luc O. Alima, A1 - Ajoy K. Datta, PY - 1999 KW - Broadcasting KW - distributed algorithms KW - self-stabilization KW - spanning tree KW - synchronizer. VL - 0 JA - Distributed Computing Systems, International Conference on ER -

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.

Index Terms:

Broadcasting, distributed algorithms, self-stabilization, spanning tree, synchronizer.

Citation:

Colette Johnen, Sebastien Tixeuil, Luc O. Alima, Ajoy K. Datta, "Self-Stabilizing Neighborhood Synchronizer in Tree Networks," icdcs, pp.0487, 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.