Sciweavers

323 search results - page 4 / 65
» Range-capable Distributed Hash Tables
Sort
View
DEBS
2010
ACM
13 years 7 days ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis
ICDCSW
2007
IEEE
13 years 11 months ago
Survey of Six Myths and Oversights about Distributed Hash Tables' Security
Distributed Hash Tables (DHT) was not designed to be secure against malicious users. But some secure systems like trust and reputation management algorithms trust DHT with their d...
Sylvain Dahan, Mitsuhisa Sato
P2P
2006
IEEE
101views Communications» more  P2P 2006»
13 years 11 months ago
Towards Scalable Mobility in Distributed Hash Tables
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
Olaf Landsiedel, Stefan Götz, Klaus Wehrle
BROADCOM
2008
IEEE
13 years 11 months ago
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....
CCR
2004
113views more  CCR 2004»
13 years 5 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim