一种小路由延迟的云对等网络搜索算法

利用分布式哈希表(DHT)技术和简单的随机邻居策略,提出了一种基于云对等网络的资源搜索算法(RCLOUD),解决了以1-c的概率在d跳内完成查询的问题,c和d均为可设定的常数.该算法的一个主要优势是当节点加入或离开时邻居信息维护开销低.仿真实验结果表明,与经典Chord等P2P算法相比,RCLOUD网络中云节点只有在网络规模N增加一倍(或减半)时才会增加(或减少)其随机邻居的数量,并且不牺牲系统效率.这表明任意邻居的查找与N的大小无关,可以高概率将查询跳数控制在常数跳d以内....

Full description

Saved in:
Bibliographic Details
Published in计算机应用研究 Vol. 31; no. 6; pp. 1760 - 1763
Main Author 李剑锋 陈世平 李园
Format Journal Article
LanguageChinese
Published 上海理工大学管理学院 上海,200093 2014
上海理工大学信息化办公室 上海,200093%上海理工大学光电信息与计算机工程学院 上海,200093
中国计量学院经济与管理学院,杭州310018%上海理工大学管理学院 上海,200093
Subjects
Online AccessGet full text
ISSN1001-3695
DOI10.3969/j.issn.1001-3695.2014.06.037

Cover

More Information
Summary:利用分布式哈希表(DHT)技术和简单的随机邻居策略,提出了一种基于云对等网络的资源搜索算法(RCLOUD),解决了以1-c的概率在d跳内完成查询的问题,c和d均为可设定的常数.该算法的一个主要优势是当节点加入或离开时邻居信息维护开销低.仿真实验结果表明,与经典Chord等P2P算法相比,RCLOUD网络中云节点只有在网络规模N增加一倍(或减半)时才会增加(或减少)其随机邻居的数量,并且不牺牲系统效率.这表明任意邻居的查找与N的大小无关,可以高概率将查询跳数控制在常数跳d以内.
Bibliography:51-1196/TP
cloud computing; cloud P2P networks; randomized topology; routing delay
LI Jian-feng(Bussiness School, University of Shanghai for Science & Technology, Shanghai 200093, China ;College of Economics & Management, China Jiliang University, Hangzhou 310018, China) CHEN Shi-ping(Bussiness School, University of Shanghai for Science & Technology, Shanghai 200093, China ;Informatisation Office, University of Shanghai for Science & Technology, Shanghai 200093, China) LI Yuan(School of Optical-Electrical & Computer Engineering, University of Shanghai for Science & Technology, Shanghai 200093, China)
Based on distributed hash tabie (DHT)technology and simple uniformly-random neighbor selection stealegy,this paper explored the design space using the simple uniformly-random neighbor selection strategy,and proposed the RCLOUD network.The RCLOUD was the could network based some P2P ideas that was the first of its kind to resolve requests in d hops with a chosen probability of 1-c,where c and d were constants.A major
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.06.037