摘要
提出一种基于概率的启发式算法对节点地址进行重新编号,该算法可以使得到达一些连续地址的下一跳尽可能的相同,进而再对这些连续地址进行压缩以达到简化路由表的目的.我们利用真实的网络拓扑进行仿真,实验结果表明在维持最短路径路由的前提下,仍然可以压缩到完整路由表的24%,利用这种方法可以极大的简化路由表,以提高网络仿真的规模.
In this paper,we propose a heuristic address assignment algorithm based on probability in order to reduce the routing table size.Our algorithm can guarantee the high probability that each node assigned with consecutive addresses uses the same next hop,and then these consecutive addresses can be compressed to compact the routing tables.To evaluate this algorithm in practice,we implement it on a real Internet inter-domain topology.The experimental results show that our method can reduce the table size to 24 % of the complete routing table while keeping the routes shortest paths.To make the network simulation scalable,employing this method can simplify routing table greatly.
出处
《北京交通大学学报》
CAS
CSCD
北大核心
2010年第2期58-61,共4页
JOURNAL OF BEIJING JIAOTONG UNIVERSITY
基金
国家"973"计划项目资助(2007CB307100
2007CB307106)
高等学校学科创新引智计划(111项目)资助(B08002)
国家自然科学基金资助项目(6067206
60772043)
关键词
地址分配算法
路由表
路由算法
路径长度
address assignment algorithm
routing table size
routing algorithm
path length
