Skip to main content
SpringerLink
Log in
Book cover

Emergent Properties in Natural and Artificial Dynamical Systems pp 25–52Cite as

Competing Ants for Organization Detection Application to Dynamic Distribution

  • Chapter

  • 699 Accesses

Part of the book series: Understanding Complex Systems ((UCS))

Abstract

A simulation application may be modeled as a set of interacting entities within an environment. Such applications can be represented as a graph with a one-to-one mapping between vertices and entities and between edges and communications. As for classical applications, performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances may be achieved if and only if a good trade off is found. Our method for finding such a trade off leans on a bio-inspired method. We use competitive colonies of numerical ants, each one depositing colored pheromones, to find organizations of highly communicating entities.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Albert and A.L. Barabaśi (2002) Statistical mechanics of complex networks. Reviews of modern physics, 74:47–97

    Article  MathSciNet  Google Scholar 

  2. R. Banos, C. Gil, J. Ortega, and F.G. Montoya (2003) Multilevel heuristic algorithm for graph partitioning. In G.R. Raidl et al, editor, Applications of Evolutionary Computing, volume 2611, pages 143–153. Lecture Notes in Computer Science, Springer

    Google Scholar 

  3. D. J. Barnes and T. R. Hopkins (2003) The impact of programming paradigms on the efficiency of an individual-based simulation model. Simulation Modelling Practice and Theory, 11(7–8):557–569

    Article  Google Scholar 

  4. C. Bertelle, A. Dutot, F. Guinand, and D. Olivier (2002) Dimants: a distributed multi-castes ant system for DNA sequencing by hybridization. In NETTAB 2002, pages 1–7, AAMAS 2002 Conf, Bologna (Italy)

    Google Scholar 

  5. C. Bertelle, V. Jay, and D. Olivier (2000) Distributed multi-agents systems used for dynamic aquatic simulations. In D.P.F. Müller, editor, ESS’2000 Congress, pages 504–508, Hambourg

    Google Scholar 

  6. S. H. Bokhari (1981) On the Mapping Problem. IEEE Transactions on Computers, 30:207–214

    MathSciNet  Google Scholar 

  7. E. Bonabeau, M. Dorigo, and G. Theraulaz (1999) Swarm Intelligence – From natural to Artificial Systems. Oxford University Press

    Google Scholar 

  8. G. Di Caro and M. Dorigo (1997) Antnet: A mobile agents approach to adaptive routing. Technical report, IRIDIA, Université libre de Bruxelles, Belgium

    Google Scholar 

  9. D. Caromel, W. Klauser, and J. Vayssiere (1998) Towards seamless computing and metacomputing in java. In Geofirey C. Fox, editor, Concurrency Practice Competing Ants for Organization Detection 51 and Experience, volume 10, pages 1043–1061. Wiley&Sons, Ltd., http://wwwsop. inria.fr/oasis/proactive/.

    Google Scholar 

  10. D. Costa and A. Hertz (1997) Ant can colour graphs. Journal of Operation Research Society, (48):105–128

    Google Scholar 

  11. S. K. Das, D. J. Harvey, and R. Biswas (2002) Adaptative load-balancing algorihtms using symmetric broadcast networks. Journal of Parallel and Distributed Computing (JPDC), 62:1042–1068

    Article  MATH  Google Scholar 

  12. J.-L. Deneubourg and S. Goss (1989) Collective patterns and decision making. Ethology Ecology and Evolution, 1(4):295–311

    Google Scholar 

  13. M. Dorigo and L.M. Gambardella (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53–66

    Article  Google Scholar 

  14. M. Dorigo, V. Maniezzo, and A. Colorni (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems Man Cybernet., 26:29–41

    Article  Google Scholar 

  15. A. Dutot, R. Fisch, D. Olivier, and Y. Pigné (2004) Dynamic distribution of an entity-based simulation. In JICCSE 04 – Jordan International Conference on Computer Science and Engineering, Alt-Salt, Jordan

    Google Scholar 

  16. D. L. Eager, E. D. Lazowska, and J. Zahorjan (1986) A comparison of receiverinitiated and sender-initiated adaptive load sharing. Performance evaluation, 6:53–68

    Article  Google Scholar 

  17. P. Erdös and A. Rényi (1959) On random graphs. Pubiones Mathematicaelicat, 6:290–297

    Google Scholar 

  18. B. Faieta and E. Lumer (1994) Diversity and adaptation in populations of clustering ants. In Conference on Simulation of Adaptive Behaviour, Brighton

    Google Scholar 

  19. M.R. Garey and D.S. Johnson (1979) Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Compagny

    Google Scholar 

  20. D.M. Gordon (1995) The expandable network of ant exploration. Animal Behaviour, 50:995–1007

    Article  Google Scholar 

  21. S. Goss, S. Aron, J.-L. Deneubourg, and J. M. Pasteels (1989) Self-organized shortcuts in the argentine ant. Naturwissenchaften, 76:579–581

    Article  Google Scholar 

  22. V. Grimm (1999) Ten years of individual-based modelling in ecology: what have we learned and what could we lear in the future ? Ecological Modelling, 115(2–3):129–148

    Article  Google Scholar 

  23. H.-U. Heiss and M. Schmitz (1995) Decentralized dynamic load balancing: The particles approach. Information Sciences, 84:115–128

    Article  Google Scholar 

  24. Z. Jovanovic and S. Maric (2001) Heuristic algorithm for dynamic task scheduling in highly parallel computing systems. Future Generation Computer Systems, 17:721–732

    Article  MATH  Google Scholar 

  25. P. Kadluzczka and K. Wala (1995) Tabu search and genetic algorithms for the generalized graph partitioning problem. Control and Cybernetics, 24(4):459–476

    Google Scholar 

  26. B.W. Kernighan and S. Lin (1970) An efficient heuristic procedure for partitioning graph. The Bell System Technical Journal, 49(2):192–307

    Google Scholar 

  27. P. Korošec, J. Šilc, and B. Robič (2004) Solving the mesh-partitioning problem with an ant-colony algorithm. Parallel Computing, Elsevier, 30:785–801

    Article  Google Scholar 

  28. P. Kuntz, P. Layzell, and D. Snyers (1997) A colony of ant-like agents for partitioning in vlsi technology. In Fourth European Conference on Artificial Life, pages 417–424, Cambridge, MA:MIT Press

    Google Scholar 

  29. A. E. Langham and P.W. Grant (1999) Using competing ant colonies to solve kway partitioning problems with foraging and raiding strategies. In D. Floreano et al., editor, Advances in Artificial Life, volume 1674, pages 621–625. Lecture Notes in Computer Sciences, Springer

    Google Scholar 

  30. C.G. Langton, editor (1987) Artificial Life. Addison Wesley

    Google Scholar 

  31. F. C. H. Lin and R. M. Keller (1987) The gradient model load balancing method. IEEE TOSE, 13:32–38

    Google Scholar 

  32. M. E. J. Newman (2003) The structure and function of complex networks. SIAM Review 45, pages 167–256

    Article  MATH  MathSciNet  Google Scholar 

  33. T. White (1997) Routing with swarm intelligence. Technical Report SCE-97–15

    Google Scholar 

  34. M. H. Willebeek-LeMair and 1. P. Reeves (1993) Strategies for dynamic load balancing on highly parallel computers. IEEE Transactions on parallel and distributed systems, 4(9):979–993

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIPVI, University of Paris VI, 8, rue du Capitaine Scott, Paris, 75015, France

    Alain Cardon

  2. LITIS, University of Le Havre, 25 rue Philippe Lebon, Le Havre, 76600, France

    Antoine Dutot, Frédéric Guinand & Damien Olivier

Authors
  1. Alain Cardon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Dutot
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frédéric Guinand
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Damien Olivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Applied Math Laboratory, University of Le Havre, 25 Rue Ph. Lebon, Le Havre, Cedex, 540, France

    M.A. Aziz-Alaoui

  2. Computer Sciences Laboratory, University of Le Havre, 25 Rue Ph. Lebon, Le Havre, Cedex, 540, France

    C. Bertelle

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this chapter

Cite this chapter

Cardon, A., Dutot, A., Guinand, F., Olivier, D. (2006). Competing Ants for Organization Detection Application to Dynamic Distribution. In: Aziz-Alaoui, M., Bertelle, C. (eds) Emergent Properties in Natural and Artificial Dynamical Systems. Understanding Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-34824-7_2

Download citation

Publish with us

Policies and ethics

Search

Navigation