research-article

PeerCluster: A Cluster-Based Peer-to-Peer System

Authors:

Cheng-Yue Chang,

Ming-Syan ChenAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 17, Issue 10

Pages 1110 - 1123

https://doi.org/10.1109/TPDS.2006.142

Published: 01 October 2006 Publication History

Abstract

This paper proposes a cluster-based peer-to-peer system, called PeerCluster, for sharing data over the Internet. In PeerCluster, all participant computers are grouped into various interest clusters, each of which contains computers that have the same interests. The intuition behind the system design is that by logically grouping users interested in similar topics together, we can improve query efficiency. To efficiently route and broadcast messages across/within interest clusters, a hypercube topology is employed. In addition, to ensure that the structure of the interest clusters is not altered by arbitrary node insertions/deletions, we have devised corresponding JOIN and LEAVE protocols. The complexities of these protocols are analyzed. Moreover, we augment PeerCluster with a system recovery mechanism to make it robust against unpredictable computer/network failures. Using an event-driven simulation, we evaluate the performance of our approach by varying several system parameters. The experimental results show that PeerCluster outperforms previous approaches in terms of query efficiency, while still providing the desired functionality of keyword-based search.

References

[1]

Open Directory Project (ODP),

[2]

The Discussion Board of eDonkey,

[3]

K. Aberer, “P-Grid: A Self-Organizing Access Structure for P2P Information Systems,” Proc. Int'l Conf. Cooperative Information Systems, 2001.

Digital Library

[4]

L. Bhuyan and D.P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” vol. 33, pp. 323-333, 1984.

Digital Library

[5]

T.F. Chan and Y. Saad, “Multigrid Algorithms on the Hypercube Multiprocessor,” IEEE Trans. Computers, vol. 35, no. 11, pp. 969-977, Nov. 1986.

Digital Library

[6]

Y. Chawathe, S. Ratnasamy, B.L.N. Lanham, and S. Shenker, “Making Gnutella-Link P2P Systems Scalable,” Proc. SIGCOMM '03, 2003.

Digital Library

[7]

M.S. Chen, P.S. Yu, and K.L. Wu, “Optimal NODUP All-to-All Broadcasting Schemes in Distributed Computing Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 1275-1285, 1994.

Digital Library

[8]

Clip2.com, The Gnutella Protocol Specification V0.4,

[9]

E. Cohen, A. Fiat, and H. Kaplan, “Associative Search in Peer to Peer Networks: Harnessing Latent Semantics,” Proc. IEEE INFOCOM '03, 2003.

[10]

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press/McGraw-Hill Book Company, 1990.

Digital Library

[11]

A. Crespo, “Routing Indices for Peer-to-Peer Systems,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.

Digital Library

[12]

N. Gunther, “Hypernets— Good (G)news for Gnutella,”

[13]

F. Harary, Graph Theory. Mass.: Addison-Wesley, 1969.

[14]

J. Liebeherr and T.K. Beam, “HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology,” Proc. First Int'l Workshop Networked Group Comm. (NGC '99), 1999.

Digital Library

[15]

Q. Liv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Network,” Proc. ACM SIGMETRIC '02, 2002.

Digital Library

[16]

Napster Inc., Napster Website,

[17]

W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. Lser, “Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks,” Proc. 12th Int'l World Wide Web Conf. (WWW '03), 2003.

Digital Library

[18]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. SIGCOMM '01, 2001.

Digital Library

[19]

P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/USENIX Middleware Conf., 2003.

Digital Library

[20]

J. Ritter, “Why Gnutella Can't Scale? No, Really,”

[21]

A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), 2001.

Digital Library

[22]

M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, “A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services,” Proc. Second Int'l Conf. Peer-to-Peer Computing, pp. 104-111, 2002.

Digital Library

[23]

K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,”

[24]

K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location and Retrieval in Peer-to-Peer Systems by Exploiting Locality in Interests,” Proc. ACM SIGCOMM '01, 2001.

[25]

K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. IEEE INFOCOM '03, 2003.

[26]

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. SIGCOMM '01, 2001.

Digital Library

[27]

G. Vrana, Peering through the Peer-to-Peer Fog, EDN Access (

[28]

B. Yang and H. Garcia-Molina, “Comparing Hybrid Peer-to-Peer Systems,” Proc. Very Large Data Bases Conf. (VLDB), 2001.

Digital Library

[29]

B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Systems,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.

Digital Library

[30]

B.Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide Area Location and Routing,” Technical Report UCB/CSD-01-1141, Univ. of California at Berkeley, 2001.

Digital Library

Cited By

Andriopoulou FBirkos KLymberopoulos D(2017)A Novel Hierarchical Group-Based Overlay Healthcare NetworkInternational Journal of E-Health and Medical Communications10.4018/IJEHMC.20171001058:4(81-102)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.4018/IJEHMC.2017100105
Noor FAlhaisoni MMayrhofer RChen LSteinbauer MKotsis GKhalil I(2013)Fingerprint Verification through Cloud ComputingProceedings of International Conference on Advances in Mobile Computing & Multimedia10.1145/2536853.2536902(301-306)Online publication date: 2-Dec-2013
https://dl.acm.org/doi/10.1145/2536853.2536902
Abraham ALiu HHassanien A(2011)Multi swarms for neighbor selection in peer-to-peer overlay networksTelecommunications Systems10.1007/s11235-010-9285-346:3(195-208)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1007/s11235-010-9285-3
Show More Cited By

Index Terms

PeerCluster: A Cluster-Based Peer-to-Peer System

Recommendations

Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems

Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an ...
C²: a new overlay network based on CAN and Chord

In this paper, we present C², a new overlay network based on CAN and Chord. It is primarily designed for a dynamic environment in which peers join and depart the network frequently. For an n-peers C² system, each peer maintains only about O(log n) of ...
Storing and Indexing Spatial Data in P2P Systems

The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 17, Issue 10

October 2006

159 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © 2006.

Publisher

IEEE Press

Publication History

Published: 01 October 2006

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Andriopoulou FBirkos KLymberopoulos D(2017)A Novel Hierarchical Group-Based Overlay Healthcare NetworkInternational Journal of E-Health and Medical Communications10.4018/IJEHMC.20171001058:4(81-102)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.4018/IJEHMC.2017100105
Noor FAlhaisoni MMayrhofer RChen LSteinbauer MKotsis GKhalil I(2013)Fingerprint Verification through Cloud ComputingProceedings of International Conference on Advances in Mobile Computing & Multimedia10.1145/2536853.2536902(301-306)Online publication date: 2-Dec-2013
https://dl.acm.org/doi/10.1145/2536853.2536902
Abraham ALiu HHassanien A(2011)Multi swarms for neighbor selection in peer-to-peer overlay networksTelecommunications Systems10.1007/s11235-010-9285-346:3(195-208)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1007/s11235-010-9285-3
Abraham ALiu HBadr YGrosan CZadeh LBadr YAbraham AOhsawa YChbeir RFerri FKoeppen MLaurent D(2008)A multi-swarm approach for neighbor selection in peer-to-peer networksProceedings of the 5th international conference on Soft computing as transdisciplinary science and technology10.1145/1456223.1456263(178-184)Online publication date: 28-Oct-2008
https://dl.acm.org/doi/10.1145/1456223.1456263

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents