%0 Journal Article
%T Research of Network-delay-based P2P Routing Algorithm<br>基于网络延迟的P2P路由算法的研究
%A WANG Chuan-Shu
%A WANG Yi-Jie
%A <br>王传殊
%A 王意洁
%J 计算机科学
%D 2007
%I 
%X In recent years, most network bandwidth has been consumed by Peer-to-Peer (P2P)computing applications rather than WEB applications. However, peers in P2P systems choose logical neighbors randomly without any knowledge about underlying physical topology at present, which can decrease greatly the efficiency of message routing and consume more bandwidth. According to the principle that the neighbor peer in logical is also the physical neighbor, an improved Chord construct algorithm DeChord, is proposed. In DeChord, Global Network Position is utilized to compute the coordinate of peers, and then the distance between nodes is computed based on these coordinates. The consistency between logical distance and physical distance is considered when nodes join the system and the closer peers in the physical network are taken as neighbor peers. DeChord makes the information of routing table updated in time. DeChord can decrease the latency of every hop, therefore the latency of total message routing is decreased. Simulation results indicate that the performance of data location in the system that is constructed by DeChord can be significantly improved.
%K Peer-to-Peer computing
%K Chord
%K Node coordinate
%K Data location<br>对等计算
%K Chord
%K 节点坐标
%K 数据定位
%K 网络延迟
%K 路由算法
%K 研究
%K Routing
%K Algorithm
%K 网络延时
%K 数据定位
%K 模拟实验
%K 过程
%K 消息路由
%K 选择方式
%K 信息能
%K 路由表
%K 一致性
%K 物理距离
%K 计算节点
%K 点坐标
%K 系统计算
%K 网络定位
%K 利用
%K 定位算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=6A986D3869B8815242D85D058A5F302D&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=B31275AF3241DB2D&sid=2001E0D53B7B80EC&eid=BE33CC7147FEFCA4&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=14