摘要： 影响DHT结构的P2P网络性能的因素主要包括关键字的查询效率和维护网络稳定的代价。从分析查询效率和节点规模的关系入手，提出面向应用查询服务(AOLS)，节点之间的逻辑关系采用二叉树结构，给出网络自组织逻辑关系算法和消息路由算法。实验表明，AOLS模型在查询效率和维护网络稳定代价2个方面都有较好的性能。
关键词:
AOLS模型,
P2P网络,
DHT算法,
二叉树
Abstract: Factors influencing performance of P2P network structured by DHT mainly include inquiry efficiency of key words and cost of maintaining the steady of network. This paper starts with analyzing the relation of inquire efficiency and nodes scale, proposes the Application-oriented Lookup Service(AOLS). The logic relation among nodes adopts binary tree. It provides the algorithm of the logic relation organization in network and messages routing algorithm between nodes. Experiment indicates ALOS’s inquiry efficiency and cost of maintaining network’s stability have better performance.
Key words:
Application-oriented Lookup Service(AOLS) model,
P2P network,
DHT algorithm,
binary tree
中图分类号:
李建春;赵宗渠;黄道颖;李健勇. P2P环境下面向应用的查询服务模型[J]. 计算机工程, 2009, 35(14): 104-107.
LI Jian-chun; ZHAO Zong-qu; HUANG Dao-ying; LI Jian-yong. Application-oriented Lookup Service Model in P2P Environment[J]. Computer Engineering, 2009, 35(14): 104-107.