David Ratajczak, and Joseph M Hellerstein Irb-Tr-03-042 November, 2003...  Home/Search
Context
Related
| projectiris.net/irisbib/pa...paper.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: projectiris.net/irisbib/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nearly all proposed DHTs have echoes -- either explicit or implicit -- of parallel interconnect networks such as butterfly, torus, hypercube, and de Bruijn graphs. However, unlike interconnection networks, DHTs define an overlay graph for all network sizes, and allow the overlay graph to evolve as nodes join and leave as participants. Most of the well-cited DHT designs obscured two basic concerns in DHT design: the choice of topology (the links and routes in "ideal" cases), and of interconnect... (Update)
Active bibliography (related documents): More All
1.6: Copyright 2003, Intel Corporation, All rights reserved. - David Ratajczak And (Correct)
0.2: Cayley DHTs - A Group-Theoretic Framework for Analyzing.. - Qu, Nejdl, Kriesell (2004) (Correct)
0.2: An Algorithm for Optimal Routing in Shuffle-Exchange Networks - Lau, Chen (1997) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-copyright,
author = "David Ratajczak And",
title = "Copyright 2003, Intel Corporation, All rights reserved.",
url = "citeseer.ist.psu.edu/757894.html" }
Citations (may not include all citations):1023 A scalable content addressable network - Ratnasamy, Francis et al. - 2001
128 Viceroy: A scalable and dynamic emulation of the butterfly - Malkhi, Naor et al. - 2002
127 A group-theoretic model for symmetric interconnection networ.. (context) - Akers, Krishnamurthy - 1989
120 Kademlia: A peer-to-peer information system based on the xor.. - Maymounkov, Mazieres - 2002
93 The impact of DHT routing geometry on resilience and proximi.. - Gummadi, Gummadi et al. - 2003
59 Pastry: Scalable, decentralized object location, and routing.. - Rowstron, Druschel - 2001
48 Group action graphs and parallel architectures (context) - Annexstein, Baumslag et al. - 1990
39 Koorde: A simple degreeoptimal distributed hash table - Kaashoek, Karger - 2003
20 A generic scheme for building overlay networks in adversaria.. - Abraham, Awerbuch et al. - 2003
19 Vertex-transitive graphs (context) - Sabidussi - 1964
19 Routing networks for distributed hash tables - Manku - 2003
19 The complexity of finding minimum length generator sequences (context) - Jerrum - 1985
13 Random cayley graphs and expanders - Roichman - 1994
12 Novel architectures for p2p applications: the continuous-dis.. (context) - Naor, Wieder - 2003
8 The minimum-length generator sequence problem is NP-hard (context) - Even, Goldreich - 1981
8 the diameter of finite groups - Babai, Hetyei et al. - 1990
7 Optimal routing in Chord (context) - Ganesan, Manku - 2004
4 Comments on 'a new family of cayley graph interconnection ne.. - Chen, Lau - 1997
2 A scalable content addressable network (context) - Stoica, Morris et al. - 2001
Documents on the same site (http://project-iris.net/irisbib/): More
OASIS: Anycast for Any Service - Michael Freedman Karthik (2006) (Correct)
Comparing the Performance of Distributed Hash Tables Under Churn - Jinyang Li Jeremy (2004) (Correct)
Minimizing Churn in Distributed Systems - Brighten Godfrey Scott (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC