利用二叉排序树改进结构化P2P模型

P2P覆盖网络是一种对等网之间的逻辑连接构成的应用层网络,由于其易于构建、管理灵活、可扩展性强,在实现互联网上的多种应用中发挥着重要的作用。在研究Chord算法的基础上提出了一个BBSTC网络拓扑模型,介绍了网络节点的加入和退出的路由算法以及资源定位的步骤,通过仿真实验和分析表明此方案可以显著改善搜索结果的成功率和大大减少搜索所需的路由跳数,在目前结构化P2P环境中,该策略有一定的推广利用和研究价值。

Binary sort tree model for structured P2P improved mechanism

P2P overlay network is a logical connection between the application layers consisting of networks，because of its easy to build，management flexibility，scalability，and in achieving a variety of applications on the Internet to play this important role.Based on the Chord algorithm this paper proposes a network topology model BBSTC，introduces the addition of network nodes and the routing algorithm from the Resource Locator，as well as the steps.Simulation experiments and analysis show that this program can significantly improve the success rate of search results and significantly reduce the routing hops of search.In the structured P2P environment，the strategy promotes the use and has certain research value.