Sciweavers

447 search results - page 44 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
DASFAA
2008
IEEE
105views Database» more  DASFAA 2008»
15 years 6 months ago
Redundant Array of Inexpensive Nodes for DWS
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...
SPAA
2005
ACM
15 years 5 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
ICDCSW
2003
IEEE
15 years 5 months ago
Foundations of Security for Hash Chains in Ad Hoc Networks
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
Phillip G. Bradford, Olga V. Gavrylyako
DASC
2006
IEEE
15 years 5 months ago
DRBTS: Distributed Reputation-based Beacon Trust System
Abstract— Wireless Sensor Networks (WSNs) have critical applications in diverse domains like environmental monitoring and military operations where accurate location of sensors i...
Avinash Srinivasan, Joshua Teitelbaum, Jie Wu
STACS
2012
Springer
13 years 7 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...