SAMAS: Scalable Architecture for Multi-resolution Agent-Based Simulation

  • Alok Chaturvedi
  • Jie Chi
  • Shailendra Mehta
  • Daniel Dolk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)


Large scale agent-based simulation has become the focus of great interest from both academy and industry in resent years. It has been shown an effective tool for understanding a variety of complex systems, such as market economics, war games, and epidemic propagation models. As the systems of interest grow in complexity, it is often desirable to have different categories of artificial agents that execute tasks on different time scales. With the added complexity, the scalability of a simulation environment becomes a crucial measure of its ability in coping with the complexity of the underlying system. In this paper, we present the design of SAMAS, a highly scalable architecture for multi-resolution agent-based simulation. SAMAS is a dynamic data driven application system (DDDAS) that adopts an efficient architecture that allows large number of agents to operate on a wide range of time scales. It uses gossiping, an efficient broadcasting communication model for maintaining the overall consistency of the simulation environment. We demonstrate the effectiveness of this communication model using experimental results obtained from simulation.


  1. 1.
    Chaturvedi, A., Mehta, S., Drnevich, P.: Live and computational experimentation in bioterrorism response. In: Dynamic Data Driven Applications Systems, Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  2. 2.
    Chaturvedi, Mehta, Dolk, Ayer: Artificial labor market. European Journal of Operations Research (2003)Google Scholar
  3. 3.
    Chaturvedi, A.R., Choubey, A.K., Roan, J.S.: Active replication and update of content for electronic commerce. International Journal of Electronic Commerce 5 (2003)Google Scholar
  4. 4.
    Hedetniemi, S.M., Hedetniemi, T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. NETWORKS 18, 319–349 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bavelas, A.: Communication patterns in task-oriented groups. J. Acoust. Soc. Amer. 22, 271–282 (1950)CrossRefGoogle Scholar
  6. 6.
    Baker, B., Shostak, R.: Gossips and telephones. Discrete Mathematics 2, 191–193 (1972)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Czumaj, A., Gasieniec, L., Pelc, A.: Time and cost trade-offs in gossiping. SIAM Journal on Discrete Mathematics 11, 400–413 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Grama, A., Kumar, V., Gupta, A., Karypis, G.: Introduction to Parallel Computing, An: Design and Analysis of Algorithms, 2nd edn. Addison-Wesley, Reading (2003)Google Scholar
  9. 9.
    Krumme, D.W.: Fast gossiping for the hypercube. SIAM J. Comput. 21, 365–380 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Krumme, D.W., Cybenko, G., Venkataraman, K.N.: Gossiping in minimal time. SIAM J. Comput. 21, 111–139 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Landau, H.: The distribution of completion times for random communications in a taskoriented group. Bull. Math. Biophys. 16, 187–201 (1954)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Alok Chaturvedi
    • 1
  • Jie Chi
    • 1
  • Shailendra Mehta
    • 1
  • Daniel Dolk
    • 2
  1. 1.Purdue UniversityWest LafayetteUSA
  2. 2.Naval Postgraduate SchoolMontereyUSA

Personalised recommendations