Fast data replenishment in peer to peer networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/rf55zb59f

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Peer-to-Peer (P2P) based distributed storage systems have gain much popularity in recent years. These systems rely greatly on the data redundancy to be robust under network dynamics, i.e., the dynamics of peer entering and departing the network. Hence, it is important to implement mechanisms for maintaining a certain level of data redundancy at all times in the network. One such mechanism is called distributed data replenishment which attempts to repair data due to a peer failure or departure in a distributed manner. Such distributed data replenishment schemes make use of the well-known Repetition code, the Reed Solomon code, or recently the Random Linear Network Coding techniques. However, these schemes do not consider bandwidth associated with peers during the replenishment. In this thesis we explore techniques for fast replenishment by taking into consideration the bandwidth capacities of peer links. Specifically, we formulate the problem of fast replenishment via linear programing framework. Our simulation results indicate that the proposed fast replenishment significantly outperforms the current approach under many typical network scenarios.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2011-09-21T21:53:45Z (GMT) No. of bitstreams: 1 DhamodaranArulN2012.pdf: 1211586 bytes, checksum: 14931d2d2a37e0826b1846b438db6f71 (MD5)
  • description.provenance : Submitted by Arul Dhamodaran (dhamodaa@onid.orst.edu) on 2011-09-19T15:41:14Z No. of bitstreams: 1 DhamodaranArulN2012.pdf: 1211586 bytes, checksum: 14931d2d2a37e0826b1846b438db6f71 (MD5)
  • description.provenance : Made available in DSpace on 2011-09-21T21:53:46Z (GMT). No. of bitstreams: 1 DhamodaranArulN2012.pdf: 1211586 bytes, checksum: 14931d2d2a37e0826b1846b438db6f71 (MD5) Previous issue date: 2011-09-12
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2011-09-19T18:25:50Z (GMT) No. of bitstreams: 1 DhamodaranArulN2012.pdf: 1211586 bytes, checksum: 14931d2d2a37e0826b1846b438db6f71 (MD5)

Relationships

In Administrative Set:
Last modified: 08/15/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items