Topology Design with Minimal Cost Subject to Network Reliability Constraint

Abstract

This paper addresses an NP-hard problem, refered to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. The paper describes a dynamic programming (DP) scheme to solve the NTD-CR problem, and proposes a DP approach, called Dynamic Programming Algorithm to solve NTD-CR (DPCR-ST), to generate the topology using a selected sequence of spanning trees of the network, . The paper shows that our DPCR-ST approach always provides a feasible solution, and produces an optimal topology given an optimal order of spanning trees. The paper proves that the problem of optimally ordering the spanning trees is NP-complete, and proposes three greedy heuristics to generate and order only spanning trees of the network. Each heuristic allows the DPCR-ST approach to generate using only spanning trees, which improves the time complexity while producing a near optimal topology. Simulations based on fully connected networks that contain up to spanning trees show the merits of using the ordering methods and the effectiveness of our algorithm vis-à-vis to four existing state-of-the-art techniques. Our DPCR-ST approach is able to generate 81.5% optimal results, while using only 0.77% of the spanning trees contained in networks. Further, for a typical 2 100 grid network that contains up to spanning trees, DPCR-ST approach requires only spanning trees to generate a topology with a reliability no larger than 5.05% off from optimal.Index Terms-Dynamic programming, network optimization, network reliability, network topology design. 0018-9529

FRADIR: A Novel Framework for Disaster Resilience

“…This is accomplished by diversifying the devices used in the network and optimally placing them in the network topology. In [13], the authors tackle a problem of designing a minimum cost network topology subject to a predefined reliability constraint. The resolution approach is based on finding a sequence of spanning trees, in an order given by different greedy heuristics.…”

“…Several works address how to improve the availability or reliability of transport networks against certain failure events (e.g., single link failures), such as reducing the mean time to repair (MTTR) of the links by optimized labor force allocation [9], while others use network design tools [10]- [13]. The spine concept was first presented in [14] to denote a highly available part of the network at the physical layer.…”

Measuring Component Importance for Network System Using Cellular Automata

“…However, an obvious shortcoming is that the impact of the component characteristic on the failure rate of network is not considered. Some examples, including the reliability of Boolean polynomial [7], minimum spanning tree [14,15], minimum cut set and minimum path set [16], and fault-tree analysis [9], attempting to incorporate 2 Complexity more features of network topology consisting of multiple terminals and dependency between topology are researched. Meanwhile, simulation based on Monte Carlo method [10] often depends more on the convergence of probability than the number of network components; statistical error during reliability analysis may result in slow convergence for achieving acceptable accuracy in low probability estimations.…”

Design of a Heuristic Topology Generation Algorithm in Multi-Domain Optical Networks

“…Owing to the 3-Dimensional integration has the higher packing density and the shorter wire length, they design a novel 3D torus topology along with simplified inter-layer and vertical optical routers, in order to achieve a better performance [5]. The other paper also addresses an NP-hard problem, referred to as network topology design with minimum cost subject to a reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint [6]. For the complex topology network, someone introduces an algorithm to construct a plant topology from analyzing correlations in operations data and iteratively combining pieces of information to the final result [7].…”