Minimizing Routing State for Light-Weight Network Simulation

Authors:
Polly Huang;John Heidemann
Affiliations:
-;-
Venue:
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Year:
2001

Citing 0
Cited 6

Reducing the Size of Routing Tables for Large-scale Network Simulation

Proceedings of the seventeenth workshop on Parallel and distributed simulation
RINSE: The Real-Time Immersive Network Simulation Environment for Network Security Exercises (Extended Version)

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
An Efficient Routing Mechanism in Network Simulation

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity - O(N). In theory and for simulations size of the Internet, algorithmic routing has the potential of reducing memory requirement by several orders of magnitude. In practice and through ns-2 simulations on random topologies, we find memory consumption of algorithmic routing exhibits a similar scaling property. However, routes computed by algorithmic routing are not all the shortest. Although we find the relative difference is below 10% for more than 80% of the routes, we are cautious about its applicability to general network simulations. With further discussion on impacts of the distortion, we derive a set of guidelines and recommend users to apply this technique only when suitable.