An Efficient Clustered Architecture for P2P Networks

Authors:
Juan Li;Son Vuong
Affiliations:
-;-
Venue:
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Year:
2004

Citing 0
Cited 9

CBT: A proximity-aware peer clustering system in large-scale BitTorrent-like peer-to-peer networks

Computer Communications
A Strategy for Selecting Super-Peer in P2P and Grid Based Hybrid System

Edutainment '08 Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment
Improving peer-to-peer search performance through intelligent social search

Expert Systems with Applications: An International Journal
A broadband P2P MoD system: its implementation and application

International Journal of High Performance Computing and Networking
Reliable publish/subscribe middleware for time-sensitive internet-scale applications

Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
An analytical evaluation method based on generalised random graphs for unstructured peer-to-peer content-sharing systems

International Journal of Communication Networks and Distributed Systems
Distributed proximity-aware peer clustering in bittorrent-like peer-to-peer networks

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
An efficient cluster-hierarchy architecture model ECHP2P for p2p networks

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) computing offers many attractivefeatures, such as self-organization, load-balancing,availability, fault tolerance, and anonymity. However, italso faces some serious challenges. In this paper, wepropose an Efficient Clustered Super-Peer P2Parchitecture (ECSP) to overcome the scalability andefficiency problems of existing unstructured P2P system.With ECSP, peers are grouped into clusters according totheir topological proximity, and super-peers are selectedfrom regular peers to act as cluster leaders and serviceproviders. These super-peers are also connected to eachother, forming a backbone overlay network operating asa distinct, yet integrated, application. To maintain thedynamically adaptive overlay network and to manage therouting on it, we propose an application levelbroadcasting protocol: Efa. Applying only a smallamount of information about the topology of a network,Efa is as simple as flooding, a conventional method usedin unstructured P2P systems. By eliminating manyduplicated messages, Efa is much more efficient andscalable than flooding, and furthermore, it is completelydecentralized and self-organized. Our experimentalresults prove that ESCP architecture, combined with thesuper-peer backbone protocol, can generate impressivelevels of performance and scalability.