PChord : Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity(Peer-to-Peer Computing, <Special Section> Parallel/Distributed Computing and Networking)
スポンサーリンク
概要
- 論文の詳細を見る
Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which is called PChord. PChord aims to achieve better routing efficiency than Chord by exploiting proximity of the underlying network topology. The simulation shows that PChord has achieved lower RDP per message routing.
- 社団法人電子情報通信学会の論文
- 2006-02-01
著者
-
Hong Feng
The Department Of Computer Science & Engineering Shanghai Jiao Tong University
-
LI Minglu
the Department of Computer Science & Engineering, Shanghai Jiao Tong University
-
WU Minyou
the Department of Computer Science & Engineering, Shanghai Jiao Tong University
-
YU Jiadi
the Department of Computer Science & Engineering, Shanghai Jiao Tong University
-
Yu Jiadi
The Department Of Computer Science & Engineering Shanghai Jiao Tong University
-
Li Minglu
The Department Of Computer Science & Engineering Shanghai Jiao Tong University
-
Wu Minyou
The Department Of Computer Science & Engineering Shanghai Jiao Tong University
関連論文
- PChord : Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity(Peer-to-Peer Computing, Parallel/Distributed Computing and Networking)
- An Online Scheduling Algorithm for Assigning Jobs in the Computational Grid(Grid Computing, Parallel/Distributed Computing and Networking)
- ECA Rule-Based Workflow Modeling and Implementation for Service Composition(Grid Computing, Parallel/Distributed Computing and Networking)