Title :
Minimizing routing state for light-weight network simulation
Author :
Huang, Polly ; Heidemann, John
Author_Institution :
Swiss Fed. Inst. of Technol., Lausanne, Switzerland
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 the size of the Internet, algorithmic routing has the potential of reducing memory requirements 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 the impacts of the distortion, we derive a set of guidelines and recommend users to apply this technique only when suitable
Keywords :
Internet; digital simulation; minimisation; network topology; telecommunication network routing; Internet; algorithmic routing; light-weight network simulation; memory consumption; memory requirement; random topologies; routing mechanism; routing state; scaling property; Computational modeling; IP networks; Internet; Large-scale systems; Maintenance; Network topology; Random access memory; Routing protocols; Space technology; Spine;
Conference_Titel :
Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on
Conference_Location :
Cincinnati, OH
Print_ISBN :
0-7695-1315-8
DOI :
10.1109/MASCOT.2001.948859