Sciweavers

31 search results - page 4 / 7
» Segmented hash: an efficient hash table implementation for h...
Sort
View
NSDI
2004
13 years 8 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 7 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
MOBILITY
2009
ACM
14 years 1 months ago
Feasibility evaluation of a communication-oriented P2P system in mobile environments
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
Zhonghong Ou, Erkki Harjula, Otso Kassinen, Mika Y...
COLCOM
2005
IEEE
14 years 1 months ago
On-demand overlay networking of collaborative applications
We propose a new overlay network, called Generic Identifier Network (GIN), for collaborative nodes to share objects with transactions across affiliated organizations by merging th...
Cheng-Jia Lai, Richard R. Muntz
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 8 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...