Self-stabilizing (f,g)-Alliances with Safe Convergence [chapter]

Fabienne Carrier, Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
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
more » ... l one in at most 5n + 4 additional rounds, where n is the size of the network. Our algorithm is written in the shared memory model. It is proven assuming an unfair (distributed) daemon. Its memory requirement is O(log n) bits of memory per process, and it takes O(∆ 3 n) steps to stabilize, where ∆ is the degree of the network.
doi:10.1007/978-3-319-03089-0_5 fatcat:elqutbmyyvbh5el6ebi6mkzu5u