Quasi-Dynamic Network Model Partition Method for Accelerating Parallel Network Simulation

In this paper, we propose a network model partition method called QD-PART (Quasi-Dynamic network model PARTition method) for accelerating parallel network simulation. The key of QD-PART is to utilize the fact that a network simulation is typically repeated several times with the same parameter set for estimating the confidence interval of steady state measures. QD-PART gradually optimizes partition of a network model based on past simulation results such as the total simulation time, CPU usage of computing resources, and traffic intensity (i.e., the number of packets transmitted) of each link. At the end of each parallel simulation run, QD-PART re-partitions the network model based on such information aiming at minimizing communication overhead among computing resources and balancing load of sub-network models executed on computing resources. Through several experiments using a parallel-distributed network simulator, we show how parallel network simulation can be accelerated using QD-PART by gradually improving the network model partition.

[1]  David Finkel,et al.  Book review: The Art of Computer Systems Performance Analysis by R. Jain (Wiley-Interscience, 1991) , 1990, PERV.

[2]  H. T. Mouftah,et al.  Distributed Discrete Event Simulation for Communication Networks , 1990, IEEE J. Sel. Areas Commun..

[3]  Giorgio Ventre,et al.  Network Simulator NS2 , 2008 .

[4]  Sally Floyd,et al.  Why we don't know how to simulate the Internet , 1997, WSC '97.

[5]  August 29-September 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[6]  Hiroyuki Ohsaki,et al.  On Network Model Division Method Based on Link-to-Link Traffic Intensity for Accelarating Parallel Distributed Simulation , 2005, ICN.

[7]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[8]  Mostafa H. Ammar,et al.  A generic framework for parallelization of network simulations , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[10]  Averill M. Law Simulation software for communications networks: the state of the art , 1994, IEEE Communications Magazine.

[11]  Mostafa H. Ammar,et al.  BencHMAP: benchmark-based, hardware and model-aware partitioning for parallel and distributed network simulation , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[12]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[13]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[14]  Victor S. Frost,et al.  Some new efficient techniques for the simulation of computer communications networks , 1988, IEEE J. Sel. Areas Commun..

[15]  Richard M. Fujimoto,et al.  Parallel simulation techniques for large-scale networks , 1998, IEEE Commun. Mag..