Sciweavers

346 search results - page 31 / 70
» Routing networks for distributed hash tables
Sort
View
JCST
2008
203views more  JCST 2008»
13 years 7 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
14 years 9 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...
IPTPS
2003
Springer
14 years 22 days ago
Sloppy Hashing and Self-Organizing Clusters
We are building Coral, a peer-to-peer content distribution system. Coral creates self-organizing clusters of nodes that fetch information from each other to avoid communicating wi...
Michael J. Freedman, David Mazières
GLOBECOM
2008
IEEE
13 years 8 months ago
Evaluating P2PSIP under Attack: An Emulative Study
— Recently, establishing a VoIP call using a P2P network instead of regular SIP-servers has been proposed; this novel approach to SIP-signaling is commonly referred to as P2PSIP ...
Jan Seedorf, Frank Ruwolt, Martin Stiemerling, Sav...
WWW
2008
ACM
14 years 8 months ago
Xml data dissemination using automata on top of structured overlay networks
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
Iris Miliaraki, Zoi Kaoudi, Manolis Koubarakis