Sciweavers

346 search results - page 64 / 70
» Routing networks for distributed hash tables
Sort
View
INFOCOM
2006
IEEE
15 years 11 months ago
A Comparative Study of the DNS Design with DHT-Based Alternatives
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
AP2PC
2005
Springer
15 years 11 months ago
Highly Available DHTs: Keeping Data Consistency After Updates
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
SRDS
2006
IEEE
15 years 11 months ago
Deleting Files in the Celeste Peer-to-Peer Storage System
Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the d...
Gal Badishi, Germano Caronni, Idit Keidar, Raphael...
SIGCOMM
1999
ACM
15 years 10 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
PODC
2006
ACM
15 years 11 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille