<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Badreddine Benreguia</style></author><author><style face="normal" font="default" size="100%">Hamouma Moumen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%"> Self-Stabilisation on Scale-free Networks </style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Computer Science, Communication &amp; Information Technology (CSCIT)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ipco-co.com/CSCIT_Journal/CSCIT.html</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">19-26</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.&amp;nbsp;</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>