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

Building cloud P2P network with small routing delay

作　　者：李剑锋[1,2] 陈世平[1,3] 李园[4] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]中国计量学院经济与管理学院,杭州310018 [3]上海理工大学信息化办公室,上海200093 [4]上海理工大学光电信息与计算机工程学院,上海200093

出　　处：《计算机应用研究》2014年第6期1760-1763,1767,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(61170277,71173203);上海市教委科研创新重点项目(12zz137);上海市一流学科建设项目(S1201YLXK)

摘　　要：利用分布式哈希表(DHT)技术和简单的随机邻居策略,提出了一种基于云对等网络的资源搜索算法(RCLOUD),解决了以1-c的概率在d跳内完成查询的问题,c和d均为可设定的常数。该算法的一个主要优势是当节点加入或离开时邻居信息维护开销低。仿真实验结果表明,与经典Chord等P2P算法相比,RCLOUD网络中云节点只有在网络规模N增加一倍(或减半)时才会增加(或减少)其随机邻居的数量,并且不牺牲系统效率。这表明任意邻居的查找与N的大小无关,可以高概率将查询跳数控制在常数跳d以内。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 advantage of it was that the neighbor information maintenance overhead was low when nodes join or leave.The simulation results show that compared with the traditional Chord algorithm a note increases（or dexreases） its number of random neighbors only when the total number of noded （N）doubles （or halves） wiithout sacificing the performance.Note that the location of particular neighbor is independent of N.It can resolve reqests in d hops with a chosen high probability.

关 键 词：云计算 云对等网络 随机拓扑结构 路由延迟 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]