Sciweavers

343 search results - page 30 / 69
» Weighted distributed hash tables
Sort
View
DEXAW
2005
IEEE
134views Database» more  DEXAW 2005»
14 years 4 months ago
Enabling High Data Availability in a DHT
Many decentralized and peer-to-peer applications require some sort of data management. Besides P2P file-sharing, there are already scenarios (e.g. BRICKS project [3]) that need m...
Predrag Knezevic, Andreas Wombacher, Thomas Risse
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 4 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
PVLDB
2008
112views more  PVLDB 2008»
13 years 10 months ago
P2P logging and timestamping for reconciliation
In this paper, we address data reconciliation in peer-to-peer (P2P) collaborative applications. We propose P2P-LTR (Logging and Timestamping for Reconciliation) which provides P2P...
Mounir Tlili, William Kokou Dedzoe, Esther Pacitti...
TGC
2010
Springer
13 years 8 months ago
CarPal: Interconnecting Overlay Networks for a Community-Driven Shared Mobility
Car sharing and car pooling have proven to be an effective solution to reduce the amount of running vehicles by increasing the number of passengers per car amongst medium/big commu...
Vincenzo Dezani-Ciancaglini, Luigi Liquori, Lauren...
PPOPP
2011
ACM
13 years 1 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...