3 ms·

I wonder if the future for many online services is in p2p web frameworks with distributed hash tables for public data, just to avoid the server overhead. This

by ktizo 14y ago

I wonder if the future for many online services is in p2p web frameworks with distributed hash tables for public data, just to avoid the server overhead. This is something you could already do with careful use of some of the beta browser technologies and would enable the provision of many of the current social web services at a fraction of the cost, which would make much of the problem of how to pay for these services largely moot.

anthony_franco 14y ago
The problem with p2p is that the data is only available if the other user is also online. So in this case you wouldn't be able to see their history of past "tweets" until they reconnected. That's the problem that Opera's Unite ran into.
- ktizo 14y ago
  You need to use a system with massive redundancy, similar to p-grid http://www.p-grid.org/ http://www.p-grid.org/
- sukuriant 14y ago
  Usenet seemed to do find in the past. Perhaps users could adopt a similar model. Also, wasn't Diaspora working on a solution as well that involved cloning?
sliverstorm 14y ago
It is workable for some models, but the latency is generally going to be pretty high. It also requires a certain amount of "critical mass", and is more complicated than your plain-jane LAMP stack.