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

In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted. Especially, routing tables, which indicate the directions to forward packets, are considered to consume memory space. A simple routing table requires O(N2 ) space where N is the number of nodes. An algorithmic routing 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 routes between 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 a capacity of routing tables under any routing strategy. In our method, given a simple routing table, we can find a (near-optimal) algorithmic routing based table that can represent a part of the given routing table in a smaller size. Our experimental results have shown that our method could red...

• Type: Conference
• Year: 2003
• Where: PADS
• Authors: Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasumoto, Teruo Higashino, Kenichi Taniguchi
• Keywords: Algorithmic Routing, Modelling And Simulation, PADS 2003, Routing Table, Simple Routing Table