Results 1 - 10 of 744

XML processing in DHT networks

by Serge Abiteboul, Ioana Manolescu, Neoklis Polyzotis, Nicoleta Preda, Chong Sun - In ICDE , 2008
"... Abstract — 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 techniques to lift them. First, we adapt the DHT platform’s index store and communication primitives to the ne ..."
Abstract - Cited by 24 (12 self) - Add to MetaCart
Abstract — 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 techniques to lift them. First, we adapt the DHT platform’s index store and communication primitives

ABSTRACT Bootstrapping Large-scale DHT Networks

by Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellerer, Zoran Despotovic
"... The recent disruption of the Skype voice-over-IP system, triggered by a massive reboot of the hosts around the world, brought to light the importance of efficient bootstrapping in a large-scale peer-to-peer network. Thus far, the problem of bootstrapping a DHT network from a near-total failure has r ..."
Abstract - Add to MetaCart
The recent disruption of the Skype voice-over-IP system, triggered by a massive reboot of the hosts around the world, brought to light the importance of efficient bootstrapping in a large-scale peer-to-peer network. Thus far, the problem of bootstrapping a DHT network from a near-total failure has

Data Indexing in Peer-to-Peer DHT Networks

by L. Garces-Erice, P. A. Felber, E.W. Biersack, G. Urvoy-Keller, K. W. Ross - in Proc. ICDCS’04 , 2004
"... Peer-to-peer distributed hash table (DHT) systems make it simple to discover specific data when their complete identifiers---or keys---are known in advance. In practice, however, users looking up resources stored in peer-to-peer systems often have only partial information for identifying these resou ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
these resources. In this paper, we describe techniques for indexing data stored in peerto -peer DHT networks, and discovering the resources that match a given user query. Our system creates multiple indexes, organized hierarchically, which permit users to locate data even using scarce information, although

Handling Churn in a DHT

by Sean Rhea, Dennis Geels, Timothy Roscoe, John Kubiatowicz - In Proceedings of the USENIX Annual Technical Conference , 2004
"... This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as high as those observed in deployed P2P systems such as Kazaa. We then ..."
Abstract - Cited by 450 (22 self) - Add to MetaCart
then show through experiments on an emulated network that current DHT implementations cannot handle such churn rates. Next, we identify and explore three factors affecting DHT performance under churn: reactive versus periodic failure recovery, message timeout calculation, and proximity neighbor selection

POND: The Power of Zone Overlapping in DHT Networks

by Zhiyong Xu, Jizhong Han, Laxmi Bhuyan
"... Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-to-Peer service model and work perfect in a homogeneous envi-ronment. Workload are evenly distributed on every participat-in ..."
Abstract - Add to MetaCart
Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-to-Peer service model and work perfect in a homogeneous envi-ronment. Workload are evenly distributed on every

Pastrystrings: A comprehensive content-based publish/subscribe DHT network

by Ioannis Aekaterinidis, Peter Triantafillou - In Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS’06 , 2006
"... In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and string attributes, (accommodating equality, prefix, suffix, and containment predicates) over DHT net-works utilising pre ..."
Abstract - Cited by 29 (3 self) - Add to MetaCart
In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and string attributes, (accommodating equality, prefix, suffix, and containment predicates) over DHT net-works utilising

Rainbow: a Robust and Versatile Measurement Tool for Kademlia-based DHT Networks

by Xiangtao Liu , Tao Meng , Kai Cai , Xueqi Cheng
"... Abstract-In recent years, peer-to-peer (P2P) file sharing applications have dominated the Internet traffic volumes, and among them, BitTorrent and eMule constitute the majority. BitTorrent and eMule deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol, ..."
Abstract - Add to MetaCart
Abstract-In recent years, peer-to-peer (P2P) file sharing applications have dominated the Internet traffic volumes, and among them, BitTorrent and eMule constitute the majority. BitTorrent and eMule deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol

Answering Tag-Term Keyword Queries over XML Documents in DHT Networks

by Weimin He , Teng Lv
"... Abstract. The emergence of Peer-to-Peer (P2P) computing model and the popularity of Extensible Markup Language (XML) as the web data format have fueled the extensive research on retrieving XML data in P2P networks. In this paper, we developed an efficient and effective keyword search framework that ..."
Abstract - Add to MetaCart
that can support tag-term keyword queries in Distributed Hash Table (DHT) networks. We employed a concise Bloom-Filter data structure to index XML meta-data in the DHT repository. We also developed an effective algorithm that supports tag-term keyword queries over our Bloom-Filter encoded XML meta

PastryStrings: Contentbased publish/subscribe over dht networks

by Ioannis Aekaterinidis, Peter Triantafillou , 2006
"... In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and string attributes, (accommodating equality, prefix, suffix, and containment predicates) over DHT networks utilising pref ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
In this work we propose and develop a comprehensive infrastructure, coined PastryStrings, for supporting rich queries on both numerical (with range, and comparison predicates) and string attributes, (accommodating equality, prefix, suffix, and containment predicates) over DHT networks utilising

Hash-based Proximity Clustering for Load Balancing in Heterogeneous DHT Networks

by Haiying Shen, Cheng-zhong Xu , 2006
"... DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network nodes in proportion to their capacity so as to eliminate traffic bottleneck. It is challenging because of the dynamism n ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network nodes in proportion to their capacity so as to eliminate traffic bottleneck. It is challenging because of the dynamism
Results 1 - 10 of 744