Sciweavers

456 search results - page 2 / 92
» On Routing in Distributed Hash Tables
Sort
View
CIC
2003
140views Communications» more  CIC 2003»
13 years 6 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...
OPODIS
2010
13 years 2 months ago
SkewCCC+: A Heterogeneous Distributed Hash Table
Distributed Hash Tables (DHTs) enable fully distributed Peer-to-Peer network construction and maintenance with name-driven routing. There exist very few DHT approaches that conside...
Marcin Bienkowski, André Brinkmann, Marek K...
IPTPS
2004
Springer
13 years 10 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
SIGCOMM
2005
ACM
13 years 10 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...