节点文献
P2P网络两级混合路由算法
P2P Network Two-Stage Hybrid Routing Algorithm
【Author】 WANG Yu1,2,HOU Fang2,3(1 School of Education Technology and Communications,Guangdong Polytechnic Normal University,Guangzhou 510665,China;2 School of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,China;3 Department of Computer Science,Guangdong University of Finance,Guahgzhou 510521,China)
【机构】 广东技术师范学院教育技术与传播学院; 华南理工大学计算机科学与工程学院; 广东金融学院计算机科学系;
【摘要】 为了提高纯分布式P2P网络的路由效率,减少因为节点频繁的加入和退出而产生的网络不稳定性,提出一种两级混合路由算法.该算法结合了非结构化Flooding路由算法和结构化的Pastry路由算法的优点,将整个网络分为两级,即虚节点网络和子节点网络,分别采用不同的路由算法.实验证明该路由算法能减少路由过程的中心热点效应和不稳定性,有效提高路由效率.
【Abstract】 In order to improve the pure distributed P2P network routing efficiency and reduce the instability because of the frequent join and withdraw of node,this paper presents a two-stage hybrid routing algorithm. The algorithm combines merits of the unstructured Flooding routing algorithm and the structured Pastry routing algorithm. We divide the whole network to two levels,namely,virtual node net and sub-node net. They respectively adopt different routing algorithm. Experiments show that the hybrid routing algorithm can effectively reduce the hot spots problem and instability in the process of routing and improved routing efficiency.
【Key words】 Peer-to-Peer; virtual node; child node; two-stage hybrid routing;
- 【会议录名称】 2009年全国开放式分布与并行计算机学术会议论文集(上册)
- 【会议名称】2009年全国开放式分布与并行计算机学术会议
- 【会议时间】2009-09-26
- 【会议地点】中国新疆乌鲁木齐
- 【分类号】TP393.02
- 【主办单位】中国计算机学会开放系统专业委员会