有效的资源查询是P2P应用所面临的关键问题之一。通过对结构化Pastry进行研究,将性能稳定的超级节点组织成一个主Pastry环,普通节点根据自身的物理位置关系动态地加入到某个子Pastry环中,主环和子环通过超级节点相互连接构成覆盖网络。仿真结果表明:改进后的模型查询性能优于Pastry,更好地适应动态的网络环境。 An effective resource query is one of the key issues faced by P2P applications. Through the research of structured Pastry, the super stable nodes are organized into a main Pastry ring. The normal nodes dynamically join to a certain sub-Pastry ring according to their own physical location, and the main ring and the sub-ring are covered by the super nodes. The internet. Simulation results show that the improved model query performance is better than Pastry and better adapt to the dynamic network environment.