Filters








1,360 Hits in 4.1 sec

Routing Algorithms for DHTs: Some Open Questions [chapter]

Sylvia Ratnasamy, Ion Stoica, Scott Shenker
2002 Lecture Notes in Computer Science  
In that spirit we describe some issues relevant to routing algorithms and identify some open research questions.  ...  The question is whether one could similarly modify the current DHT routing algorithms to exploit heterogeneity: Question 14 Can one redesign these routing algorithms to exploit heterogeneity?  ... 
doi:10.1007/3-540-45748-8_4 fatcat:eeul46ywxbehnjjkptm5a4iesy

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  
Tennenhouse, Timothy Roscoe, Hans Mulder, Robert Morris, Frans Kaashoek, Kevin Fall, David Culler, David Mazières, Yatin Chawathe, Michael Walfish, Joe Hellerstein, Petros Maniatis, and John Kubiatowicz for  ...  An open question is the degree to which OpenHash should expose control over caching and load balancing to its users.  ...  To send a packet to x, a sender routes the packet to the DHT host responsible for storing trigger entries for x.  ... 
doi:10.1007/978-3-540-30183-7_19 fatcat:3tkxombu2rca3phyfsg2r3ciwu

Sybil-Resistant DHT Routing [chapter]

George Danezis, Chris Lesniewski-Laas, M. Frans Kaashoek, Ross Anderson
2005 Lecture Notes in Computer Science  
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes.  ...  We introduce a routing strategy that alleviates some of the effects of such an attack by making sure that lookups are performed using a diverse set of nodes.  ...  like Chord achieve polylogarithmic cost; it is an open question whether this is possible for a secure overlay.  ... 
doi:10.1007/11555827_18 fatcat:fku5bx6j7vb5nflh4daocfc35y

DHT Routing Using Social Links [chapter]

Sergio Marti, Prasanna Ganesan, Hector Garcia-Molina
2005 Lecture Notes in Computer Science  
We propose SPROUT, a DHT routing algorithm that significantly increases the probability of successful routing by using social links.  ...  Finally, we discuss further optimization and design choices for both the model and the routing algorithm.  ...  ACKNOWLEDGEMENTS The authors would like to thank Orkut Buyukkokten for providing us with the Club Nexus data and Adam D'Angelo for providing us with the BuddyZoo data.  ... 
doi:10.1007/978-3-540-30183-7_10 fatcat:ixxoilmx75gkhbi2doqeyxotxu

Profiling a million user dht

Jarret Falkner, Michael Piatek, John P. John, Arvind Krishnamurthy, Thomas Anderson
2007 Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07  
We leverage these measurements to drive the design of a modified DHT lookup algorithm that reduces median DHT lookup time by an order of magnitude for a nominal increase in overhead.  ...  Distributed hash tables (DHTs) provide scalable, key-based lookup of objects in dynamic network environments.  ...  The relative effectiveness of coping with stale routing tables through parallel lookups (as in Azureus) or aggressive refresh (as in eMule) remains an open question for future work.  ... 
doi:10.1145/1298306.1298325 dblp:conf/imc/FalknerPJKA07 fatcat:v5fkdttydbdf5ls3xhyds672fy

Data currency in replicated DHTs

Reza Akbarinia, Esther Pacitti, Patrick Valduriez
2007 Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07  
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems.  ...  They also show that our algorithm used in UMS achieves major performance gains, in terms of response time and communication cost, compared with a baseline algorithm.  ...  But, the question is how p can acquire c q,k . To answer this question, we propose two initialization algorithms: direct and indirect.  ... 
doi:10.1145/1247480.1247506 dblp:conf/sigmod/AkbariniaPV07 fatcat:lqfwvtrcuzg6vcgxt5zote2ph4

A small-world DHT built on generalized network coordinates

Liz Ribe-Baumann, Kai-Uwe Sattler
2010 Proceedings of the 1st International Workshop on Data Semantics - DataSem '10  
Some systems have integrated round trip times through proximity-aware identifier selection (PIS), proximity-aware route selection (PRS), and proximity-aware neighbor selection (PNS).  ...  We present initial ideas for the construction of a small-world DHT which mitigates this trade off by retaining scalability and robustness while effectively integrating round trip times and additional node  ...  Beyond these measures, there are many open questions regarding the suggested DHT.  ... 
doi:10.1145/1754239.1754286 dblp:conf/edbtw/Ribe-BaumannS10 fatcat:aaveomwzpzfe5mu72u7quscgxe

Evaluating DHT-Based Service Placement for Stream-Based Overlays [chapter]

Peter Pietzuch, Jeffrey Shneidman, Jonathan Ledlie, Matt Welsh, Margo Seltzer, Mema Roussopoulos
2005 Lecture Notes in Computer Science  
For this, we consider two DHT-based algorithms for node discovery, which use either the union or intersection of DHT routing paths in the SBON, and compare their performance to other techniques.  ...  The union of DHT routes may result in a low-quality set of discovered nodes that requires an expensive node selection algorithm.  ...  First, it remains an open question of whether it is possible to construct a DHT that is sufficiently networkaware such that it could be used to easily construct a good candidate set for node placement.  ... 
doi:10.1007/11558989_25 fatcat:isnk2c3xgbdnrhxnmqnchqvwie

Towards a scalable and robust DHT

Baruch Awerbuch, Christian Scheideler
2006 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06  
A common approach in the area of peer-to-peer systems has been to use a distributed hash table (or DHT). DHTs are based on the concept of virtual space.  ...  Join-leave attacks, for example, may be used to isolate honest peers in the system, and attacks on the data management level may be used to create a high load-imbalance, seriously degrading the correctness  ...  ., but the question is, how many attempts are needed until all of the lookup requests are successful, no matter which data items have been selected for them.  ... 
doi:10.1145/1148109.1148163 dblp:conf/spaa/AwerbuchS06 fatcat:dzclxgmunnff7ca6rzkanzch5u

Improving Lookup Performance Over a Widely-Deployed DHT

D. Stutzbach, R. Rejaie
2006 Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications  
First, we analytically derive the benefits of different ways to increase the richness of routing tables in Kademlia-based DHTs.  ...  Our results pinpoint the best operating point for the degree of lookup parallelism and the degree of replication for Kad.  ...  routing tables are incorrect, it is possible for some parts of the identifier space to be unreachable for some peers.  ... 
doi:10.1109/infocom.2006.329 dblp:conf/infocom/StutzbachR06 fatcat:aa6lzdgfhrdtngpgrw3yso7xtq

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
Furthermore, we identify open problems and discuss future research guidelines for each domain.  ...  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  ...  It operates by resolving multi-attribute questions using a single attribute query routing algorithm.  ... 
arXiv:2109.10787v1 fatcat:pahehqjekrhrlnxex3khdsr5uq

Towards a Scalable and Robust DHT

Baruch Awerbuch, Christian Scheideler
2008 Theory of Computing Systems  
A common approach in the area of peer-to-peer systems has been to use a distributed hash table (or DHT). DHTs are based on the concept of virtual space.  ...  Join-leave attacks, for example, may be used to isolate honest peers in the system, and attacks on the data management level may be used to create a high load-imbalance, seriously degrading the correctness  ...  ., but the question is, how many attempts are needed until all of the lookup requests are successful, no matter which data items have been selected for them.  ... 
doi:10.1007/s00224-008-9099-9 fatcat:sv2p6wiasnasdlzbcesmbm2vri

ReDS: A Framework for Reputation-Enhanced DHTs

Ruj Akavipat, Mahdi N. Al-Ameen, Apu Kapadia, Zahid Rahman, Roman Schlegel, Matthew Wright
2014 IEEE Transactions on Parallel and Distributed Systems  
We describe Reputation for Directory Services (ReDS), a framework for enhancing lookups in redundant DHTs by tracking how well other nodes service lookup requests.  ...  Distributed Hash Tables (DHTs) such as Chord and Kademlia offer an efficient solution for locating resources in peer-to-peer networks.  ...  We also thank John McCurley for his editorial help.  ... 
doi:10.1109/tpds.2013.231 fatcat:pebyspnhtjcbfdwfju7s2itmqa

Towards Practical Communication in Byzantine-Resistant DHTs

Maxwell Young, Aniket Kate, Ian Goldberg, Martin Karsten
2013 IEEE/ACM Transactions on Networking  
For example, a simple scheme used in many Byzantine fault-tolerant DHT constructions of n nodes requires O(log 3 n) messages; this is likely impractical for real-world applications.  ...  There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults.  ...  Acknowledgements: We gratefully acknowledge Yizhou Huang for his performance improvements to the DKG implementation. This work is supported by NSERC, MITACS, and David R.  ... 
doi:10.1109/tnet.2012.2195729 fatcat:t6ghukoww5gdfd6okisuplkncm

Replication in DHTs Using Dynamic Groups [chapter]

Reza Akbarinia, Mounir Tlili, Esther Pacitti, Patrick Valduriez, Alexandre A. B. Lima
2011 Lecture Notes in Computer Science  
Distributed Hash Tables (DHTs) provide an efficient solution for data location and lookup in large-scale P2P systems.  ...  The results show its effectiveness for replication management in DHTs. * Work partially funded by the ANR DataRing projet.  ...  An interesting question is about the relationship between the current and the next responsible peer in the DHT.  ... 
doi:10.1007/978-3-642-23074-5_1 fatcat:2ejo52smf5bahfuquozlv65zxe
« Previous Showing results 1 — 15 out of 1,360 results