,

LAND: stretch (1 + &\#949;) locality-aware networks for DHTs

, , и .
SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, стр. 550--559. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2004)

Аннотация

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.

тэги

Пользователи данного ресурса

  • @viv

Комментарии и рецензии