4 ms·

You can order a pizza in 1kb of data and a 10 second latency would be no problem. Pizza web site can be cached.

hvidgaard 10y ago
Current best widely used distributed topology is Kademlia, and it contacts O(log n) nodes in a search. With 1.000.000 nodes that is 20kb of data. With 1.000.000.000 it's 30kb of data. That is fine for simple messaging. But once have located a large ressource you need, and you start to transfer data, at say 10mbit/s, you use 10mbit/s for every node from source to destination. It doesn't scale with trafic. I haven't followed the state of the art that close in a few years, so there might have been some improvements, but none that have made much fuss.
- kpil 10y ago
  There is probably more than one route between two points, in a tightly connected mesh. But I agree, it gets insanely complicated rather quickly.
- kefka 10y ago
  But you're assuming sending data is 100% unique and arbitrary. We know with newer algorithms like IPFS that complex datastreams can be broken down into 256kB chunks all each individually hashed. Not only that, but most data is shared traffic. Yourtube, Facebook, software, you name it. Most unique data people create is textural or small, not the 10MB/s canard.
  - hvidgaard 10y ago
    That require a lot of caching. People needs to be villing to dedicate many GB to this cache around the network for it to be effective.
    - kefka 10y ago
      There's 2 levels of caching in IPFS. Persistent and temporary. Persistent is when you pin something, or add something (which pins it). It's stuck in block storage until you run a command to remove it. Temporary is when you go to some IPFS site, and download stuff to your cache. This is the same thing as your browser cache. In IPFS, there's a garbage collector that circle around every time you hit 10GB (or whatever you set it to). What that means, is some content that goes viral ends up being supported by everyone going to said content. I know I don't clean my browser cache every few minutes, or really ever. And if that means that my and others connections are sped up because of that, the better.

Current best widely used distributed topology is Kademlia, and it contacts O(log n) nodes in a search. With 1.000.000 nodes that is 20kb of data. With 1.000.000.000 it's 30kb of data. That is fine for simple messaging. But once have located a large ressource you need, and you start to transfer data, at say 10mbit/s, you use 10mbit/s for every node from source to destination. It doesn't scale with trafic. I haven't followed the state of the art that close in a few years, so there might have been some improvements, but none that have made much fuss.

kpil 10y ago
There is probably more than one route between two points, in a tightly connected mesh. But I agree, it gets insanely complicated rather quickly.
kefka 10y ago
But you're assuming sending data is 100% unique and arbitrary. We know with newer algorithms like IPFS that complex datastreams can be broken down into 256kB chunks all each individually hashed. Not only that, but most data is shared traffic. Yourtube, Facebook, software, you name it. Most unique data people create is textural or small, not the 10MB/s canard.
- hvidgaard 10y ago
  That require a lot of caching. People needs to be villing to dedicate many GB to this cache around the network for it to be effective.
  - kefka 10y ago
    There's 2 levels of caching in IPFS. Persistent and temporary. Persistent is when you pin something, or add something (which pins it). It's stuck in block storage until you run a command to remove it. Temporary is when you go to some IPFS site, and download stuff to your cache. This is the same thing as your browser cache. In IPFS, there's a garbage collector that circle around every time you hit 10GB (or whatever you set it to). What that means, is some content that goes viral ends up being supported by everyone going to said content. I know I don't clean my browser cache every few minutes, or really ever. And if that means that my and others connections are sped up because of that, the better.