NSF Grants for Decentralized Infrastructure Research 71
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)."
REPEAT (Score:2, Informative)
Wow... (Score:2)
Re:OS is slow (Score:1)
I smell lawsuit (Score:4, Insightful)
Re:I smell lawsuit (Score:1)
W.T.F.?!? They're trying to create a more robust, secure network. Like, y'know, the internet itself. Or like the phone system. Or like the power grid. Or like the sewers. "No central point of failure"
What's that got to do with RIAA? Just because the police are allowed to batter down your door, doesn't mean you get sued for putting locks on it.
But can it help against the world's worst DoS? (Score:5, Funny)
We should be funding this (Score:1)
It's all a republican plot (Score:1)
P2P platform to build upon. (Score:3, Interesting)
It will be interesting to see which areas are going to be covered. I guess a way of identification will be included, so the "traditional" P2P projects will probably have to spend some time counter the identification stuff as well.
Re:P2P platform to build upon. (Score:1)
And it's working right now! www.overnet.com has some details about it... (not much though)
Or... (Score:4, Funny)
Hash Tables (Score:2, Funny)
Well last time I was in Amsterdam they had these "Distributed Hash Tables". After about 2 hours I was feeling very decentralized.
This is distributed implementation (Score:2, Interesting)
Anyway, that's my immediate reflection.
Just a thought... (Score:3, Informative)
Wasn't that the goal of the ARPANET project that led to the Internet in the first place? I guess it didn't work.
Comment removed (Score:5, Interesting)
Re:Freenet? (Score:1, Flamebait)
You can take that as either a sarcastic or serious comment. I think it's a little of both.
Re:Freenet? (Score:2, Informative)
very. (Score:2, Informative)
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 [monash.edu.au] 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
Completely wrong (Score:4, Insightful)
Freenet searches do not work like Gnutella, as you would know if you knew anything [freenetproject.org] about Freenet.
Freenet's search has, through multiple independent simulation-based studies (cited in the link I give above), been demonstrated to have logarithmic scalability, not the linear scalability you claim.
To inject some facts into this conversation - Freenet isn't exactly the same as a distributed hashtable, as it doesn't guarantee retrievability of information, but this is probably an inevitable consequence of achieving Freenet's goals, and Freenet's developers aren't shy about it.
The claims you have made about Freenet are total FUD.
Re:Completely wrong (Score:2)
The very paper you links to shows that median request path length is N^0.28. Logarithmic, that's not.
Freenet has probabilistic, polynomial-time lookup and unbounded routing table size. Chord-like DHTs have deterministic, logarithmic-time lookup and logarithmic routing table size. Anonymity is nice, but it's costly.
Freenet's worst-case performance -- i.e., when its routing table state is cold -- is O(N). Just like Gnutella. Chord's worst-case performance is still logarithmic.
--Patrick
To get get best of both worlds: Achord (Score:1)
Re:Completely wrong (Score:2)
I can (Score:2)
Another Slow News Day (Score:3, Insightful)
NOTE to Mods: DifferentTitle != DifferentStory
Centralized Points of Vulnerability (Score:3, Insightful)
1) elminate completely the use of plaintext protocols
2)Start using our CPU's to the fullest using the computer to gaurd against software failure. One easy step would be to eliminate decrementing stacks. It's alot hard to overflow into a a memory space behind you then ahead of you.
Just my 2 cents
Re:Centralized Points of Vulnerability (Score:2)
That is the upside of technologies like DRM. Hardening the clients with DRM and use of DHT would make the internet a lot more robust.
Re:Centralized Points of Vulnerability (Score:1)
Distributed Hash Tables (DHTs) in P2P... (Score:5, Informative)
Two well-known academic DHT projects are Chord [mit.edu] and Kademlia [nyu.edu].
Kademlia is the basis for VarVar [varvar.com] and EDonkey's successor, Overnet [overnet.com]. 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.
Re:Distributed Hash Tables (DHTs) in P2P... (Score:1)
With GUESS and CHORD, perhaps Gnutella can finally stand up to FastTrack, WinMX etc.
More DHTs (Score:1)
- Fzz
Bah! (Score:1)
Attacks on Distributed Hash Tables (Score:2, Informative)
A quick Google search reveals these tidbits on DHT vulnerabilities:
Security Considerations for Peer-to-Peer Distributed Hash Tables [mit.edu]Achilles Heel of the DHT [cubicmetercrystal.com]
Woo! (Score:1)
So many DHTs, so little time.... (Score:2, Informative)
Rice: Pastry (n-Hypercube) [nec.com]
MIT: Chord (Ring-based) [nec.com]
Berkeley: Tapestry [nec.com]
ICSI: CAN (Mesh-based) [nec.com]
Re:So many DHTs, so little time.... (Score:2)
The nice thing about DHTs is that the interface is nearly identical on all of the platforms: Given a key, find the associated object. (And insert, of course). Most of the DHT teams are already working together to create a common interface so that they can easily be evaluated against each other. It's likely that the higher-level results from IRIS will be DHT agnostic. Some of the lower-level things (like making the DHTs themselves more resilient) will probably be done using each group's own DHT.
(Disclaimer: While I work in one of the groups that's participating in iris, these are only my guesses, not any kind of official word).
sort of like Linda or JavaSpaces (Score:1)
Other posters have made interesting comparisons with Freenet, etc., but this research initiative seems (from the limited information in the linked project funding announcement) to be about persistent and replicated global data sharing. (Well, I guess that Freenet does that grin :-)
For programmers: spend an evening or two playing with either JavaSpaces or IBM's distributed tuple space stuff - fun and educational if you havn't already checked it out.
-Mark
Distributed Hash Tables (Score:1)
Political vulnerability (Score:2)
No, I am not talking about legal problems like court orders. If the system as any central point there is the problem of who gets to control it. With no center it will be much easier for everyone to agree on the protocol without endless politicking.
what DHTs are, REALLY (Score:1)
This is more about how to build large scale network applications such as multicast and file systems in an efficient way. DHTs like Tapestry (http://www.cs.berkeley.edu/~ravenben/tapestry), Pastry (http://research.microsoft.com/~antr/), Chord (http://www.pdos.lcs.mit.edu/chord/) and CAN are MUCH better at finding a single unique file than anything before. You can use it to find copies of britney spears, but that's not the point.
Finally, these systems perform with contraints on performance, unlike Freenet. You're guaranteed to either find it or know it's not there (in the absence of failure corner cases) in a # of hops logarithmic to the size of the network. And all this is done without any super servers or supernodes to maintain the network. It is fully decentralized.
Last Post! (Score:1)
The neighbors thought it was lightning in my house, so they called the cops.
-- Steven Wright
- this post brought to you by the Automated Last Post Generator...