Super-proximity routing in structured peer-to-peer overlay networks  

作　　者：吴增德 饶卫雄 马范援 

机构地区：[1]DepartmentofComputerScience＆Engineering,ShanghaiJiaotongUniversity,Shanghai200030,China

出　　处：《Journal of Zhejiang University Science》2004年第1期16-21,共6页浙江大学学报（自然科学英文版）

摘　　要：Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.Peer-to-Peer systems are emerging as one of the most popular Intemet applications. Structured Peer-to-Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super-proximity routing algorithms presented in this paper combine Internet topology and over|ay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer-to-Peer routing.

关 键 词：ROUTING Peer  to  Peer network Distributed systems INTERNET 

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