Approaching Optimal Peer-to-Peer Overlays

Authors:
Yunhao Liu;Lionel M. Ni;Li Xiao;Abdol-Hossein Esfahanian
Affiliations:
Dept. of Computer Science, Hong Kong University of Science and Technology, Hong Kong;Dept. of Computer Science, Hong Kong University of Science and Technology, Hong Kong;Dept. of Computer Science and Engineering, Michigan State University, USA;Dept. of Computer Science and Engineering, Michigan State University, USA
Venue:
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
2005

Citing 0
Cited 6

Dubious feedback: fair or not?

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networks

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
pFusion: A P2P Architecture for Internet-Scale Content-Based Search and Retrieval

IEEE Transactions on Parallel and Distributed Systems
A multi-swarm approach for neighbor selection in peer-to-peer networks

CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem

INFORMS Journal on Computing
HAND: an overlay optimization algorithm in peer-to-peer systems

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In unstructured peer-to-peer (P2P) systems, there exists a serious topology mismatch problem between physical and logical network. We first analyze the relationship between the property of the overlay and the corresponding message duplications incurred by queries in a given overlay, and prove that computing an optimal overlay with global knowledge is an NP-hard problem. Motivated by the analysis results, we design a distributed overlay optimization algorithm, THANCS, to attack topology mismatch. We demonstrate its performance by comprehensive simulations in dynamic environments. The proposed THANCS has three major strengths. First, it does not need any global knowledge. Second, its optimization convergent speed is fast. Third, it is orthogonal with other types of advanced search approaches.