Abstract
In this article, we explore the topic of extending aggregate computation in distributed networks with self-stabilizing properties to withstand network dynamics. Existing research suggests that fast gossiping algorithms, based on the properties of order statistics applied to families of exponential random variables, are a viable solution for computing functions of the values stored in the network. We focus on the specific case in which network changes and failures occur in batches with a minimum frequency in the order of the diameter of the network. Our contribution consists in two self-stabilizing mechanisms, allowing fast gossiping algorithms to be applicable to dynamic networks with minor increase in resources usage. The resulting algorithms can be deployed in networks exhibiting churn, node stop-failures and resets, and random topological changes. The theoretical results are verified with simulations on synthetic data, showcasing desirable properties for large-scale network designers such as scalability, lack of single points of failure, and anonymity.
- Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. 2007. The computational power of population protocols. Distributed Computing 20, 4 (2007), 279--304.Google Scholar
Digital Library
- Dana Angluin, James Aspnes, Michael J. Fischer, and Hong Jiang. 2008. Self-stabilizing population protocols. ACM Transactions on Autonomous and Adaptive Systems 3, 4 (2008), 13. Google Scholar
Digital Library
- Gheorghe Antonoiu and Pradip K. Srimani. 1996. A self-stabilizing leader election algorithm for tree graphs. Journal of Parallel and Distributed Computing 34, 2 (1996), 227--232. Google Scholar
Digital Library
- Roger Arditi and Lev R. Ginzburg. 1989. Coupling in predator-prey dynamics: Ratio-dependence. Journal of Theoretical Biology 139, 3 (1989), 311--326. DOI:http://dx.doi.org/10.1016/S0022-5193(89)80211-5Google Scholar
Cross Ref
- Jacob Beal, Stefan Dulman, Mirko Viroli, Nikolaus Correll, and Kyle Usbeck. 2013. Organizing the aggregate. Formal and Practical Aspects of Domain-Specific Languages: Recent Developments (2013), 436.Google Scholar
- Nicola Bicocchi, Marco Mamei, and Franco Zambonelli. 2010. Handling dynamics in diffusive aggregation schemes: An evaporative approach. Future Generation Computer Systems 26, 6 (2010), 877--889. Google Scholar
Digital Library
- Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. 2005. Gossip algorithms: Design, analysis and applications. In Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Vol. 3. IEEE, 1653--1664.Google Scholar
Cross Ref
- Bastien Chopard and Michel Droz. 1998. Cellular Automata Modeling of Physical Systems. Vol. 24. Cambridge University Press, Cambridge.Google Scholar
- Edsger W. Dijkstra. 1982. Self-stabilization in spite of distributed control. In Selected Writings on Computing: A Personal Perspective. Springer, 41--46.Google Scholar
- Shlomi Dolev. 2000. Self-Stabilization. MIT Press. Google Scholar
Digital Library
- Hector Garcia-Molina. 1982. Elections in a distributed computing system. IEEE Transactions on Computers 100, 1 (1982), 48--59. Google Scholar
Digital Library
- Seth Copen Goldstein, Jason D. Campbell, and Todd C. Mowry. 2005. Programmable matter. Computer 38, 6 (2005), 99--101. Google Scholar
Digital Library
- Venkat Iyer, Andrei Pruteanu, and Stefan Dulman. 2011. Netdetect: Neighborhood discovery in wireless networks using adaptive beacons. In 2011 5th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO’01),. IEEE, 31--40. Google Scholar
Digital Library
- Márk Jelasity and Ozalp Babaoglu. 2006. T-Man: Gossip-based overlay topology management. In Engineering Self-Organising Systems. Springer, 1--15. Google Scholar
Digital Library
- Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. 2005. Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems 23, 3 (2005), 219--252. Google Scholar
Digital Library
- Gian Paolo Jesi, David Hales, and Maarten van Steen. 2007. Identifying malicious peers before it’s too late: A decentralized secure peer sampling service. In 1st International Conference on Self-Adaptive and Self-Organizing Systems (SASO’07). 237--246. DOI:http://dx.doi.org/10.1109/SASO.2007.32 Google Scholar
Digital Library
- David Kempe, Alin Dobra, and Johannes Gehrke. 2003. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science.. IEEE, 482--491. Google Scholar
Digital Library
- Jeffrey O. Kephart and David M. Chess. 2003. The vision of autonomic computing. Computer 36, 1 (2003), 41--50. Google Scholar
Digital Library
- Yakup Koç, Martijn Warnier, Robert E. Kooij, and Frances M. T. Brazier. 2013. A robustness metric for cascading failures by targeted attacks in power networks. In Proceedings of the 10th IEEE International Conference on Networking, Sensing and Control (ICNSC’13), IEEE, 48--53.Google Scholar
- Dionysios Kostoulas, Dimitrios Psaltoulis, Indranil Gupta, Kenneth P. Birman, and Alan J. Demers. 2007. Active and passive techniques for group size estimation in large-scale and dynamic distributed systems. Journal of Systems and Softwware 80, 10 (Oct. 2007), 1639--1658. DOI:http://dx.doi.org/10.1016/j.jss.2007.01.014 Google Scholar
Digital Library
- Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. 2002. TAG: A tiny aggregation service for ad-hoc sensor networks. SIGOPS Operating Systems Review 36, SI (Dec. 2002), 131--146. DOI:http://dx.doi.org/10.1145/844128.844142 Google Scholar
Digital Library
- Navneet Malpani, Jennifer L. Welch, and Nitin Vaidya. 2000. Leader election algorithms for mobile ad hoc networks. In Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM, 96--103. Google Scholar
Digital Library
- Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, and Ayalvadi Ganesh. 2006. Peer counting and sampling in overlay networks: Random walk methods. In Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC’06). ACM, New York, NY, 123--132. DOI:http://dx.doi.org/10.1145/1146381.1146402 Google Scholar
Digital Library
- Alain Mayer, Yoram Ofek, Rafail Ostrovsky, and Moti Yung. 1992. Self-stabilizing symmetry breaking in constant-space. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing. ACM, 667--678. Google Scholar
Digital Library
- Damon Mosk-Aoyama and Devavrat Shah. 2008. Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory 54, 7 (2008), 2997--3007. Google Scholar
Digital Library
- Suman Nath, Phillip B. Gibbons, Srinivasan Seshan, and Zachary R. Anderson. 2004. Synopsis diffusion for robust aggregation in sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems. ACM, 250--262. Google Scholar
Digital Library
- Linda Northrop, Peter Feiler, Richard P. Gabriel, John Goodenough, Rick Linger, Tom Longstaff, Rick Kazman, Mark Klein, Douglas Schmidt, Kevin Sullivan, and others. 2006. Ultra-large-scale systems—The software challenge of the future. (2006).Google Scholar
- Andrei Pruteanu and Stefan Dulman. 2012. LossEstimate: Distributed failure estimation in wireless networks. Journal of Systems and Software 85, 12 (2012), 2785--2795. Google Scholar
Digital Library
- Hiroki Sayama. 2009. Swarm chemistry. Artificial Life 15, 1 (2009), 105--114. Google Scholar
Digital Library
- Devavrat Shah. 2009. Gossip Algorithms. Now Publishers Inc.Google Scholar
- Robbert Van Renesse, Kenneth P. Birman, and Werner Vogels. 2003. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems 21, 2 (2003), 164--206. Google Scholar
Digital Library
- Geoffrey Werner-Allen, Geetika Tewari, Ankit Patel, Matt Welsh, and Radhika Nagpal. 2005. Firefly-inspired sensor network synchronicity with realistic radio effects. In Proceedings of the 3rd International Conference on Embedded Networked Sensor Systems. ACM, 142--153. Google Scholar
Digital Library
- Stephen Wolfram. 2002. A New Kind of Science. Vol. 5. Wolfram Media Champaign.Google Scholar
Digital Library
Index Terms
Self-Stabilized Fast Gossiping Algorithms
Recommendations
Heterogeneous gossip
Middleware '09: Proceedings of the 10th ACM/IFIP/USENIX International Conference on MiddlewareGossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale ...
Heterogeneous gossip
Middleware'09: Proceedings of the ACM/IFIP/USENIX 10th international conference on MiddlewareGossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale ...
NAT-resilient Gossip Peer Sampling
ICDCS '09: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing SystemsGossip peer sampling protocols now represent a solid basis to build and maintain peer to peer (p2p) overlay networks. They provide peers with a random sample of the network and maintain connectivity in highly dynamic settings. They rely on the ...






Comments