Sciweavers

343 search results - page 36 / 69
» Weighted distributed hash tables
Sort
View
MDM
2007
Springer
131views Communications» more  MDM 2007»
14 years 5 months ago
Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access t...
Michele Albano, Stefano Chessa, Francesco Nidito, ...
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
14 years 4 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
PODC
2003
ACM
14 years 4 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
P2P
2008
IEEE
14 years 5 months ago
P2P Information Retrieval and Filtering with MAPS
In this demonstration paper we present MAPS, a novel system that combines approximate information retrieval and filtering functionality in a peer-to-peer setting. In MAPS, a user...
Christian Zimmer, Johannes Heinz, Christos Tryfono...
INFOCOM
2007
IEEE
14 years 5 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