Sciweavers

323 search results - page 41 / 65
» Range-capable Distributed Hash Tables
Sort
View
NSDI
2004
15 years 1 months ago
Untangling the Web from DNS
The Web relies on the Domain Name System (DNS) to resolve the hostname portion of URLs into IP addresses. This marriage-of-convenience enabled the Web's meteoric rise, but th...
Michael Walfish, Hari Balakrishnan
IJNSEC
2008
95views more  IJNSEC 2008»
14 years 11 months ago
SurePath: An Approach to Resilient Anonymous Routing
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
Yingwu Zhu, Yiming Hu
EUROPAR
2009
Springer
15 years 3 months ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
INFOCOM
2006
IEEE
15 years 5 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
15 years 12 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez