Talk:Project description
From The Okopipi Wiki
So It Will Work Something Like This ?
Suggest you add it to the frognet theories. Not quite what we're talking about, but a great idea anyway. --Thematrixeatsyou 00:33, 26 May 2006 (PDT)
Network Topology
Is having information about the network topology here a Good Thing™, considering it hasn't been finalised yet? --Ehm 05:02, 23 May 2006 (PDT)
Just a idea using bit torrent. --milkcookies 08:57, 25 May 2006 (EST)
To whoever wrote that picture
I'd just like to say well done! It's really easy to understand and looks great. One clarification point, are the administrative nodes giving messages out to frognet for a desguise or are they taking all of them and moving it up to the top tier? -tortanick ~~Jonathan- Edited for clarity
- The picture is a picture of how the BitTorrent protocol works - and I think it has been taken straight from the Wikipedia article [1] Sparky132 03:37, 11 June 2006 (PDT)
Here's a topology that is extremely resilient and simple
You can't take this network down by infiltration. Even if a million zombies infiltrate a tiny network of 100, the little network will go on with its work as if nothing unusual was happening. This topology is far more resilient than a big de Bruijn graph.
Two things make it very simple. First, most security problems vanish, because all nodes are equally unimportant. Second, unreliable data has only marginal impact, because every piece of information is reliably marked with a trust score.
The simplicity makes the code footprint small and clean, so you get fewer vulnerability bugs. This is vital for an application that will be under constant attack.
Some things become complicated at a higher level. But this level isn't riddled with security problems, so they're easier to cope with, and won't come back and bite us every two or three months in the form of new exploits.
The network consists of many small networks. To join the network you need someone who is already a member to invite you to his own little network. He must rank you on trust and competence. A friend who trusts you will probably give you a 4 or a 5, depending on your IT competence. A large ISP should give its customers a 2.
If whoever invited you is careful about monitoring his members, adjusting their rankings whenever it's needed, he may himself be highly ranked. This in turn affects your ranking. And you can be invited by several people who trust you. This gets you a higher ranking.
But if you don't care about rankings and just want your spam processed, it's quite sufficient to be a rank-2 ISP customer who submits spam regularly.
The picture shows one node, and, in blue, the networks that this node is aware of. The node owns the network in the foreground and is a member by invitation of the other blue networks. The owners of those networks are in turn members of the gray networks in the background, which are members of other networks.
Whenever information passes from one small network to another it is tagged with trust and priority.
For interesting details on this solution, see http://groups.google.com/group/okopipi-dev/browse_frm/thread/080fc17b1bf83bcb
--Poltergeist 15:13, 28 May 2006 (PDT)
