ERASP: an efficient and robust adaptive superpeer overlay network

Authors:
Wenjun Liu;Jiguo Yu;Jingjing Song;Xiaoqing Lan;Baoxiang Cao
Affiliations:
School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, P.R. China;School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, P.R. China;School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, P.R. China;School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, P.R. China;School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, P.R. China
Venue:
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Year:
2008

Citing 6
Cited 0

Towards a Hierarchical, Semantic Peer-to-Peer Topology

P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
A Robust Protocol for Building Superpeer Overlay Topologies

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Constructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
KZCAN: A Kautz Based Content-Addressable Network

SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02
REIK: A Novel P2P Overlay Network with Byzantine Fault Tolerance

SKG '07 Proceedings of the Third International Conference on Semantics, Knowledge and Grid
A topology adaptation protocol for structured superpeer overlay construction

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of superpeer (SP) has been introduced to improve the performance of popular file-sharing applications. However, the current constructing protocols are inefficient. In this paper an efficient and robust adaptive superpeer P2P overlay network ERASP is proposed. It is based on the well-known gossip paradigm and takes capacity and online time into account to estimate the network requirements for constructing and maintaining superpeer network. Additionally, the connectivity from client peers to SPs is strengthened. Experiment results show that ERASP is more efficient and robust than current related protocols.