Sciweavers

346 search results - page 21 / 70
» Routing networks for distributed hash tables
Sort
View
DSN
2005
IEEE
14 years 1 months ago
Perturbation-Resistant and Overlay-Independent Resource Discovery
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...
Steven Y. Ko, Indranil Gupta
IPTPS
2004
Springer
14 years 27 days ago
When Multi-hop Peer-to-Peer Lookup Matters
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
Rodrigo Rodrigues, Charles Blake
IWNAS
2008
IEEE
14 years 1 months ago
POND: The Power of Zone Overlapping in DHT Networks
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
ICDCS
2010
IEEE
13 years 6 months ago
'Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks
—Networks based on Ethernet bridging scale poorly as bridges flood the entire network repeatedly, and several schemes have been proposed to mitigate this flooding problem; howe...
Dhananjay Sampath, Suchit Agarwal, J. J. Garcia-Lu...
SIGIR
2004
ACM
14 years 29 days ago
Bookmark-driven Query Routing in Peer-to-Peer Web Search
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...
Matthias Bender, Sebastian Michel, Gerhard Weikum,...