Stateless Routing in Network Simulations

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 perhop packet forwarding, the storage required for the routing tables is ON2, 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 new routing technique, known as Neighbor Index Vectors, or NIx Vectors, which eliminatesboth the storage required for the routing tables and the CPU timerequired 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 demonstate an increase of two orders of magnitude in topology size n...

• Type: Conference
• Year: 2000
• Where: MASCOTS
• Authors: George F. Riley, Mostafa H. Ammar, Richard Fujimoto
• Keywords: MASCOTS 2000, MASCOTS 2007, Routing Tables, Simulated Network, Simulation