|
Published Articles >> Table of Contents >> Abstract
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers
p. 26a
Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network
Haiying Shen, Wayne State University
Cheng-Zhong Xu, Wayne State University
Guihai Chen, Nanjing University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1302935
Send link to a friend
| Abstract |
|
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(log n) hops per lookup request with O(log n) neighbors per node, where n is the network size. In this paper, we present a constant-degree P2P architecture, namely Cycloid, which emulates a Cube-Connected-Cycles (CCC) graph in the routing of lookup requests. It achieves a time complexity of O(d) per lookup request by using O(1) neighbors per node, where n = d · 2^d. We compare Cycloid with other two constant-degree systems, Viceroy and Koorde in various architectural aspects via simulation. Simulation results show that Cycloid has more advantages for large scale and dynamic systems that have frequent node arrivals and departures. In particular, Cycloid delivers a higher location ef.ciency in the average case and exhibits a more balanced distribution of keys and query loads between the nodes.
|
 Additional Information
|
Citation:
Haiying Shen, Cheng-Zhong Xu, Guihai Chen,
"Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network,"
ipdps,
p. 26a,
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers,
2004
|
|
