Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks

  • Authors:
  • Affiliations:
  • Venue:
  • FTDCS '04 Proceedings of the 10th IEEE International Workshop on Future Trends of Distributed Computing Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

DHTs can locate objects in a peer-to-peer networkwithin an efficient amount of overlay hops. Since anoverlay hop is likely to consist of multiple physical hops,the ratio between the number of physical hops induced bythe overlay routing process and the number of physicalhops on a direct physical path is often significantlylopsided. Recently, some approaches have been suggestedto optimize that ratio by building topology-aware peer-to-peeroverlays. However, none of them were explicitlydesigned to handle node mobility.We present an approach that optimizes the overlay vs.direct physical path ratio and maintains it even in thepresence of node mobility. Thus, it is well suited forhighly dynamic networks, such as ad-hoc networks.