Abstract
We propose a self-stabilizing link formation algorithm based on a cooperative network formation game. An underlying network G = (V,E) consists of n processors represented by nodes V = {1,2,...,n}, and communication links represented by edges E = {ij | i,j ∈ V}. An agent network L = (A,E L ), where A = V and E L ⊆E, is defined on G. Let δ i be a benefit that agent i provides others, and c ij a cost of linking i with j that agent i incurs. We assume a state-reading model, a fair distributed daemon, and a token circulation for formation/severance of links.
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
References
Dolev, S.: Self-Stabilizing Routing and Related Protocols. Journal of Parallel and Distributed Computing 42, 122–127 (1997)
Jackson, M.O.: A Survey of Models of Network Formation: Stability and Efficiency. In: Demange, G., Wooders, M. (eds.) Group Formation in Economics; Networks, Clubs and Coalitions, ch. 1. Cambridge University Press, Cambridge (2004)
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
Kiniwa, J., Kikuta, K. (2006). Brief Announcement: An Efficient and Self-stabilizing Link Formation Algorithm. 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_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_47
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)