Reducing data replication overhead in DHT based peer-to-peer system

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 150
  • Download : 0
DHT based p2p systems are appeared to provide scalable storage services with idle resource from many unreliable clients. If a DHT is used in storage intensive applications where data loss must be minimized, quick replication is especially important to replace lost redundancy on other nodes in reaction to failures. To achieve this easily, the simple replication method directly uses the consistent set such as the leaf set and the successor list. However, this set is tightly coupled to the current state of nodes and the traffic needed to support this replication can be high and bursty under churn. This paper explores efficient replication methods that only glimpse the consistent set to select a new replica. We propose two types of replication methods : Quorum based replication and Availability based replication. The replicas are loosely coupled to the consistent set and can eliminate the compulsory replication under chum. Results from a simulation study suggest that our methods can reduce network traffic enormously and achieve high data availability in a DHT based p2p storage system.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2006
Language
English
Article Type
Article; Proceedings Paper
Citation

LECTURE NOTES IN COMPUTER SCIENCE, v.4208, pp.915 - 924

ISSN
0302-9743
URI
http://hdl.handle.net/10203/86375
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0