Abstract
We present a local distributed algorithm for a general Majority Vote problem: different and time-variable voting powers and vote splits, arbitrary and dynamic interconnection topologies and link delays, and any fixed majority threshold. The algorithm combines a novel, efficient anytime spanning forest algorithm, which may also have applications elsewhere, with a “charge fusion” algorithm that roots trees at nodes with excess “charge” (derived from a node’s voting power and vote split), and subsequently transfers charges along tree links to oppositely charged roots for fusion. At any instant, every node has an ad hoc belief regarding the outcome. Once all changes have ceased, the correct majority decision is reached by all nodes, within a time that in many cases is independent of the graph size. The algorithm’s correctness and salient properties have been proved, and experiments with up to a million nodes provide further validation and actual numbers. To our knowledge, this is the first locality-sensitive solution to the Majority Vote problem for arbitrary, dynamically changing communication graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comp. 21, 193–201 (1992)
Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. In: Proc. 21st ACM STOC (1989)
Kutten, S., Peleg, D.: Fault-local distributed mending. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995)
Kutten, S., Patt-Shamir, B.: Time-adaptive self-stabilization. In: Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 149–158 (1997)
Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. Technical Report EE1445 (CCIT497), Technion (2004)
Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In: Proc. of the IEEE Conference on Data Mining, ICDM (2003)
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
Jaffe, J., Moss, F.: A responsive routing algorithm for computer networks. IEEE Transactions on Communications, 1758–1762 (1982)
Garcia-Luna-Aceves, J.: A distributed, loop-free, shortest-path routing algorithm. In: Proceedings of IEEE INFOCOM, pp. 1125–1137 (1988)
Kaashoek, F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Intanagonwiwat, C., Estrin, R.G., Directed, D.: diffusion: A scalable and robust communication paradigm for sensor networks. In: Proceedings of the Sixth Annual Intl. Conf. on Mobile Computing and Networking (2000)
Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proceedings of Foundations of Computer Science, FOCS (2003)
Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report, Stanford University, DB group (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Birk, Y., Liss, L., Schuster, A., Wolff, R. (2004). A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive