Slashdot Mirror


NSF Grants for Decentralized Infrastructure Research

billbaggins writes "The NSF has given a grant to the IRIS project to research something called Distributed Hash Tables as a tool for creating networks that don't have "centralized points of vulnerability". The chief purpose seems to be to stop DoS attacks, intentional or otherwise. Check out their press release (text or Word format) and also the news coverage (CNN and NYTimes, among others)."

7 of 71 comments (clear)

  1. REPEAT by Anonymous Coward · · Score: 2, Informative

    http://slashdot.org/article.pl?sid=02/09/25/171322 4&mode=thread&tid=95

  2. Just a thought... by mmoncur · · Score: 3, Informative
    a tool for creating networks that don't have "centralized points of vulnerability". The chief purpose seems to be to stop DoS attacks, intentional or otherwise.

    Wasn't that the goal of the ARPANET project that led to the Internet in the first place? I guess it didn't work.

    --

    It's Slashdot's evil twin... SlashNOT
  3. Re:Freenet? by T4D · · Score: 2, Informative

    The primary goal of Freenet is anonymity. This means that there are some limitations/restrictions placed on the design. The IRIS project has some of the goals as Freenet, but they are not constrained by the additional goal of maintaining absolute anonymity. Without the need to maintain anonymity, they can focus on performance and scalability. They don't need to work about hiding the identity of the author and readers. Freenet is a great project and I hope that they can achieve all their goals. But, their project will never produce a general purpose distributed data storage solution. However, it looks like IRIS and related projects like Cord and CFS will do just that.

  4. very. by jon_c · · Score: 2, Informative

    god this got modded up? i swear, all someone has to do is mention freenet on slasdot, sigh..

    It's not like freenet. freenet searches work just like gnutella, randomly. it's a completely retarded way to organize a network. A distributed hash table like Circle solves this by organizing the network in a logical, storable and efficient way.

    Basically compare a binary search vs. a random search, where the random search is like O(n) except you may just miss something.

    -Jon

    --
    this is my sig.
  5. Distributed Hash Tables (DHTs) in P2P... by gojomo · · Score: 5, Informative
    DHTs are also the key to the next generation of efficient, centerless P2P file-sharing.

    Two well-known academic DHT projects are Chord and Kademlia.

    Kademlia is the basis for VarVar and EDonkey's successor, Overnet. There's an experimental effort to add a Chord-style query routing option to Gnutella, to find exact files over the whole network with far less traffic.

  6. Attacks on Distributed Hash Tables by Foresto · · Score: 2, Informative

    A quick Google search reveals these tidbits on DHT vulnerabilities:

    Security Considerations for Peer-to-Peer Distributed Hash Tables
    Achilles Heel of the DHT
  7. So many DHTs, so little time.... by wuchang · · Score: 2, Informative

    All the major DHT groups are involved. I wonder which DHT they're going to use.....

    Rice: Pastry (n-Hypercube)
    MIT: Chord (Ring-based)
    Berkeley: Tapestry
    ICSI: CAN (Mesh-based)