A case study of web server benchmarking using parallel WAN emulation
Performance Evaluation
Enabling Large-Scale Multicast Simulation by Reducing Memory Requirements
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Reducing the Size of Routing Tables for Large-scale Network Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
The Georgia Tech Network Simulator
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
Staged simulation: A general technique for improving simulation scale and performance
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Space-parallel network simulations using ghosts
Proceedings of the eighteenth workshop on Parallel and distributed simulation
Proceedings of the 35th conference on Winter simulation: driving innovation
Simulation of large scale networks II: large-scale network simulations with GTNetS
Proceedings of the 35th conference on Winter simulation: driving innovation
Comparative Study between Analytical Models and Packet-Level Worm Simulations
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
An Efficient Routing Mechanism in Network Simulation
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
On-demand computation of policy based routes for large-scale network simulation
WSC '04 Proceedings of the 36th conference on Winter simulation
Advanced concepts in large-scale network simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
Proceedings of the 38th conference on Winter simulation
Path preserving scale down for validation of internet inter-domain routing protocols
Proceedings of the 38th conference on Winter simulation
Describing and simulating internet routes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
ACM Transactions on Modeling and Computer Simulation (TOMACS)
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Describing and simulating internet routes
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Simulating large topologies in ns-3 using BRITE and CUDA driven global routing
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform per-hop packet forwarding, the storage required for the routing tables is O(N2), where N is the number of simulated network nodes in the topology. Additionally, the CPU time required in the simulation environment to compute and populate these routing tables can be excessive and can dominate the overall simulation time.We propose a new routing technique, known as Neighbor-Index Vectors, or NIx-Vectors, which eliminates both the storage required for the routing tables and the CPU time required to compute them. We show experimental results using Nix-Vector routing in the popular network simulator ns.With our technique, we achieve a near order of magnitude increase in the maximum size of a simulated network running ns on a single workstation. Further, we demonstrate an increase of two orders of magnitude in topology size (networks as large as 250,000 nodes) by using this technique and running the simulation in parallel on a network of workstations.