@inproceedings{982873,
	title = {LAND: stretch (1 + \&\#949;) locality-aware networks for DHTs},
	address = {Philadelphia, PA, USA},
	author = {Ittai Abraham and Dahlia Malkhi and Oren Dobzinski},
	booktitle = {SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms},
	pages = {550--559},
	publisher = {Society for Industrial and Applied Mathematics},
	url = {http://portal.acm.org/citation.cfm?id=982873},
	year = {2004},
	biburl = {http://www.bibsonomy.org/bibtex/2bca9bc3c594cad38e7e7820a174353ff/viv},
	description = {LAND},
	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.},
	location = {New Orleans, Louisiana}, isbn = {0-89871-558-X},
	keywords = {location-aware overlays peer-to-peer structured-overlay }
}