1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems

Research Article

Between Small Complex and Large Simplistic Network Simulators

Download253 downloads
  • @INPROCEEDINGS{10.4108/ICST.SIMUTOOLS2008.3085,
        author={Marat Zhanikeev},
        title={Between Small Complex and Large Simplistic Network Simulators},
        proceedings={1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems},
        publisher={ICST},
        proceedings_a={SIMUTOOLS},
        year={2010},
        month={5},
        keywords={computer networks simulation modeling traffic scalability discrete event simulation},
        doi={10.4108/ICST.SIMUTOOLS2008.3085}
    }
    
  • Marat Zhanikeev
    Year: 2010
    Between Small Complex and Large Simplistic Network Simulators
    SIMUTOOLS
    ICST
    DOI: 10.4108/ICST.SIMUTOOLS2008.3085
Marat Zhanikeev1,*
  • 1: Waseda University, 1-21-1 Nishi-Waseda, Shinjuku-ku, Tokyo, 169-0051 Japan
*Contact email: maratishe@aoni.waseda.jp

Abstract

Presently, discrete-even network simulation market is split among a number of popular simulators, such as NS-x, OMNET++, Opnet, and maybe a few others. These tools are very common in research that targets small to medium size networks. Whenever one needs to simulate a large network of many tens of thousands nodes, the ability to use traditional network simulators is questionable. Since performance, and specifically, execution speed, is the number one priority in traditional network simulation, simulation runs are normally implemented as solid executables running in a memory space, to which there is a physical limit. This paper proposes a different paradigm of simulation that specifically aims at the ability to simulate large networks while supporting models in nodes with any level of complexity.