Shortening routes obtained by the algorithmic routing through modifying the topological tree

Korolkov I.V.

The Algorithmic Routing method as the abstraction technique for computer networks simulation is considered. Two iterative methods of topology trees improvement are proposed. The first method tests each modification and accepts or rejects it immediately. The second method examines a node, reconnects all possible broken links and after that accepts or rejects the modification based on the overall change in the sum total of the number of hops needed to join all distinct pairs of nodes in the network, and than repeats this for every node. The analysis of routing trees modification for networks of different sizes by both methods and its combination is done.

Full text (pdf)