A generic approach to make structured peer-to-peer systems topology-aware

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the help of distributed hash tables, the structured peer-to-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and physical network is the barrier to build an effective peer-to-peer system in the large-scale environment. In this paper, we propose a generic approach to solve this problem, which is quite different from other protocol-dependent methods. We reserve the structure of system and break the coupling between the node and its identifier by swap operations. We also propose several policies to reduce the traffic overhead. The policies include adaptive probing and shadow scheme. The experiment shows that our approach can greatly reduce the average latency of overlay networks and the overhead is controllable. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Qiu, T., Wu, F., & Chen, G. (2005). A generic approach to make structured peer-to-peer systems topology-aware. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3758 LNCS, pp. 816–826). https://doi.org/10.1007/11576235_81

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free