【摘要】 针对Internet上资源量巨大,查找有用资源较困难的问题,基于Internet的小世界特征和无尺度特征,提出了一个新的资源查找算法-连接度优先路由查找算法(CFR),该算法利用Internet上节点间平均最短路径短以及少量节点的连接度较高,而大量的节点连接度较小的特点,通过将查询信息包转发给连接度较高的节点的方法,实现了在Internet上高效的资源查找.最后,通过实现的Internet拓扑生成器,仿真验证了该算法具有查找效率较高、时间开销和造成的网络流量较小的特点.更多还原

【Abstract】 In terms of huge resources in Internet,it was difficult to locate the useful resources.So a new search method for resources was put forward-the Connection First Routing method based on the small world and scale-free character in Internet.Because the average shortest path is limited to a small value and there are a few nodes with many connection degree and a lot of nodes with a large amount of degree,by forwarding the searching packets to the nodes with huge connection degree,the efficient searching method can be realized.Finally by implementing an Internet topology creator,the method is verified to be efficient,and the time consumption and the network load is less.更多还原