检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾晓云[1]
机构地区:[1]广西财经学院计算机与信息管理系,南宁530003
出 处:《计算机工程》2010年第7期112-114,118,共4页Computer Engineering
摘 要:在结构化点对点(P2P)模型中,节点异构性会引起系统的不稳定。针对该问题,结合混合P2P模型的优点,构造一个基于Chord协议的混合P2P模型,将节点按处理能力分为超节点和普通节点,多个超节点被组织到同一个群组中,由超节点管理普通节点以提高系统稳定性。该模型采用基于拓扑感知的搜索算法,能较好地解决分布式哈希表(DHT)技术的路由绕路问题。实验证明,该模型在一定程度上降低查询延时,可提高查询效率。Aiming at the system instability of structured P2P model which is caused by the heterogeneity of nodes in model, this paper proposes a Hybrid Structure P2P network based on the Chord(HSChord). The model is combined with the advantages of hybrid P2P model. According to the nodes' processing power, it divides nodes into super-nodes and ordinary-nodes. In this model, some super-nodes are organized into the same group, and manage the ordinary-nodes to improve system stability. The model proposes search algorithm which is based on topology-aware. The algorithm can solve the routing detour which is caused by DHT technical inquiries better. Experimental results show that the search algorithm can reduce the query delay and improve the efficiency of query.
关 键 词:点对点 结构化P2P模型 基于拓扑感知的搜索算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249