Sciweavers

347 search results - page 15 / 70
» Consistency-based routing in overlay networks
Sort
View
NSDI
2004
13 years 8 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
DSN
2004
IEEE
13 years 11 months ago
Impact of Path Diversity on Multi-homed and Overlay Networks
Multi-homed and overlay networks are two widely studied approaches aimed at leveraging the inherent redundancy of the Internet's underlying routing infrastructure to enhance ...
Junghee Han, Farnam Jahanian
KIVS
2005
Springer
14 years 1 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
SOSP
2001
ACM
14 years 4 months ago
Resilient Overlay Networks
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance with...
David G. Andersen, Hari Balakrishnan, M. Frans Kaa...
GCC
2004
Springer
14 years 26 days ago
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
Ming Li, Jinfeng Hu, Haitao Dong, Dongsheng Wang, ...