Sciweavers

447 search results - page 70 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 11 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
VLDB
2005
ACM
117views Database» more  VLDB 2005»
15 years 5 months ago
Data Sharing in the Hyperion Peer Database System
This demo presents Hyperion, a prototype system that supports data sharing for a network of independent Peer Relational Database Management Systems (PDBMSs). The nodes of such a n...
Patricia Rodríguez-Gianolli, Maddalena Garz...
EUROPAR
2007
Springer
15 years 5 months ago
Securing Sensor Reports in Wireless Sensor Networks*
Abstract. The sensor reports from a wireless sensor network are often used extensively in the decision making process in many systems and applications. Hence, classifying real and ...
Al-Sakib Khan Pathan, Choong Seon Hong
ICDCSW
2006
IEEE
15 years 5 months ago
Network-Aware Overlays with Network Coordinates
Network coordinates, which embed network distance measurements in a coordinate system, were introduced as a method for determining the proximity of nodes for routing table updates...
Peter R. Pietzuch, Jonathan Ledlie, Michael Mitzen...
INFOCOM
2005
IEEE
15 years 5 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...