基于SD-Torus网络的分布式IP地址查找

摘要

针对IP路由器的FIB(Forwarding Information Base)极限问题和分布式IP地址查找中的通信延迟问题,提出了SD-Tor us(Semi-Diagonal Torus)直连网络.按照“临近存储”的原则,将路由表划分后存储在每个节点及其邻居节点上,以减少分布式IP地址查找中的通信延迟,提高整体的查找性能.在分析SD-Torus网络拓扑性质的基础上,提出了一种负载均衡的路由算法.基于SystemC的仿真结果表明,使用该结构可以大大降低分布式IP地址查找的通信延迟,提高系统的扩展性.该研究结果可以应用于高性能的分布式IP地址查找.%Aimed at the scalability of the IP router, especially the fact of the FIB (Forwarding Information Base) limit for IP routers, a scalable direct network, the SD-Torus(Semi-Diagonal Torus) network was proposed. The topology properties of the HT-Torus network was discussed and a load-balanced routing algorithm was presented. By adopting a novel mapping algorithm for the distributed FIB, the entire FIB was split into sub-tables and mapped onto each node and its neighbors,hence to guarantee the communication latency between nodes for distributed IP address lookup,and decrease the memory footprint of the FIB. The proposed schemes can be applied to high performance IP address lookup.