LAND: stretch (1 + &\#949;) locality-aware networks for DHTs
I. Abraham, D. Malkhi, and O. Dobzinski. SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, page 550--559. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2004)
Abstract
This paper proposes the first peer-to-peer network and lookup algorithm that for any 0 < ε has worst case stretch bounded by 1 + ε. The construction uses an expected logarithmic number of links. It is suitable for a very realistic class of metrics in which the only restriction on density is a growth-bound. It is completely decentralized and readily deployable in dynamic networks.
%0 Conference Paper
%1 982873
%A Abraham, Ittai
%A Malkhi, Dahlia
%A Dobzinski, Oren
%B SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
%C Philadelphia, PA, USA
%D 2004
%I Society for Industrial and Applied Mathematics
%K location-aware overlays peer-to-peer structured-overlay
%P 550--559
%T LAND: stretch (1 + &\#949;) locality-aware networks for DHTs
%U http://portal.acm.org/citation.cfm?id=982873
%X This paper proposes the first peer-to-peer network and lookup algorithm that for any 0 < ε has worst case stretch bounded by 1 + ε. The construction uses an expected logarithmic number of links. It is suitable for a very realistic class of metrics in which the only restriction on density is a growth-bound. It is completely decentralized and readily deployable in dynamic networks.
%@ 0-89871-558-X
@inproceedings{982873,
abstract = {This paper proposes the first peer-to-peer network and lookup algorithm that for any 0 < ε has worst case stretch bounded by 1 + ε. The construction uses an expected logarithmic number of links. It is suitable for a very realistic class of metrics in which the only restriction on density is a growth-bound. It is completely decentralized and readily deployable in dynamic networks.},
added-at = {2008-02-25T14:28:51.000+0100},
address = {Philadelphia, PA, USA},
author = {Abraham, Ittai and Malkhi, Dahlia and Dobzinski, Oren},
biburl = {https://www.bibsonomy.org/bibtex/2bca9bc3c594cad38e7e7820a174353ff/viv},
booktitle = {SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms},
description = {LAND},
interhash = {e2ccdd4a9d4a3170396185c723048bd7},
intrahash = {bca9bc3c594cad38e7e7820a174353ff},
isbn = {0-89871-558-X},
keywords = {location-aware overlays peer-to-peer structured-overlay},
location = {New Orleans, Louisiana},
pages = {550--559},
publisher = {Society for Industrial and Applied Mathematics},
timestamp = {2008-02-25T14:28:51.000+0100},
title = {LAND: stretch (1 + \&\#949;) locality-aware networks for DHTs},
url = {http://portal.acm.org/citation.cfm?id=982873},
year = 2004
}