Peer-exchange schemes to handle mismatch in peer-to-peer systems

  • Authors:

  • Tongqing Qiu;Edward Chan;Mao Ye;Guihai Chen;Ben Y. Zhao

  • Affiliations:

  • Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong and State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, China;Department of Computer Science, University of California, Santa Barbara, USA

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of an underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a better logical topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogenous environment where nodes have different processing capabilities.