摘要
提出一种基于树环Chord的网络拓扑结构,并设计了与该拓扑结构对应的节点的路由表结构。基于树环Chord的网络拓扑结构有效利用了IPv6地址协议的地址聚类特性把网络中的节点划分到相应的自治域,有效解决了物理网络和逻辑网络不匹配时路由绕路产生的搜索延迟问题;新的路由表消除了冗余信息并增加了目标资源列表,增加了启发信息,缩短了重复搜索的延迟。仿真实验结果表明,基于树环Chord的网络拓扑结构的搜索平均延迟和平均跳数优于Chord和DChord,有效提高了资源搜索的性能。
A new network topology based on tree ring Chord has been proposed,and the corresponding routing table structure has also been designed.The network topology based tree ring Chord uses the address cluster properties of IPv6 to divide the nodes into corresponding domains,solving the problem of detention that physical network and logical network does not match.The new routing table eliminates redundant information and increases objective resource table,increasing the useful information,reducing search detention.The simulation shows that the the average detention and average hop count of search model based on tree ring Chord are better than Chord and DChord,improves the efficiency of resource searching effectively.
出处
《计算机技术与发展》
2011年第8期97-100,共4页
Computer Technology and Development
基金
江苏省科学技术支持项目(BE2009158)
