@article {13580,
	title = { Self-Stabilisation on Scale-free Networks },
	journal = {International Journal of Computer Science, Communication \& Information Technology (CSCIT)},
	volume = {6},
	number = {2},
	year = {2019},
	pages = {19-26},
	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.\&nbsp;},
	url = {http://ipco-co.com/CSCIT_Journal/CSCIT.html},
	author = {Badreddine Benreguia and Hamouma Moumen}
}
