GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Advances in Network Simulation
Computer
Stateless Routing in Network Simulations
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
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
IEEE Communications Magazine
Expanding confidence in network simulations
IEEE Network: The Magazine of Global Internetworking
An Efficient Routing Mechanism in Network Simulation
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Scalable simulation of complex network routing policies
Proceedings of the 7th ACM international conference on Computing frontiers
| Hi-index | 0.00 |
In simulating large-scale networks, due to the limitationof available resources on computers, the size of thenetworks and the scale of simulation scenarios are oftenrestricted. Especially, routing tables, which indicate thedirections to forward packets, are considered to consumememory space. A simple general routing table requiresO(N2) space where N is the number of nodes. An algorithmicrouting approach recently proposed by Heung et al.only requires O(N) space for representing routing tables,however this can be applied in the case that all the routesbetween two nodes are contained in a spanning tree (i.e.very limited routing strategies are allowed). In this paper,we propose a new method to reduce the size of routing tablesunder any routing strategy. Given a general simplerouting table, our method represents a routing table as thecombination of an algorithmic routing based table and ageneral routing table, by translating a part of the given generalrouting table into the algorithmic routing based one.In order to reduce the size of the routing table, we find a(near-optimal)algorithmic routing based table that representsmost part of the given routing table. Our experimentalresults have shown that our method could reduce the size ofthe table to 10 % of the given routing table in hierarchicalnetworks.