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
Abstract-This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is practical for critical applications requiring minimized cost. The paper formulates a dynamic programming (DP) scheme to solve NTD-CR problem. DP approach, called DPCR-ST, generates the topology using a selected set of spanning trees of the network, STX min . We propose three greedy heuristics to generate and order only k spanning trees of the network. Each heuristic allows DPCR-ST to enumerate STX min using only k spanning trees, which improves the time complexity while producing near optimal topology. Simulations based on fully connected networks that contain up to 2.3×10 9 spanning trees show the merits of ordering methods and the effectiveness of our algorithm vis-à-vis four existing state-of-the-art techniques; DPCR-ST produces 81.5% optimal results, while using only 0.77%of the spanning trees contained in network.Index Terms-Dynamic programing, network optimization, network reliability, network topology design.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.