Sciweavers

153 search results - page 10 / 31
» Towards Scalable Mobility in Distributed Hash Tables
Sort
View
AUTONOMICS
2008
ACM
13 years 11 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
CCGRID
2011
IEEE
13 years 1 months ago
DHTbd: A Reliable Block-Based Storage System for High Performance Clusters
—Large, reliable and efficient storage systems are becoming increasingly important in enterprise environments. Our research in storage system design is oriented towards the expl...
George Parissis, George Xylomenos, Theodore K. Apo...
COMPSAC
2004
IEEE
14 years 1 months ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang
KIVS
2005
Springer
14 years 3 months ago
Making Chord go mobile
: The Chord protocol is a structured Peer-to-Peer (P2P) protocol based on distributed hash tables (DHT). By using hash keys to identify the nodes in the network and also the shared...
Stefan Zöls, Rüdiger Schollmeier, Wolfga...
INFOCOM
2007
IEEE
14 years 4 months ago
On the Stability-Scalability Tradeoff of DHT Deployment
— Distributed hash tables (DHTs) provide efficient data naming and location with simple hash-table-like primitives, upon which sophisticated distributed applications can be buil...
Chih-Chiang Wang, Khaled Harfoush