Sciweavers

456 search results - page 79 / 92
» On Routing in Distributed Hash Tables
Sort
View
TOIS
2002
97views more  TOIS 2002»
14 years 9 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 7 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
IPPS
2007
IEEE
15 years 3 months ago
VoroNet: A scalable object network based on Voronoi tessellations
In this paper, we propose the design of VoroNet, an objectbased peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental...
Olivier Beaumont, Anne-Marie Kermarrec, Loris Marc...
118
Voted
BROADNETS
2005
IEEE
15 years 3 months ago
A Lightweight framework for source-to-sink data transfer in wireless sensor networks
— Lightweight protocols that are both bandwidth and power thrifty are desirable for sensor networks. In addition, for many sensor network applications, timeliness of data deliver...
James Jobin, Zhenqiang Ye, Honomount Rawat, Srikan...
COMCOM
2008
80views more  COMCOM 2008»
14 years 9 months ago
Transforming general networks into feed-forward by using turn-prohibition
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...
Juan Echagüe, Jesús E. Villadangos, Vi...