A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time

Providence, Rhode Island, USA May 19-May 22

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2003.1203595

23rd International Conference on Dist ...

	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 Wayne Goddard Articles by Stephen T. Hedetniemi Articles by David P. Jacobs Articles by Pradip K. Srimani

	ASCII Text	x
	Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani, "A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time," Distributed Computing Systems Workshops, International Conference on, pp. 461, 23rd International Conference on Distributed Computing Systems Workshops (ICDCSW'03), 2003.

	BibTex	x
	@article{ 10.1109/ICDCSW.2003.1203595, author = {Wayne Goddard and Stephen T. Hedetniemi and David P. Jacobs and Pradip K. Srimani}, title = {A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time}, journal ={Distributed Computing Systems Workshops, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1921-0}, pages = {461}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2003.1203595}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Distributed Computing Systems Workshops, International Conference on TI - A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time SN - 0-7695-1921-0 SP EP A1 - Wayne Goddard, A1 - Stephen T. Hedetniemi, A1 - David P. Jacobs, A1 - Pradip K. Srimani, PY - 2003 KW - null VL - 0 JA - Distributed Computing Systems Workshops, International Conference on ER -

Wayne Goddard, Clemson University

Stephen T. Hedetniemi, Clemson University

David P. Jacobs, Clemson University

Pradip K. Srimani, Clemson University

We present a self-stabilizing algorithm for .nding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in 0(m) moves under an unfair central demon independent of the b-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].

Citation:

Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani, "A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time," icdcsw, pp.461, 23rd International Conference on Distributed Computing Systems Workshops (ICDCSW'03), 2003

Peer Review Notice | Give Us Feedback

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