Sciweavers

Share
TGC
2010
Springer
8 years 9 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...
PVLDB
2008
112views more  PVLDB 2008»
8 years 11 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...
CIC
2003
140views Communications» more  CIC 2003»
9 years 1 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...
IMC
2007
ACM
9 years 1 months ago
A global view of kad
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
WISE
2002
Springer
9 years 4 months ago
A Content-Based Resource Location Mechanism in PeerIS
With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in...
Bo Ling, Zhiguo Lu, Wee Siong Ng, Beng Chin Ooi, K...
IPTPS
2003
Springer
9 years 5 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
MIDDLEWARE
2004
Springer
9 years 5 months ago
Meghdoot: Content-Based Publish/Subscribe over P2P Networks
Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decou...
Abhishek Gupta, Ozgur D. Sahin, Divyakant Agrawal,...
IPTPS
2004
Springer
9 years 5 months ago
UsenetDHT: A Low Overhead Usenet Server
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distr...
Emil Sit, Frank Dabek, James Robertson
IPTPS
2005
Springer
9 years 5 months ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
9 years 5 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
books