Sciweavers

346 search results - page 28 / 70
» Routing networks for distributed hash tables
Sort
View
PODC
2003
ACM
14 years 24 days ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
IPTPS
2003
Springer
14 years 22 days ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
INFOCOM
2007
IEEE
14 years 1 months ago
Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast
Abstract— This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network. Using a node residual lifetim...
Guang Tan, Stephen A. Jarvis
ICC
2007
IEEE
105views Communications» more  ICC 2007»
14 years 1 months ago
Wheel of Trust: A Secure Framework for Overlay-Based Services
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...
Guor-Huar Lu, Zhi-Li Zhang
SIGCOMM
2003
ACM
14 years 24 days ago
Making gnutella-like P2P systems scalable
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized sea...
Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nic...