This is archived content, mostly untouched since 2003. For newer content/updated versions, see netfuture.ch/Publications.
First page Back Continue Last page Overview Text

Complex Relationships. Largest. 17 edges. 55/56 fragments. ≈ 3.25 e/f. Efficient. 11 edges. 35 fragments. 3.18 e/f.

Notes:


Here, we have another 7-node relationship graph with a different interconnection pattern. The numbers on the links indicate the number of fragments that differ; also, the stronger links (fewer differences) are also darker in color. The maximum-stregth links alone do not make this graph densely connected. By adding the slightly weaker links (more differences), we still get a strong graph.
The largest relationship graphs with at most three differences on links contributed 17 fake edges with 55 to 56 fragments, giving an efficiency of about 3 ¼ edge per fragment. This makes GOSSIB clusters more than twice as efficient in adding fake edges than it is for real routers to add real edges.
Larger GOSSIB clusters do not necessarily mean better efficiency, as can be seen from the most efficient example, which achieves 3.18 fake edges per fragment, 2.5 times more efficient than a law-abiding router.