Filters








2,466 Hits in 4.9 sec

Survey of DHT topology construction techniques in virtual computing environments

YiMing Zhang, XiCheng Lu, DongSheng Li
2011 Science China Information Sciences  
queries, and DHT grouping techniques for matching domain structures.  ...  In this paper, we first introduce the traditional techniques of DHT topology construction, focusing mainly on dynamic maintenance and message routing of typical DHTs, DHT indexing techniques for complex  ...  We intend adding new functions to Owlet including complex query-oriented DHT indexing, flexible routing-oriented DHT grouping, etc. Figure 1 1 DHT overlays in iVCE.  ... 
doi:10.1007/s11432-011-4377-6 fatcat:emtzqctidrd7vhxhkh3mo2cvzq

BIDIR-SAM: Large-scale content distribution in structured overlay networks

Matthias Wahlisch, Thomas C. Schmidt, Georg Wittenburg
2009 2009 IEEE 34th Conference on Local Computer Networks  
IPTV, software replication and other large-scale distribution tasks urge the need for efficient multicast mechanisms in overlay networks.  ...  BIDIR-SAM is the first DHT-based overlay multicast that distributes any source multicast data according to source-specific shortest path trees.  ...  Prefix-Directed Forwarding Prefix-directed routing is used by several DHTs such as Pastry and gives rise to a high degree of flexibility.  ... 
doi:10.1109/lcn.2009.5355130 dblp:conf/lcn/WahlischSW09a fatcat:syuiyrwcmreebjajnivwekhc4m

Architectures and Algorithms for Internet-Scale (p2p) Data Management [chapter]

Joseph M. Hellerstein
2004 Proceedings 2004 VLDB Conference  
DHT in action Operation: take key as input; route messages to node holding key DHT in action: put() insert(K 1 ,V 1 ) Operation: take key as input; route messages to node holding key  ...  It may not display correctly in other versions of PowerPoint. In particular, animations are often a problem.  ...  for multiple purposes as well • Or, can do aggregation via gossip [Kempe, et al FOCS '03] Group By • A piece of cake in a DHT -Every node sends tuples toward the hash ID of the grouping columns -An  ... 
doi:10.1016/b978-012088469-8.50117-0 dblp:conf/vldb/Hellerstein04 fatcat:crwdutblwvh77i4tbgivwdkmki

On Routing in Distributed Hash Tables

Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le Boudec, Karl Aberer
2007 Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)  
Good solutions for group A have been known for many years. However, DHTs in group A are limited to use randomized hashing and therefore, queries over whole identifier ranges thus do not scale.  ...  We present an elegant new solution to construct an efficient DHT for group B. Our main idea is to decouple the identifier space from the routing topology.  ...  We classify DHTs that allow non-uniform distributions of peers in the id space in group B.  ... 
doi:10.1109/p2p.2007.38 dblp:conf/p2p/MuellerYG07 fatcat:dpvzvtjstffobak3kstl3fmbza

On Routing in Distributed Hash Tables

Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le Boudec, Karl Aberer
2007 Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)  
Good solutions for group A have been known for many years. However, DHTs in group A are limited to use randomized hashing and therefore, queries over whole identifier ranges thus do not scale.  ...  We present an elegant new solution to construct an efficient DHT for group B. Our main idea is to decouple the identifier space from the routing topology.  ...  We classify DHTs that allow non-uniform distributions of peers in the id space in group B.  ... 
doi:10.1109/p2p.2007.4343471 fatcat:4sq77pr2szdmpcuirtb4foskhu

Tambour: A Scalable and Robust DHT Protocol

Xiao Shu, Xining Li
2009 2009 First International Conference on Information Science and Engineering  
reproduce, publish, archive, preserve, conserve, communicate to the public by telecommunication or on the Internet, loan, distribute and sell theses worldwide, for commercial or noncommercial purposes, in  ...  [LL04] Each host monitors hosts in its group and 2 nodes from each foreign group. amount of bandwidth to maintain their routing structures.  ...  The -distribution provides a flexible and scalable routing structure for DHTs.  ... 
doi:10.1109/icise.2009.1156 fatcat:2l2sjghxjbe55gj3euxank25tm

Spurring Adoption of DHTs with OpenHash, a Public DHT Service [chapter]

Brad Karp, Sylvia Ratnasamy, Sean Rhea, Scott Shenker
2005 Lecture Notes in Computer Science  
However, this flexibility comes at the expense of synergy in deployment, and thus at the expense of ease of use of the DHT.  ...  The great strength of the library model is the flexibility it affords applications in functionality.  ... 
doi:10.1007/978-3-540-30183-7_19 fatcat:3tkxombu2rca3phyfsg2r3ciwu

Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast

G. Tan, S. A. Jarvis
2007 IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications  
This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network.  ...  DHT network, this ratio can be very low (e.g., less than 50%).  ...  The RRS scheme relies on the flexibility of route selection, which can only be provided by Chord and CAN in our cases. Therefore, this scheme has the least applicability in terms of DHT choice.  ... 
doi:10.1109/infcom.2007.254 dblp:conf/infocom/TanJ07 fatcat:lacmflkq3fhsba4kavr2zb52dq

A scalable distributed information management system

Praveen Yalagandula, Mike Dahlin
2004 Computer communication review  
We design, implement and evaluate a SDIMS that (1) leverages Distributed Hash Tables (DHT) to create scalable aggregation trees, (2) provides flexibility through a simple API that lets applications control  ...  comparison to flat DHTs, and gracefully handles failures.  ...  Note that logical groups can correspond to administrative domains (e.g., department or university) or groups of nodes within a domain (e.g., 10 workstations on a LAN in the CS department).  ... 
doi:10.1145/1030194.1015509 fatcat:m4sk4my6fbdbnhedxx4mz34rf4

A scalable distributed information management system

Praveen Yalagandula, Mike Dahlin
2004 Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '04  
We design, implement and evaluate a SDIMS that (1) leverages Distributed Hash Tables (DHT) to create scalable aggregation trees, (2) provides flexibility through a simple API that lets applications control  ...  comparison to flat DHTs, and gracefully handles failures.  ...  Note that logical groups can correspond to administrative domains (e.g., department or university) or groups of nodes within a domain (e.g., 10 workstations on a LAN in the CS department).  ... 
doi:10.1145/1015467.1015509 dblp:conf/sigcomm/YalagandulaD04 fatcat:zfkrykyyzvhw5fyrcvami4d3me

Secure P2P topology based on a multidimensional DHT space mapping

ZhiXin Sun, BingQing Luo, YaDang Chen, Kai Bu
2012 Science China Information Sciences  
Moreover, a series of secure methods and routing algorithms are provided to achieve secure DHT in smaller spaces.  ...  In this paper, we propose a new secure DHT protocol based on a multidimensional mapping mechanism. This mechanism maps peers to a multidimensional space by dividing the identifiers into groups.  ...  the problems of a peer's excessive flexibility and management difficulties.  ... 
doi:10.1007/s11432-012-4618-3 fatcat:eadoupcegzdkjapx666bdy5bbm

Towards a Common API for Structured Peer-to-Peer Overlays [chapter]

Frank Dabek, Ben Zhao, Peter Druschel, John Kubiatowicz, Ion Stoica
2003 Lecture Notes in Computer Science  
In doing so, we hope to facilitate independent innovation in overlay protocols, services, and applications, to allow direct experimental comparisons, and to encourage application development by third parties  ...  We provide a snapshot of our efforts and discuss open problems in an effort to solicit feedback from the research community.  ...  These abstractions include distributed hash tables (DHT), group anycast and multicast (CAST), and decentralized object location and routing (DOLR).  ... 
doi:10.1007/978-3-540-45172-3_3 fatcat:rqqpyoe7nrh2vakclcwdtet35m

LOADER: A Location-Aware Distributed Virtual Environment Architecture

Behnoosh Hariri, Shervin Shirmohammadi, Mohammad Reza Pakravan
2008 2008 IEEE Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems  
The proposed approach is mainly based on distributed hash tables (DHTs) in order to achieve a decentralized distributed system where any participating node can efficiently retrieve the updates associated  ...  The original form of DHT has several deficiencies for multi-user virtual environment application.  ...  MULTICASTING OVER DHT BASED NETWORKS Update messages in a virtual environment are mostly exchanged in groups.  ... 
doi:10.1109/vecims.2008.4592760 dblp:conf/vecims/HaririSP08 fatcat:lbh6nus63jdidkqt5v56symosy

HyCube: A DHT Routing System Based on a Hierarchical Hypercube Geometry [chapter]

Artur Olszak
2010 Lecture Notes in Computer Science  
This paper presents a DHT routing system based on a hierarchical hypercube geometry. An approach employing a novel variable metric adopting the Steinhaus transform is presented.  ...  The architecture of the network and the routing algorithm are presented. The results of the simulations have been included in the paper and compared with existing solutions.  ...  DHT systems can be divided into groups according to their geometry (connections graph) which defines the overlay network. The overlay network implies the structure of the routing tables.  ... 
doi:10.1007/978-3-642-14403-5_28 fatcat:eklyjtocufb2jmwxvftkpq2ucm

DHT-based Communications Survey: Architectures and Use Cases [article]

Yahya Hassanzadeh-Nazarabadi, Sanaz Taheri-Boshrooyeh, Safa Otoum, Seyhan Ucar, Öznur Özkasap
2021 arXiv   pre-print
In contrast to the existing surveys, our study goes beyond the commonly known DHT methods such as storage, routing, and lookup, and identifies diverse DHT-based solutions including but not limited to aggregation  ...  In this article, we propose a classification of the state-of-the-art DHT-based methods focusing on their system architecture, communication, routing and technological aspects across various system domains  ...  Each group is associated with an identifier that is derived from the group topic. The membership to a group is done by sending a join message in the DHT overlay to the group identifier.  ... 
arXiv:2109.10787v1 fatcat:pahehqjekrhrlnxex3khdsr5uq
« Previous Showing results 1 — 15 out of 2,466 results