Abstract
Self-stabilizing systems tolerate transient faults by always returning to a legitimate system state within a finite time. This goal is challenged by several system features such as arbitrary system states after faults, various process execution models, and constrained process communication means. This work designs self-stabilizing distributed algorithms from the perspective of game theory, achieving an intended system goal through private goals of processes. We propose a generic game design for identifying a maximal independent set (MIS) or a maximal weighted independent set (MWIS) among all processes in a distributed system. From the generic game several specific games can be defined which differ in whether and how neighboring players influence each other. Turning the game designs into self-stabilizing algorithms, we obtain the first algorithms for the MWIS problem and also the first self-stabilizing MIS algorithm that considers node degree (including an analysis of its performance ratio). We also show how to handle simultaneous moves of processes in some process execution models. Simulation results indicate that, for various representative network topologies, the new algorithm outperforms existing methods in terms of MIS size and convergence rate. For the MWIS problem, the new algorithms performed only slightly worse than centralized greedy counterparts.
- Noga Alon, László Babai, and Alon Itai. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algor. 7, 4 (Dec. 1986), 567--583. Google Scholar
Digital Library
- Albert-László Barabási and Réka Albert. 1999. Emergence of scaling in random networks. Science 286 (Oct. 1999), 509--512.Google Scholar
- Stefano Basagni. 2001. Finding a maximal weighted independent set in wireless networks. Telecommun. Syst. 18 (2001), 155--168. Google Scholar
Digital Library
- Vittorio Bilò, Angelo Fanelli, Michele Flammini, and Luca Moscardelli. 2011. Graphical congestion games. Algorithmica 61 (2011), 274--297. Google Scholar
Digital Library
- B. Bollobás. 1998. Modern Graph Theory. Springer-Verlag, New York.Google Scholar
- Brent N. Clark, Charles J. Colbourn, and David S. Johnson. 1990. Unit disk graphs. Discr. Math. 86, 1--3 (Dec. 1990), 165--177. Google Scholar
Digital Library
- Johanne Cohen, Anurag Dasgupta, Sukumar Ghosh, and Sébastien Tixeuil. 2008. An exercise in selfish stabilization. ACM Trans. Auton. Adapt. Syst. 3, 4 (Nov. 2008). Google Scholar
Digital Library
- E. W. Dijkstra. 1974. Self-stabilizing systems in spite of distributed control. Comm. ACM 17, 11 (Nov. 1974), 643--644. Google Scholar
Digital Library
- E. W. Dijkstra. 1975. Guarded commands, nondeterminacy, and formal derivation of programs. Commun. ACM 18, 8 (Aug. 1975), 453--457. Google Scholar
Digital Library
- P. Erdös and A. Rényi. 1959. On random graphs I. Publ. Math. Debr. 6 (1959), 290--297.Google Scholar
- M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York. Google Scholar
Digital Library
- Wayne Goddard, Stephen T. Hededtniemi, David P. Jacobs, Pradip K. Srimani, and Zhenyu Xu. 2008. Self-stabilizing graph protocols. Parallel Process. Lett. 18, 1 (2008), 189--199.Google Scholar
Cross Ref
- Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, and Pradip K. Srimani. 2003. A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph. In Proc. 17th Int’l Parallel and Distributed Processing Symp. Google Scholar
Digital Library
- Mohamed G. Gouda. 2001. The theory of weak stabilization. In Lecture Notes in Computer Science 2194, A. K. Datta and T. Herman (Eds.). Springer-Verlag, 114--123. Google Scholar
Digital Library
- M. G. Gouda and H. B. Acharya. 2011. Nash equilibria in stabilizing systems. Theor. Comput. Sci. 412 (2011), 4325--4335.Google Scholar
Cross Ref
- Daniel Grosu and Anthony T. Chronopoulos. 2004. Algorithmic mechanism design for load balancing in distributed systems. IEEE Trans. Syst. Man. Cybernet. B 34, 1 (Feb. 2004), 77--84. Google Scholar
Digital Library
- Nabil Guellati and Hamamache Kheddouci. 2010. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70 (2010), 406--415. Google Scholar
Digital Library
- M. M. Halldórsson and J. Radhakrishnan. 1997. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18, 1 (1997), 145--163.Google Scholar
Digital Library
- Joseph Y. Halpern. 2003. A computer scientist looks at game theory. Games Econom. Behav. 45 (2003), 114--131.Google Scholar
Cross Ref
- S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani. 2003. Self-stabilizing algorithms for minimal dominating sets and maximal independent sets. Comput. Math. Appl. 46, 5--6 (Sept. 2003), 805--811.Google Scholar
Cross Ref
- Stephen T. Hedetniemi, David P. Jacobs, and K. E. Kennedy. 2013. Linear-time self-stabilizing algorithms for disjoint independent sets. Comput. J. 56, 11 (2013), 1381--1387.Google Scholar
Cross Ref
- R. Hekmat and P. Van Meighem. 2003. Degree distribution and hopcount in wireless ad-hoc networks. In Proc. 11th IEEE Int’l Conf. on Networks. 603--609.Google Scholar
- M. Ikeda, S. Kamei, and H. Kakugawa. 2002. A space-optimal self-stabilizing algorithm for the maximal independent set problem. In Proc. 3rd Int’l Conf. on Parallel and Distributed Computing, Applications and Technologies.Google Scholar
- Lujun Jia, Rajmohan Rajaraman, and Torsten Suel. 2002. An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15, 4 (2002), 193--205. Google Scholar
Digital Library
- Hirotsugu Kakugawa and Toshimitsu Masuzawa. 2006. A self-stabilizing minimal dominating set algorithm with safe convergence. In Proc. Int’l Parallel and Distributed Processing Symposium. Google Scholar
Digital Library
- S. Kamei and H. Kakugawa. 2003. A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree network. In Proc. 4th International Conference on Parallel and Distributed Computing, Applications and Technologies.Google Scholar
- S. Kamei and H. Kakugawa. 2005. A self-stabilizing approximation algorithm for the distributed minimum k-domination. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 5 (2005), 1109--1116. Google Scholar
Digital Library
- Richard M. Karp and Avi Wigderson. 1985. A fast parallel algorithm for the maximal independent set problem. J. ACM 32, 4 (Oct. 1985), 762--773. Google Scholar
Digital Library
- Michael Kearns, Siddharth Suri, and Nick Montfort. 2006. An experimental study of the coloring problem on human subject networks. Science 313 (Aug. 2006), 824--827.Google Scholar
- Micheal J. Kearns, Michael L. Littman, and Satinder P. Singh. 2001. Graphical models for game theory. In Proc. 17th Conf. in Uncertainty in Artificial Intelligence. 253--260. Google Scholar
Digital Library
- Jason R. Marden, Behrouz Touri, Ragavendran Gopalakrishnan, and J. Patrick O’Brien. 2015. Impact of information in a simple multiagent collaborative task. In Proc. IEEE Conference on Decision and Control. 4543--4548.Google Scholar
Cross Ref
- I. Milchtaich. 1996. Congestion games with player-specfic payoff functions. Games Econom. Behav. 13, 1 (1996), 111--124.Google Scholar
Cross Ref
- Dov Monderer and Lloyd S. Shapley. 1996. Potential games. Games Econom. Behav. 14 (1996), 124--143.Google Scholar
Cross Ref
- Andrea Montanari and Amin Saberi. 2010. The spread of innovations in social networks. Proc. Natl Acad. Sci. U.S.A. 107 (2010), 20196--20201.Google Scholar
Cross Ref
- Noam Nisan and Amir Ronen. 2001. Algorithmic mechanism design. Games Econom. Behav. 35 (2001), 166--196.Google Scholar
Cross Ref
- R. W. Rosenthal. 1973. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theor. 2, 1 (1973), 65--67.Google Scholar
Digital Library
- Shuichi Sakai, Mitsunori Togasaki, and Koichi Yamazaki. 2003. A note on greedy algorithms for the maximum weighted independent set problem. Discr. Appl. Math. 126 (2003), 313--322. Google Scholar
Digital Library
- Reinhard Selten and Myrna H. Wooders. 2001. Cyclic games: An introduction and some examples. Games Econ. Behav. 34 (2001), 138--152.Google Scholar
Cross Ref
- Z. Shi, W. Goddard, and S. T. Hedetniemi. 2004. An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inform. Process. Lett. 91, 2 (2004), 77--83. Google Scholar
Digital Library
- Sandeep K. Shukla, Daniel J. Rosenkrantz, and S. S. Ravi. 1995. Observations on self-stabilizing graph algorithms for anonymous networks. In Proc. 2nd Workshop on Self-Stabilizing Systems.Google Scholar
- R. E. Tarjan and A. E. Trojanowski. 1977. Finding a maximum independent set. SIAM J. Comput. 6, 3 (1977), 537--546.Google Scholar
Digital Library
- Cem Tekin, Mingyan Liu, Richard Southwell, Jianwei Huang, and Sahand H. A. Ahmad. 2012. Atomic congestion games on graphs and its applications in networking. IEEE/ACM Trans. Netw. 20, 5 (Oct. 2012), 1541--1552. Google Scholar
Digital Library
- Volker Turau. 2007. Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inform. Process. Lett. 103, 3 (2007), 88--93. Google Scholar
Digital Library
- Volker Turau. 2010. Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio. Parallel Process. Lett. 20, 2 (2010), 173--186.Google Scholar
Cross Ref
- Volker Turau and Bernd Hauck. 2011. A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2. Theor. Comput. Sci. 412, 40 (Sept. 2011), 5527--5540. Google Scholar
Digital Library
- Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of ‘small-world’ networks. Nature 393 (June 1998), 440--442.Google Scholar
- Z. Xu, S. T. Hedetniemi, W. Goddard, and P. K. Srimani. 2003. A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In Lecture Notes in Computer Science 2918. Springer-Verlag, 26--32.Google Scholar
- Li-Hsing Yen and Zong-Long Chen. 2014. Game-theoretic approach to self-stabilizing distributed formation of minimal multi-dominating sets. IEEE Trans. Parallel Distrib. Syst. 25, 12 (Dec. 2014), 3201--3210.Google Scholar
Cross Ref
- H. P. Young. 1993. The evolution of conventions. Econometrica 61, 1 (Jan. 1993), 57--84.Google Scholar
Cross Ref
Index Terms
Designing Self-Stabilizing Systems Using Game Theory
Recommendations
Fault-containing self-stabilizing distributed protocols
Self-stabilization is an elegant approach for designing a class of fault-tolerant distributed protocols. A self-stabilizing protocol is guaranteed to eventually converge to a legitimate state after a transient fault. However, even a minor transient ...
A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks
OPODIS'05: Proceedings of the 9th international conference on Principles of Distributed SystemsSelf-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent faults. This paper proposes a self-stabilizing link-coloring ...
Self-Stabilizing Wormhole Routing on Ring Networks
ICPADS '02: Proceedings of the 9th International Conference on Parallel and Distributed SystemsWormhole routing is most common in parallel architecturesin which messages are sent in small fragments calledflits. It is a lightweight and efficient method of routing messagesbetween parallel processors. Self-stabilization is atechnique that guarantees ...






Comments