317 Hits in 3.5 sec

Efficient Peer-to-Peer Lookup Based on a Distributed Trie [chapter]

Michael J. Freedman, Radek Vingralek
2002 Lecture Notes in Computer Science  
We describe a third alternative based on a distributed trie. This algorithm functions well in a very dynamic, hostile environment, offering security benefits over prior proposals.  ...  Peers gradually learn system state during lookups, receiving the sought values and/or internal information used by the trie. The distributed trie converges to an accurate network map over time.  ...  Conclusions We propose a new approach to key/value lookup in peer-to-peer systems based on a distributed trie.  ... 
doi:10.1007/3-540-45748-8_6 fatcat:bw7eumexlngi7dkp7v6mybmhzq

Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems [chapter]

Sebastian Kniesburges, Christian Scheideler
2012 Lecture Notes in Computer Science  
The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years.  ...  One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).  ...  Our Results The hashed Predecessor Patricia trie is based on the hashed Patricia we introduced in [1] .  ... 
doi:10.1007/978-3-642-33651-5_45 fatcat:ufryu2myojhgzpfi34l6kjfe6i

Cooperative XPath caching

Kostas Lillis, Evaggelia Pitoura
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
Our scheme allows sharing cache content among a number of peers. To facilitate sharing, a distributed prefix-based index is built based on the queries whose results are cached.  ...  Both approaches result in a dynamic organization of content that evolves over time based on the query load, the number of peers and the overall storage available.  ...  PREFIX-BASED XML CACHING To support efficient substring matching for testing subsumption, we use a prefix-based index. The trie nodes are distributed among the peers forming the cache.  ... 
doi:10.1145/1376616.1376652 dblp:conf/sigmod/LillisP08 fatcat:7p3y5n3uojgw3hv7mmyoqofawy

RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications

J. Liang, K. Nahrstedt
2006 Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications  
In this paper, we present a distributed membership service called RandPeer, which manages membership information on behalf of P2P applications, and allows peers to locate good neighbors based on their  ...  Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of service (QoS).  ...  The authors are thankful to the anonymous reviewers for their useful comments.  ... 
doi:10.1109/infocom.2006.209 dblp:conf/infocom/LiangN06 fatcat:crl3ts7qo5duzex6zcwmrntzwu

Brief announcement

Sriram Ramabhadran, Sylvia Ratnasamy, Joseph M. Hellerstein, Scott Shenker
2004 Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04  
This paper describes the Prefix Hash Tree, a distributed data structure that enables range queries over Distributed Hash Tables.  ...  The novelty of the PHT lies in how this logical trie is distributed among the peers in the network.  ...  This hash-based assignment implies that given a prefix label, it is possible to locate the corresponding PHT node via a single DHT lookup.  ... 
doi:10.1145/1011767.1011823 dblp:conf/podc/RamabhadranRHS04 fatcat:tzjmjx3qlvee5jj5p7c6v7azvq

A Peer-to-Peer Approach to Semantic Web Services Discovery [chapter]

Yong Li, Sen Su, Fangchun Yang
2006 Lecture Notes in Computer Science  
In the presented system, with the ontology encoding scheme, the semantic service description is distributed into a distributed trie index on the structured P2P network to allow requesters to lookup services  ...  In this paper, a novel peer-to-peer indexing system with related P2P registries is proposed to support the completely decentralized discovery capabilities.  ...  The structured P2P networks based on Distributed Hash Table ( DHT) [3] are extremely scalable and lookups can be resolved in logn overlay routing hops for a network of size n nodes.  ... 
doi:10.1007/11758549_10 fatcat:4fgj2vaglzbf5pzr5vttfrhmva

Multi-Way Pipelining for Power-Efficient IP Lookup

Weirong Jiang, Viktor K. Prasanna
2008 IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference  
This paper proposes a partitioning-based multi-way linear pipeline architecture for power-efficient trie-based IP lookup.  ...  Within each pipeline, a memory-efficient fine-grained node-to-stage mapping scheme is employed to achieve evenly distributed memory across the stages.  ...  We propose a SRAM-based multi-way linear pipeline architecture for power-efficient trie-based IP lookup, shown in Figure 1 .  ... 
doi:10.1109/glocom.2008.ecp.450 dblp:conf/globecom/JiangP08 fatcat:uvylhple6jewvfomcfhucyli34

A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids

Philip Chan, David Abramson
2007 Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007)  
A discovery service relies on efficient lookup to locate these objects from names or attributes.  ...  Trie-based approaches like the PHT and DPT, enable sophisticated queries while providing resilience to failures.  ...  For detailed discussion and analysis of the other approaches, we refer the reader to [3] . Efficient and scalable key-based lookups have been the subject of peer-to-peer research.  ... 
doi:10.1109/e-science.2007.6 dblp:conf/eScience/ChanA07 fatcat:csiykdruzvcttk24silqbp7tz4

A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs

Thomas Janson, Peter Mahlmann, Christian Schindelhauer
2010 2010 IEEE 16th International Conference on Parallel and Distributed Systems  
We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and  ...  This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing.  ...  Ratnasamy et al. proposed the trie based Prefix Hash Tree (PHT) [12] , where prefixes of a trie are hashed onto an arbitrary DHT network.  ... 
doi:10.1109/icpads.2010.42 dblp:conf/icpads/JansonMS10 fatcat:cngyjjcgjrhy3jiu4jk4xwnpuy

Efficient Processing of XPath Queries with Structured Overlay Networks [chapter]

Gleb Skobeltsyn, Manfred Hauswirth, Karl Aberer
2005 Lecture Notes in Computer Science  
Though the use of a distributed index (typically a distributed hash table) makes the implementation of structured queries more efficient, it also introduces considerable complexity, and thus only a few  ...  Structured P2P systems are an efficient alternative as they typically offer logarithmic search complexity in the number of peers.  ...  We based the approach on the P-Grid structured overlay network, however, the solution can be ported to similar tree-based DHTs.  ... 
doi:10.1007/11575801_20 fatcat:i6q2wdwwjjdt3kpykyjyowevl4

Summary prefix tree: An over DHT indexing data structure for efficient superset search

Bassirou Ngom, Mesaac Makpangou
2017 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)  
Second, the use of a summary prefix tree (SPT), a trie indexing data structure, for keyword-based search over DHT.  ...  To perform efficient superset searches, SPT maintains on each node a local view of the global tree. The main contributions are the following.  ...  INTRODUCTION On the one hand, many applications can benefit from a scalable, fault-tolerant, and robust distributed keyword-based searching system to improve information sharing among peers.  ... 
doi:10.1109/nca.2017.8171372 dblp:conf/nca/NgomM17 fatcat:fsx32numynczrgynwrfhd67qpe

A Walkable Kademlia Network for Virtual Worlds

Matteo Varvello, Christophe Diot, Ernst Biersack
2009 IEEE INFOCOM Workshops 2009  
Peer-to-Peer (P2P) and Distributed Hash Tables (DHTs) are a cheap and scalable alternative to a Client/Server approach.  ...  The Walkad design leverages on the Kademlia DHT and on a novel indexing algorithm based on a reverse binary trie. We evaluate Walkad via emulation, and using traces extracted from Second Life.  ...  ACKNOWLEDGEMENTS The authors would like to thank Fabio Picconi for his precious help with the Modelnet setup and for his insightful comments and suggestions.  ... 
doi:10.1109/infcomw.2009.5072106 fatcat:2apwqaprszcj7ixhde44cmipqq

A DHT-Based Discovery Service for the Internet of Things

Federica Paganelli, David Parlanti
2012 Journal of Computer Networks and Communications  
While most existing peer-to-peer discovery services proposed for the IoT support solely exact match queries on a single attribute (i.e., the object identifier), our solution can handle multiattribute and  ...  We defined a layered approach by distinguishing three main aspects: multiattribute indexing, range query support, peer-to-peer routing.  ...  A Discovery Service for the IoT Based on a Peer-to-Peer Network This section describes our discovery service architecture based on a peer-to-peer overlay network.  ... 
doi:10.1155/2012/107041 fatcat:ubnvezbn7zggbahaigxjrancjq

LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs

Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
2010 IEEE Transactions on Knowledge and Data Engineering  
In order to support efficient processing of such complex queries, a popular solution is to build indexes on top of the DHT.  ...  LIGHT employs a novel naming mechanism and a tree summarization strategy for graceful distribution of its index structure.  ...  ACKNOWLEDGEMENT We would like to thank the anonymous reviewers.  ... 
doi:10.1109/tkde.2009.47 fatcat:kodz4rethrbv5js5i75xcbhlaq

Tree-based Indexing for DHT-based P2P Systems

Yi YiMar, Aung Htein Maw, Khine Moe Nwe
2013 International Journal of Computer Applications  
Towards the goal of supporting complex queries in DHT-based P2P systems, this paper focuses on the usage of k-dimensional tree to build a tree-based index.  ...  In this paper, the load balancing among peers is also considered according to the usage of kd-tree.  ...  For efficiently processing onedimensional query over DHT, it implemented trie-based distributed data structure. In range query processing, PHT proposed two algorithms.  ... 
doi:10.5120/10133-4923 fatcat:u6kkjl5vrzgtvena4ung6qveou
« Previous Showing results 1 — 15 out of 317 results