Super-proximity routing in structured peer-to-peer overlay networks.
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.
Wu
Zeng-de
ZD
Department of Computer Science & Engineering, Shanghai Jiaotong University, Shanghai 200030, China. wu-zd@cs.sjtu.edu.cn
Rao
Wei-xiong
WX
Ma
Fan-yuan
FY
D000465:Algorithms; D001185:Artificial Intelligence; D003205:Computing Methodologies; D016247:Information Storage and Retrieval / Q000379:methods*; D020407:Internet; D010363:Pattern Recognition, Automated; D012815:Signal Processing, Computer-Assisted