Frognet

From The Okopipi Wiki

Note to reporters: The information contained on this wiki page is not official documentation.

Note to reporters: The information contained on this wiki page is not official documentation.

The Frognet is under development and there are several theories behind it.

Topologies

Note to reporters: The information contained on this wiki page is not official documentation.

The currently proposed topology is based on a de Bruijn Graph model proposed by Loguinov et al. in the 2003 paper entitled "Graph-Theoretic Analysis of Structured Peer-to-Peer systems: Routing Distances and Resilience". For load balancing we will use the k-Choices algorithm proposed in 2004 by Ledlie and Seltzer.

There are currently two proposals for the Network:

Flat Model and Hierarchical Model.

Flat Model

The flat model was the second model proposed, but it's much simpler than the first model and could serve as a base for it, so it's presented first. More features could be added later.

Note: The diagram above for the Okopipi network (blue lines) does not really show a de Bruijn Graph, it was simplified for aesthetic purposes.

The flat model is based on a file sharing network, where the authorized content is signed with the administrators' public keys. Clients would start submitting opt-out requests against a spammer's site as soon as they see that an authorized opt-out script is available.

It's very simple to maintain, as there are no authority roles or reputation to handle. The disadvantages is that there is no way to ban a user from logging into the network, so spammers could infiltrate and slow down the network with excessive bandwidth.

Also, all administration details like designating users to sign scripts, will have to be done through external means (chat rooms, e-mail, etc.)

Hierarchical Model

Note: The diagram above for the Okopipi network (blue lines) does not really show a de Bruijn Graph, it was simplified for aesthetic purposes.

The hierarchical model was the first one proposed, but due to its complexity it's scheduled for version 2 of the Okopipi Network. It builds on top of the flat model by adding administration features. These would include moderation tasks and private messages between administrators. It also contemplates having usernames and forming private groups. It has the advantage that administrators can designate users with specific functions like signing scripts or validating websites. These designated users could ban nodes if they perceive suspicious activity. On the other hand, it requires a more complex security and anonymity layer to prevent infiltration by spammers who have already signed up.