Sciweavers

447 search results - page 74 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
TOIS
2002
97views more  TOIS 2002»
14 years 11 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
GLOBECOM
2010
IEEE
14 years 9 months ago
Analysis of Messaging Load in a P2PP Overlay Network under Churn
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
Otso Kassinen, Erkki Harjula, Mika Ylianttila
GLOBECOM
2006
IEEE
15 years 5 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...
MSN
2007
Springer
192views Sensor Networks» more  MSN 2007»
15 years 5 months ago
Secure Group Communication with Self-healing and Rekeying in Wireless Sensor Networks
We have developed a self-healing key distribution scheme for secure multicast group communications for wireless sensor network environment. We present a strategy for securely distr...
Firdous Kausar, Sajid Hussain, Jong Hyuk Park, Ash...
SC
2004
ACM
15 years 5 months ago
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Cluster-based storage systems are popular for data-intensive applications and it is desirable yet challenging to provide incremental expansion and high availability while achievin...
Hong Tang, Aziz Gulbeden, Jingyu Zhou, William Str...