Show simple item record

dc.contributor.authorDruschel, Peter
Haeberlen, Andreas
Hoye, Jeff
Mislove, Alan
dc.date.accessioned 2017-08-02T22:03:03Z
dc.date.available 2017-08-02T22:03:03Z
dc.date.issued 2005-08-16
dc.identifier.urihttps://hdl.handle.net/1911/96342
dc.description.abstract Most structured peer-to-peer overlays rely on consistent hashing to determine the node that is responsible for a given key. For consistent hashing to work properly, it is necessary that the nodes have a consistent view of their neighborhood in the identifier space. However, if routing anomalies occur in the underlying network, this view can become inconsistent, causing unstable overlay behavior and, worse, allowing more than one node to assume responsibility for ranges of keys. We present a set of techniques for preventing inconsistencies under routing anomalies, and we propose to adopt strategies from mobile ad-hoc networking for maintaining connectivity in the presence of path failures. We evaluate our design in the context of Pastry and present results from a deployment in the PlanetLab testbed.
dc.format.extent 6 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Consistent Key Mapping in Structured Overlays
dc.type Technical report
dc.date.note August 16, 2005
dc.identifier.digital TR05-456
dc.type.dcmi Text
dc.identifier.citation Druschel, Peter, Haeberlen, Andreas, Hoye, Jeff, et al.. "Consistent Key Mapping in Structured Overlays." (2005) https://hdl.handle.net/1911/96342.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record