Abstract:

Many of self-stabilizing algorithms have been proposed in literature to deal with fault-tolerance in distributed systems. Most existing works have utilized random graphs (Erdos-Renyi networks) to simulate self-stabilizing algorithms. In the present paper, we propose the use of self-stabilizing algorithms on scale-free graphs (Barabasi-Albert networks) which are more representative for real networks. After that, we test these algorithms under evolutionary dynamic graphs. Performance is evaluated using extensive simulations where three well known self-stabilizing algorithms are tested: nodes coloring, minimal dominating set and maximal independent set. 

Publisher's Version