Sage Journals: Discover world-class research

Abstract

Simulation is widely recognized as an essential tool for analyzing large-scale networks. Routing is a key factor which impacts the simulation scale and efficiency. This paper presents a new approach to routing calculation, storage and lookup, named MTree_Nix routing. It maintains a variable number of spanning trees as the base routing table, and uses Nix-Vector routing to compute on demand the routing states that cannot be covered by any of the spanning trees. Theoretically, we obtain the constraint condition on the optimized trade-off between space and time in MTree_Nix routing. Integrated with the advantages of the current routing mechanisms, MTree_Nix comes to a better trade-off between the storage space for the routing tables and the CPU time for routing lookup. Experimental results show that, with a storage space of only about 1% more than Nix-Vector, MTree_Nix can reduce the simulation time to about 85% of that using Nix-Vector.

Keywords

network simulation routing mechanism MTree_Nix

Get full access to this article

View all access options for this article.

References

Huang, P. , D. Estrin and J. Heidemann. 1998. Enabling large-scale simulations: selective abstraction approach to the study of multicast protocols. In Proceedings of the International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Montreal, Canada, July 1998, pp. 241- 248.

Huang, P. and J. Heidemann. 2001. Minimizing routing state for light-weight network simulation. In Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems 2: 108-116.

Hiromori, A. , H. Yamaguchi , K. Yasumoto et al. 2003. Reducing the Size of Routing Tables for Large-scale Network Simulation. In Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 115-122.

Chen, J. , D. Gupta , K. Vishwanath et al. 2004. Routing in an Internet-Scale Network Emulator . In Proceedings of the IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 275-283.

Riley, G. , Ammar, M. and Zegura, E. 2001. Efficient routing using Nix-Vectors. In Proceedings of IEEE Workshop on High Performance Switching and Routing (HPSR 2001), pp. 390-395.

Riley, G. , R. Fujimoto and M. Ammar. 2000. Stateless routing in network simulations . In Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems , pp. 524-531.

The VINT Project, http://www.isi.edu/nsnam/vint/,networksimulator.

Magoni, D. and J. Pansiot. 2002. Internet Topology Modeler Based on Map Sampling. In Proceedings of the 7th IEEE Symposium on Computers and Communications, pp. 1021-1027.

Jiang, Y. , B. Fang , M. Hu , and H. Zhang. 2003. A Distributed Architecture for Internet Router Level Topology Discovering Systems. In Proceedings of the 4th International Conference on Parallel and Distributed Computing, Applications and Technologies (PD-CAT 2003), pp. 47-51.

10.

Liljenstam, M. , D. Nicol , V. Berk , and R. Gray. 2003. Simulating realistic network worm traffic for worm warning system design and testing. In Proceedings of the 2003 ACM workshop on rapid malcode, pp. 24-33.

11.

Riley, G. , M. Sharif and W. Lee 2004. Simulating Internet Worms. In Proceedings of the 12th Annual Meeting of the IEEE/ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS2004), pp. 268-274.

12.

Riley, G. , R. Fujimoto and M. Ammar. 1999. A Generic Framework for Parallelization of Network Simulations. In Proceedings of Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MAS-COTS'99), pp. 128-135.

13.

Riley, G. , R. Fujimoto and M. Ammar. 2000. Parallel/Distributed NS. Software on-line: www.cc.gatech.edu/computing/compass/ pdns/index.html. Georgia Institute of Technology.

An Efficient Routing Mechanism in Network Simulation

Abstract

Keywords

Get full access to this article

References