首页 | 本学科首页   官方微博 | 高级检索  
     

动态概率探测解决Chord断环问题
引用本文:黄琰,周学海,李曦.动态概率探测解决Chord断环问题[J].计算机工程与应用,2006,42(36):121-123.
作者姓名:黄琰  周学海  李曦
作者单位:中国科学技术大学,计算机系,合肥,230027;中国科学技术大学,计算机系,合肥,230027;中国科学技术大学,计算机系,合肥,230027
摘    要:Chord环是目前常见的一种基于分布式哈希表的P2 Poverlay模型,在该模型上可承载即时通讯、语音、视频等多种业务。Chord自身机制提供良好的路由算法并支持动态节点加入退出,然而由于网络震荡导致的Chord断环在自适应系统中是一个难以解决的问题,提出了一种动态概率探测对Chord断环是一种简单高效的解决方法。动态概率探测不依赖于环上节点规模和初始探测概率,并可有效控制单点负载和探测断环引入的额外通讯负载。

关 键 词:Chord环  断环侦测  对等网络
文章编号:1002-8331(2006)36-0121-03
收稿时间:2006-04
修稿时间:2006-04

Dynamic Probability Detecting to Solve Splitting of Chord
HUANG Yan,ZHOU Xue-hai,LI Xi.Dynamic Probability Detecting to Solve Splitting of Chord[J].Computer Engineering and Applications,2006,42(36):121-123.
Authors:HUANG Yan  ZHOU Xue-hai  LI Xi
Affiliation:Department of Computer Science and Technology,University of Science and Technology of China, Hefei 230027, China
Abstract:Chord is a common distributed hash table based P2P overlay model,there have many applications such as instant message,voice and video stream on this model.Chord itself has already provided abundant mechanism to support the node join and quit dynamically.However,Chord has no proper method to self-detect the split of the loop.This article proposes a simple and effective method to solve this split detecting problem.Dynamic probability detecting doesn't rely on the initial probability and can effectively control the overload of the hot point and the whole system.
Keywords:Chord  split detecting  Peer-to-Peer network
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号