A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Self-stabilizing (f,g)-Alliances with Safe Convergence
[chapter]
2013
Lecture Notes in Computer Science
Given two functions f and g mapping nodes to non-negative integers, we give a silent selfstabilizing algorithm that computes a minimal (f, g)-alliance in an asynchronous network with unique node IDs, assuming that every node p has a degree at least g(p) and satisfies f (p) ≥ g(p). Our algorithm is safely converging in the sense that starting from any configuration, it first converges to a (not necessarily minimal) (f, g)-alliance in at most four rounds, and then continues to converge to a
doi:10.1007/978-3-319-03089-0_5
fatcat:elqutbmyyvbh5el6ebi6mkzu5u