Enabling Large-Scale Simulation: Selective Abstraction Approach to the Study of Multicast Protocol
MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Generic Framework for Parallelization of Network Simulations
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Stateless Routing in Network Simulations
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Reducing the Size of Routing Tables for Large-scale Network Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Internet Topology Modeler Based on Map Sampling
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Minimizing Routing State for Light-Weight Network Simulation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Simulating realistic network worm traffic for worm warning system design and testing
Proceedings of the 2003 ACM workshop on Rapid malcode
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Routing in an Internet-Scale Network Emulator
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
| Hi-index | 0.00 |
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.