Building Topology-Aware Overlays Using Global Soft-State

  • Authors:
  • Zhichen Xu;Chunqiang Tang;Zheng Zhang

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed hash table (DHT) based overlay networks offer anadministration-free and fault-tolerant storage space that maps"keys" to "values". For these systems to function efficiently,their structures must fit that of the underlying network. Existingtechniques for discovering network proximity information, suchas landmark clustering and expanding-ring search are eitherinaccurate or expensive. The lack of global proximity informationin overlay construction and maintenance can result in badproximity approximation or excessive communication.To address these problems, we propose the following: (1)Combining landmark clustering and round-trip time (RTT) measurementsto generate proximity information, achieving both efficiencyand accuracy. (2) Controlled placement of globalproximity information on the system itself as soft-state, such thatnodes can independently access relevant information efficiently.(3) Publish/subscribe functionality that allows nodes to subscribeto the relevant soft-state and get notified as the state changesnecessitate overlay restructuring.