Network Diagram Guide
The following is a guide for the network diagrams found in this presentation.
Initial Network
The initial network is empty. The following image represents the positions of the nodes as they exist in the theoretical space.
In the example that follows, the nodes will be inserted in the following arbitrary order: 100, 111, 011, 010, 000, 001, 101.
First Node: 100
The first node added has a value of '100'. Through out-of-band methods, the node determines that there are no other nodes in the network and sets itself in control of the entire string space, creating shadow nodes (mapped to itself) for its own neighbors.
Second Node: 111
When '111' is added, it looks for its own neighbors, 011, 110, and 101. It obtains:
- 011 -> 100 (shadow node, covered by 100)
- 101 -> 100 (shadow node)
- 110 -> 100 (shadow node)
Through the shadow string function, 111 determines that it should take over coverage for 110 and 101, resulting in the new network topology.
Third Node: 011
'011' looks for its neighbors, 010, 111 and 001. It obtains:
- 010 -> 100 (shadow node)
- 001 -> 100 (shadow node)
- 111 -> 111 (real node)
011 determines that it must take over coverage of 010, 001, and 000 from 100. This results in a 'physical' connection between 011 and 100, which in a complete network would not exist, to connect 100 to its shadow neighbor 000, and the neighbor of a shadow 100 is covering for, 110.
Fourth Node: 110
'110' looks for its neighbors, 111, 100 and 010. It obtains:
- 010 -> 011 (shadow node)
- 100 -> 100 (real node)
- 111 -> 111 (real node)
110 must take over its place, relacing the shadow previously being covered by 111, and it also takes over coverage of the shadow of 101 from 111, removing the physical connection between 111 and 100 for that shadow node.
Fifth Node: 010
'010' looks for its neighbors, 000, 011 and 110. It obtains:
- 000 -> 011 (shadow node)
- 011 -> 011 (shadow node)
- 110 -> 110 (real node)
010 takes over coverage of shadows 001 and 000 from 011. Also, because it replaces the 010 shadow covered by 011, it replaces the physical connection from 011 to 110 with one to itself, also using that connection for the 000 shadow it has taken over.
Sixth Node: 000
'000' looks for its neighbors, 010, 001 and 100. It obtains:
- 001 -> 010 (shadow node)
- 010 -> 010 (real node)
- 100 -> 100 (real node)
000 inserts itself without taking over coverage of any shadow nodes. It does, however, remove the connection that 010 had with 100 which existed to connect 100 to the 000 shadow covered by 010.
Seventh Node: 001
Neighbors, 000, 011, 101. It obtains:
- 000 -> 000 (real node)
- 101 -> 110 (shadow node)
- 011 -> 011 (real node)
000 inserts itself without taking over coverage of any shadow nodes. It does, however, create a connection to 110, since 110 is covering for shadow node 101.
Eigth Node: 101
Neighbors, 001, 100, 111. It obtains:
- 001 -> 001 (real node)
- 100 -> 100 (real node)
- 111 -> 111 (real node)
101 inserts itself, removing the connection that existed from 001 to 110 (because 110 was covering for its shadow), and completed the network.