摘要
在对等网络(P2P)中,高效精确地定位最近节点是一项基本功能。通过将对等网络中最近节点定位问题抽象成节点覆盖问题,提出一种在一般度量空间中定位最近节点的新方法,满足定位精确,节点负载低,抗网络抖动等特性。仿真实验表明这种近似算法在不增加节点负载的前提下比现有方法(Meridian)更精确,更有效。
Locating nearest node is a basic function for P2P systems. By abstracting nearest node location problem into point cover problem, a novel way which is accurate, costless and immune to churn in general metric space was proposed. Simulation results show that the scheme is more accurate and efficient than existing systems （Meridian） without imposing more loads on each node.
出处
《系统仿真学报》
EI
CAS
CSCD
北大核心
2008年第7期1925-1929,共5页
Journal of System Simulation
基金
国家自然科学基金项目(60673168)
863项目(2006AA01Z207)
关键词
对等网络
最近节点
成员层维护
邻居选择
Peer-to-Peer Networks
nearest node
membership maintenance
neighbor choice
