Implementation of Lavia-Manning algorithm for network topology design

In this work the problem of network topology design is considered. It is crucial that network continues to work even if some nodes or links fail. Survivability criterion poses a demand for a certain number of distinct paths between each pair of nodes in the network. Diameter of the network is the maximum number of hops in a path between any two non-adjacent nodes and to bound maximum delay in the network, this criteria is also taken into account. We are presenting an implementation of the algorithm that satisfies criterion of survivability, bounded delay and has minimum cost. Finally we give design examples with the concrete networks.