]. D. Acker and S. Kulkarni, Run Time ? in seconds The wall clock time the job was running (end time minus start time) We decided to use " wait time " and " run time " instead A dynamic load dispersion algorithm for load-balancing in a heterogeneous grid system, Sarnoff Symposium, pp.1-5, 2007.

]. Bak, C. Tang, and K. Wiesenfeld, noise, Physical Review Letters, vol.59, issue.4, pp.381-384, 1987.
DOI : 10.1103/PhysRevLett.59.381

A. Barabási and R. Albert, Emergence of Scaling in Random Networks, Science, vol.286, issue.5439, pp.509-512, 1999.

C. Bertelle, F. Dutot, D. Guinand, and . Olivier, Organization detection for dynamic load balancing in individual-based simulations. Multiagent and Grid Systems, pp.1-40, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00430523

]. N. Biggs, E. K. Lloyd, and R. J. Wilson, Graph theory, 1736-1936, 1986.

. Boccara, Modeling complex systems, pp.28-29, 2004.
DOI : 10.1007/978-1-4419-6562-2

URL : https://hal.archives-ouvertes.fr/hal-00126264

E. Bonabeau, G. Theraulaz, J. Deneubourg, S. Aron, and S. Camazine, Self-organization in social insects, Trends in Ecology & Evolution, vol.12, issue.5, pp.188-193, 1997.
DOI : 10.1016/S0169-5347(97)01048-3

M. Bonabeau, G. Dorigo, and . Theraulaz, Swarm intelligence: from natural to artificial systems, 1999.

]. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm intelligence: from natural to artificial systems. Numeéro 1, 1999.

W. Peter-braun and . Rossak, Chapter 2 -From Client-Server to Mobile Agents, pp.7-31, 2005.

]. Cao, X. Sun, S. Wang, and . Das, Scalable load balancing on distributed web servers using mobile agents, Journal of Parallel and Distributed Computing, vol.63, issue.10, pp.996-1005, 2003.
DOI : 10.1016/S0743-7315(03)00099-6

H. Casanova, A. Giersch, A. Legrand, M. Quinson, and F. Suter, Versatile, scalable, and accurate simulation of distributed applications and platforms, Journal of Parallel and Distributed Computing, vol.74, issue.10, pp.2899-2917, 2014.
DOI : 10.1016/j.jpdc.2014.06.008

URL : https://hal.archives-ouvertes.fr/hal-01017319

]. Chau and A. Fu, Load balancing between computing clusters, Proceedings of the 8th International Scientific and Practical Conference of Students, Post-graduates and Young Scientists. Modern Technique and Technologies. MTT'2002 (Cat. No.02EX550), pp.548-551, 2003.
DOI : 10.1109/PDCAT.2003.1236362

F. Chierichetti, S. Lattanzi, and A. Panconesi, Rumour spreading and graph conductance, Proceedings of the Twentyfirst Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '10, pp.1657-1663, 2010.
DOI : 10.1137/1.9781611973075.135

B. Chopard, A. Dupuis, A. Masselot, and P. Luthi, CELLULAR AUTOMATA AND LATTICE BOLTZMANN TECHNIQUES: AN APPROACH TO MODEL AND SIMULATE COMPLEX SYSTEMS, Advances in Complex Systems, pp.103-246, 2002.
DOI : 10.1142/S0219525902000602

E. F. Andrea, P. Clementi, C. Crescenzi, P. Doerr, M. Fraigniaud et al., Rumor Spreading in Random Evolving Graphs, p.2013, 1302.

J. George-coulouris, T. Dollimore, G. Kindberg, and . Blair, Distributed systems: Concepts and design, pp.6-17, 2011.

. Crihan and . Crihan, Computer Resource Centre of Upper Normandy Centre de Ressources Informatiques de Haute-Normandie " . http://www.crihan.fr. Accessed, pp.2014-2024

A. Demers, D. Greene, and C. Hauser, Epidemic algorithms for replicated database maintenance, Proceedings of the sixth, 1987.

Z. Galil and G. F. Italiano, Dynamic Graph Algorithms, Algorithms and Theory of Computation Handbook, pp.9-9, 2010.

. Diet and . Diet, Distributed Interactive Engineering Toolbox. http://graal. ens-lyon.fr/diet, pp.2014-2024

M. Birattari and T. Stutzle, Ant colony optimization, Computational Intelligence Magazine, IEEE, vol.1, issue.4, pp.28-39, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00874517

]. and R. Dunne, Using mobile agents for network resource discovery in peer-to-peer networks, ACM SIGecom Exchanges, vol.2, issue.3, pp.1-9, 2001.
DOI : 10.1145/844324.844326

P. Erdi and . Erdi, Complexity explained, 2008.

]. P. Erdös and A. Rényi, On random graphs, I, pp.290-297, 1959.

G. Dror and . Feitelson, Workload modeling for computer systems performance evaluation, 2015.

I. Foster and C. Kesselman, Chapter 4 -Concepts and Architecture, The Morgan Kaufmann Series in Computer Architecture and Design, pp.37-63, 2004.

K. Fountoulakis and . Panagiotou, Rumor Spreading on Random Regular Graphs and Expanders, Approximation, Randomization , and Combinatorial Optimization. Algorithms and Techniques, pp.560-573, 2010.
DOI : 10.1007/978-3-642-15369-3_42

]. Fukuda, T. Hirotsu, S. Kurihara, O. Akashi, S. Sato et al., The Impact of Network Model on Performance of Load-balancing, Emergent Intelligence of Networked Agents, pp.23-37, 2007.
DOI : 10.1007/978-3-540-71075-2_3

]. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, STACS, volume 9 of LIPIcs Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, pp.57-68, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573638

G. Giakkoupis, T. Sauerwald, and A. Stauffer, Randomized Rumor Spreading in Dynamic Graphs, Automata , Languages, and Programming, pp.495-507, 2014.
DOI : 10.1007/978-3-662-43951-7_42

URL : https://hal.archives-ouvertes.fr/hal-01097142

]. E. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

. Graphstream and . Graphstream, GraphStream: A Dynamic Graph Library, pp.2014-2024

L. Jonathan, J. Gross, P. Yellen, and . Zhang, Handbook of graph theory, second edition, Chapman & Hall/CRC, vol.2, issue.2, p.2013, 2013.

. Gwa and . Gwa, The Grid Workloads Archive, pp.2014-2024

]. Haeupler, G. Pandurangan, and D. Peleg, Rajmohan Rajaraman and Zhifeng Sun, Discovery through Gossip. CoRR, 1202.

T. Leighton and D. Lewin, Resource discovery in distributed networks, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp.229-237, 1999.

]. J. Hawkinson, Guidelines for creation, selection, and registration of an Autonomous System (AS), 1996.
DOI : 10.17487/rfc1930

G. Alfons, J. Hoekstra, P. M. Kroc, and . Sloot, Introduction to Modeling of Complex Systems Using Cellular Automata, Simulating Complex Systems by Cellular Automata, Understanding Complex Systems, pp.1-16, 2010.

. Alfonsg, J. Hoekstra, P. A. Kroc, and . Sloot, Introduction to Modeling of Complex Systems Using Cellular Automata, Simulating Complex Systems by Cellular Automata, Understanding Complex Systems, pp.1-16, 2010.

A. D. Kshemkalyani and M. Singhal, Peer-to-peer computing and overlay graphs, Distributed Computing, pp.677-730, 2008.
DOI : 10.1017/CBO9780511805318.019

]. J. Laredo, P. Bouvry, F. Guinand, B. Dorronsoro, and C. Fernandes, The sandpile scheduler, Cluster Computing, vol.4, issue.9, pp.1-14, 2014.
DOI : 10.1007/s10586-013-0328-x

A. J. Lemoine, Waiting time and workload in queues with periodic Poisson input, Journal of Applied Probability, vol.26, issue.02, pp.390-397, 1989.
DOI : 10.2307/3213459

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graphs over time, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , KDD '05, pp.177-187, 2005.
DOI : 10.1145/1081870.1081893

H. Li, M. Muskulus, and L. Wolters, Modeling Job Arrivals in a Data-Intensive Grid, Eitan Frachtenberg and Uwe Schwiegelshohn, editeurs, Job Scheduling Strategies for Parallel Processing, pp.210-231, 2007.
DOI : 10.1007/978-3-540-71035-6_11

H. Li and R. Buyya, Model-based simulation and performance evaluation of grid scheduling strategies, Future Generation Computer Systems, vol.25, issue.4, pp.460-465, 2009.
DOI : 10.1016/j.future.2008.09.012

]. L. Little and A. D. Mcdonald, Simulations of agents in social networks harvesting a resource, Ecological Modelling, vol.204, issue.3-4, pp.379-386, 2007.
DOI : 10.1016/j.ecolmodel.2007.01.013

U. Lublin and D. G. Feitelson, The workload on parallel supercomputers: modeling the characteristics of rigid jobs, Journal of Parallel and Distributed Computing, vol.63, issue.11, pp.1105-1122, 2003.
DOI : 10.1016/S0743-7315(03)00108-4

E. Meshkova, J. Riihijärvi, M. Petrova, and P. Mähönen, A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks, Computer Networks, vol.52, issue.11, pp.2097-2128, 2008.
DOI : 10.1016/j.comnet.2008.03.006

]. M. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

E. J. Mark and . Newman, Random graphs as models of networks, pp.35-68, 2005.

. Pwa and . Pwa, Log of real parallel workloads from production systems, pp.2014-2024

C. Shahabi and F. Banaei-kashani, Modelling Peer-to-Peer Data Networks Under Complex System Theory, Subhash Bhalla, editeur, Databases in Networked Information Systems, pp.238-243, 2005.
DOI : 10.1007/978-3-540-31970-2_19

X. Shen, L. Liu, Z. Zha, P. Gu, Z. Jiang et al., Achieving dynamic load balancing through mobile agents in small world P2P networks, Computer Networks, vol.75, issue.0, pp.2014-67, 2014.
DOI : 10.1016/j.comnet.2014.05.003

S. Andrew, M. Tanenbaum, and . Van-steen, Distributed systems: Principles and paradigms, 2006.

]. Thain, T. Tannenbaum, and M. Livny, Distributed computing in practice: the Condor experience, Concurrency and Computation: Practice and Experience, vol.11, issue.2-4, pp.323-356, 2005.
DOI : 10.1002/cpe.938

S. Tisue and U. Wilensky, NetLogo: A simple environment for modeling complexity, International Conference on Complex Systems, pp.16-21, 2004.

. Vidal, Fundamentals of multiagent systems with netlogo examples, Unpublished, 2007.

M. Voulgaris, M. Jelasity, and . Steen, A Robust and Scalable Peer-to-Peer Gossiping Protocol, Lecture Notes in Computer Science, vol.2872, pp.47-58, 2005.
DOI : 10.1007/978-3-540-25840-7_6

J. Duncan, S. H. Watts, and . Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, issue.6684, pp.440-442, 1998.

U. Wilensky, NetLogo: a multi-agent programmable modeling environment, 2014.

]. U. Wilensky and W. Rand, Introduction to agent-based modeling: Modeling natural, social, and engineered complex systems with netlogo, p.2015, 2015.

A. P. Lemair and . Reeves, Strategies for dynamic load balancing on highly parallel computers, IEEE Transactions on Parallel and Distributed Systems, vol.4, issue.9, pp.979-993, 1993.
DOI : 10.1109/71.243526

J. Robin and . Wilson, An introduction to graph theory. Pearson Education India, 1970.