Jared S. Ivey
ABSTRACT
The scalability and runtime performance of large-scale discrete event network simulations has been improved previously by spreading processing effort across multiple processors, increasing the provided computational power while decreasing the wallclock execution time of each simulation trial. The popular network simulator ns-3 provides two distributed frameworks that differ in their synchronization implementations. This paper provides those thresholds under which certain selection criteria would deem one synchronization option better than the other in terms of runtime performance. It specifically focuses on the performance of each synchronization method by stripping the model of simulated network topologies and overhead and purely utilizing the synchronization implementations and event scheduler of ns-3. Simulations have been performed across a variety of lookahead values, neighbor selections, and remote traffic percentages, and neighbor connectivity thresholds have been determined that suggest where it is more appropriate to use one option over the other.
- J. Ivey, G. Riley, and B. Swenson. PHOLD performance for distributed network simulation under conservative synchronization methods in ns-3. In Proceedings of the 2nd ACM SIGSIM/PADS Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS '14, pages 163--164, New York, NY, USA, 2014. ACM. Google Scholar
Digital Library
- R. Fujimoto. Performance of time warp under synthetic workloads. 1990.Google Scholar
- C. Carothers and K. Perumalla. On deciding between conservative and optimistic approaches on massively parallel platforms. In Proceedings of the Winter Simulation Conference, WSC '10, pages 678--687. Winter Simulation Conference, 2010. Google ScholarDigital Library
- P. Barnes, Jr., C. Carothers, D. Jefferson, and J. LaPre. Warp speed: Executing time warp on 1,966,080 cores. In Proceedings of the 2013 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS '13, pages 327--336, New York, NY, USA, 2013. ACM. Google ScholarDigital Library
- J. Pelkey and G. Riley. Distributed simulation with MPI in ns-3. In Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, SIMUTools '11, pages 410--414, ICST, Brussels, Belgium, 2011. ICST. Google ScholarDigital Library
- D. Nicol. Standard baseline NMS challenge topology. Website, 2002. http://ssfnet.org/Exchange/gallery/baseline/.Google Scholar
- K. Renard, C. Peri, and J. Clarke. A performance and scalability evaluation of the ns-3 distributed scheduler. In Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques, SIMUTools '12, pages 378--382, ICST, Brussels, Belgium, 2012. ICST. Google ScholarDigital Library
- S. Nikolaev, P. Barnes, Jr., J. Brase, T. Canales, D. Jefferson, S. Smith, R. Soltz, and P. Scheibel. Performance of distributed ns-3 network simulator. In Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques, SIMUTools '13, pages 17--23, ICST, Brussels, Belgium, 2013. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering). Google ScholarDigital Library
- B. Swenson, J. Ivey, and G. Riley. Performance of conservative synchronization methods for complex interconnected campus networks in ns-3. In Proceedings of the 2014 Winter Simulation Conference, WSC '14, pages 3096--3106, Piscataway, NJ, USA, 2014. IEEE Press. Google ScholarDigital Library
- D. Jefferson. Virtual time. ACM Transactions on Programming Languages and Systems, 7: 404--425, 1985. Google ScholarDigital Library
- R. Fujimoto. Parallel and Distributed Simulation Systems. Wiley, 2000. Google ScholarDigital Library
- K. Perumalla. Introduction to Reversible Computing. CRC Press, 2014. Google Scholar
- F. Mattern. Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing, 18(4): 423--434, August 1993. Google ScholarDigital Library
- K. Chandy and J. Misra. Distributed simulation: A case study in design and verification of distributed programs. Software Engineering, IEEE Transactions on, SE-5(5): 440--452, Sept 1979. Google ScholarDigital Library
- R. Bryant. Simulation of packet communication architecture computer systems. Technical report, Cambridge, MA, USA, 1977. Google ScholarDigital Library
- LLC Lawrence Livermore National Security. Cab computation. Website. http://computation.llnl.gov/computers/cab.Google Scholar
Index Terms
- PHOLD performance of conservative synchronization methods for distributed simulation in ns-3
Recommendations
On predicting the performance characteristics of the ns-3 distributed simulator for scale-free internet models
WNS3 '15: Proceedings of the 2015 Workshop on ns-3An inquiry is made into whether or not it is possible to learn a performance characterization which can predict the best way to configure the simulator executive when performing a simulation using the ns-3 network simulator distributed across many CPUs. ...
Pushing the envelope in distributed ns-3 simulations: one billion nodes
WNS3 '15: Proceedings of the 2015 Workshop on ns-3In this paper, we describe the results of simulation of very large (up to 109 nodes), planetary-scale networks using ns-3 simulator. The modeled networks consist of the small-world core graph of network routers and an equal number of the leaf nodes (one ...
Phold performance for distributed network simulation under conservative synchronization methods in ns-3
SIGSIM PADS '14: Proceedings of the 2nd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
Comments