Abstract
Stabilizing distributed systems expect all the component processes to run predefined programs that are externally mandated. In Internet scale systems, this is unrealistic, since each process may have selfish interests and motives related to maximizing its own payoff. This paper formulates the problem of selfish stabilization that shows how competition blends with cooperation in a stabilizing environment.
This is a preview of subscription content, log in via an institution to check access.
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
Arora, A., Gouda, M.G.: Closure and Convergence: A foundation of fault-tolerant computing. IEEE Trans. Software Engineering 19, 1015–1027 (1993)
Chen, N.S., Yu, H.P., Huang, S.T.: A self-stabilizing algorithm for constructing a spanning tree. Information Processing Letters 39, 147–151 (1991)
Cobb, J.A., Gouda, M.G., Musunuri, R.: A stabilizing solution to the stable path problem. In: Workshop on Self-stabilizing Systems, pp. 169–183 (2003)
Dijkstra, E.W.: Self-stabilization in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)
Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distributed Computing 14, 147–162 (2001)
Gouda, M.G., Schneider, M.: Stabilization of maximal metric trees. In: Workshop on Self-stabilizing Systems, pp. 10–17 (1999)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking 10 (2002)
Halpern, J.Y.: A computer scientist looks at game theory. Invited talk at Games (2000), Available from: http://www.econwpa.wustl.edu/listings/0411.html
Huang, T.C.: A self-stabilizing algorithm for the shortest path problem assuming read/write Atomicity. J. Computer and System Sciences 71, 70–85 (2005)
Mavronicolas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.: A graph-theoretic network security game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 969–978. Springer, Heidelberg (2005)
Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topology formed by selfish peers. In: ACM Conference on Principles of Distributed Computing (PODC), Denver (2006)
Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: Byzantine players in a virus inoculation game. In: ACM Conference on Principles of Distributed Computing (PODC), Denver (2006)
Pallier, P.: Public-key cryptosystems based on composite degree residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592. Springer, Heidelberg (1999)
Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)
Roughgarden, T., Tardös, E.: How bad is selfish routing? Journal of the ACM 49, 236–259 (2002)
Simon, H.: Models of Bounded Rationality, vol. 1 & 2. MIT Press, Cambridge (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dasgupta, A., Ghosh, S., Tixeuil, S. (2006). Selfish Stabilization. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)