检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2008年第12期103-106,共4页Computer Engineering and Applications
基 金:湖南省自然科学基金(the Natural Science Foundation of Hunan Province of China under Grant No.06JJ2090)
摘 要:超节点对等网的引入,有效解决了网络节点异构性所带来的低性能节点对于文件定位效率低的问题。但是传统超节点对等网构建效率低,不能适应目前高度动态的网络环境。提出一种高效可靠的超节点对等网RSSN,RSSN通过漫步算法对网络叶节点采样,从采样集合中选出高性能节点建立预备超节点,通过判断网络需求调整超节点层,并利用预备超节点备份文件索引信息,提高对等网的稳定性。仿真实验表明,相较Gnutella0.6超节点对等网,RSSN能够有效地提高对等网中超节点的平均性能和利用率,并能适应高动态的网络环境。Super-peers P2P network dividing peers into super-peers and leaf-peers sufficiently settled the problem of low resource locating efficiency due to the coexistence of heterogeneous peers.However,traditional super-peer P2P network does not adapt effective methods to build an efficient super-peer layer and adjust super-peers layer according to the high dynamic network situations.A novel efficient super-peer P2P network construction algorithm called RSSN is proposed in this paper.RSSN is based on the random walk sampling algorithm,it chooses more capable peers for preliminary super-peers that can dynamic adjust the super-peers layer according to network conditions. Additionally,through caching index of sharing files in preliminary super-peers,RSSN is capable to adapt to frequent dynamic activities.The simulation evaluation shows that RSSN can dramatically improve the efficience and robust performance of the super-peers P2P network compared with Gnutella0.6.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.132.192