Cycloid: a constant-degree and lookup-efficient P2P overlay network

Authors:
Haiying Shen;Cheng-Zhong Xu;Guihai Chen
Affiliations:
Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI;Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China
Venue:
Performance Evaluation - P2P computing systems
Year:
2006

Citing 12
Cited 22

Group action graphs and parallel architectures

SIAM Journal on Computing
Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Comparing Hybrid Peer-to-Peer Systems

Proceedings of the 27th International Conference on Very Large Data Bases
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Atomic Data Access in Distributed Hash Tables

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks

IEEE Journal on Selected Areas in Communications

Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks

Journal of Parallel and Distributed Computing
Paths to stardom: calibrating the potential of a peer-based data management system

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A P2P-based intelligent resource discovery mechanism in Internet-based distributed systems

Journal of Parallel and Distributed Computing
P2P Networking and Applications

P2P Networking and Applications
PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Echo: A peer-to-peer clustering framework for improving communication in DHTs

Journal of Parallel and Distributed Computing
An interest-based P2P file sharing system

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
PeerLearning: A Content-Based e-Learning Material Sharing System Based on P2P Network

World Wide Web
Randomized load balancing strategies with churn resilience in peer-to-peer networks

Journal of Network and Computer Applications
Making a case for distributed file systems at Exascale

Proceedings of the third international workshop on Large-scale system and application performance
Psu: a novel low-latency constant-degree overlay network

Frontiers of Computer Science in China
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions

Computer Communications
Exploring distributed hash tables in HighEnd computing

ACM SIGMETRICS Performance Evaluation Review
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications

International Journal of Communication Systems
HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity

Journal of Network and Computer Applications
CDACAN: a scalable structured P2P network based on continuous discrete approach and CAN

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
CycloidGrid: A proximity-aware P2P-based resource discovery architecture in volunteer computing systems

Future Generation Computer Systems
KMcube: the compound of Kautz digraph and Möbius cube

Frontiers of Computer Science: Selected Publications from Chinese Universities
A proximity-aware load balancing in peer-to-peer-based volunteer computing systems

The Journal of Supercomputing
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph

Theoretical Computer Science
A self-similar super-peer overlay construction scheme for super large-scale P2P applications

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

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 × 2d. 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 efficiency in the average case and exhibits a more balanced distribution of keys and query loads between the nodes.