[Dxspider-support] Curiosities about network topology

[Kin]

Hi,

I was curious to know what would be the largest distance (hops) that could
occur in our network with the current topology.
I started with a graph that you can see here:
http://clustermap.cronux.net/route_finder.html , and I ended up with a few
lines of code :(

>From the data obtained from the PC92C sentences, the following data can be
inferred:

Hops   Quantity    Nodes
----	--------	 -----
   1	1782	  563
   2	20003	  561
   3	57289	  561
   4	54012	  561
   5	19279	  561
   6	4001	  539
   7	639	  256
   8	67	    49
   9	9	      7

The 'Quantity' column counts pairs of nodes that have a route with N hops.
The 'Nodes' column counts unique nodes involved in any path with N hops.

It represents the minimum hops between nodes (all to all).
It is based on a study of 563 nodes.
For each node, the distance to all other nodes has been calculated using BFS
(Breadth First Search).

It has to be said, that it is possible (for sure) that there are other
routes and nodes that could not be used in this study. The reason for this
is the lack of information (existence) about them or their neighbouring
nodes. Among them are ARCluster, DXNet, CLX, CCCluster, especially those
nodes that are not directly linked to nodes using PC9x.

Not even 10 hops are necessary to reach a node.
We could infer that with 4 links on average, the 563 nodes would be at a
maximum distance of 5 hops. [SUM(i=1 to 5) f(i)]
Makes you think, doesn't it?


73 de Kin EA3CV


EA3CV-2 dxcluster.cronux.net 7300
http://clustermap.cronux.net/map.html