The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2003)
San Diego, California
June 10, 2003 to June 13, 2003
ISSN: 1087-4097
ISBN: 0-7695-1970-9
pp: 115
Teruo Higashino , Graduate School of Information Science and Technology, Osaka University
Kenichi Taniguchi , Graduate School of Information Science and Technology, Osaka University
Keiichi Yasumoto , Graduate School of Information Science, Nara Institute of Science and Technology
Hirozumi Yamaguchi , Graduate School of Information Science and Technology, Osaka University
Akihito Hiromori , Graduate School of Engineering Science, Osaka University
ABSTRACT
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 general routing table requires O(N2) space where N is the number of nodes. An algorithmic routing 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 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 the size of routing tables under any routing strategy. Given a general simple routing table, our method represents a routing table as the combination of an algorithmic routing based table and a general routing table, by translating a part of the given general routing 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 represents most part of the given routing table. Our experimental results have shown that our method could reduce the size of the table to 10 % of the given routing table in hierarchical networks.
INDEX TERMS
null
CITATION
Teruo Higashino, Kenichi Taniguchi, Keiichi Yasumoto, Hirozumi Yamaguchi, Akihito Hiromori, "Reducing the Size of Routing Tables for Large-scale Network Simulation", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 115, 2003, doi:10.1109/PADS.2003.1207427
89 ms
(Ver 3.3 (11022016))