Abstract
This paper addresses an NP-complete problem of designing a network topology (NT) with the maximum 2-terminal reliability (R) subject to a cost constraint (C). More specifically, given the locations of the various computer centers (nodes), their connecting links, each link’s reliability and cost, and the maximum budget cost to install the links, the NT design problem, called NTD-RC, aims to find an NT that has the maximum reliability with cost within the budget. Since cost is a major issue in NT design, NTD-RC is applicable for critical applications requiring maximized reliability. This paper formulates a dynamic programming (DP) scheme to help solve NTD-RC. A DP approach, called Algo-DP, finds the set of links to be deleted from the original network to obtain an optimal NT. The paper proposes five-link ordering criteria to improve the performance of Algo-DP. Simulation results on different benchmark networks of various sizes are used to compare Algo-DP with existing techniques in the literature and show the merits of using the sorting methods, and the effectiveness of our algorithm. We found that Algo-DP generates NT with the same or better 2-terminal reliability measure (with up to 4.3% improvement) on 92% of the network topologies. Results indicate Algo-DP demonstrated better performance than other existing algorithm. Furthermore, Algo-DP shows that it is computationally more efficient compared to the recent existing approach.
Highlights
Communication networks (CN) are complex, sophisticated, automated and computerized
We have proposed a heuristic dynamic programming method, called Algo-DP, to solve the problem and five different link ordering methods to optimize its results
Our simulations on 28 topologies show the effectiveness of Algo-DP and the benefits of using the link orders to find the best results
Summary
Communication networks (CN) are complex, sophisticated, automated and computerized. Once a hardware model and technology of a network has been developed, a network designer is challenged with the problem of designing a network that satisfies the performance requirements, e.g., reliability, anticipated by the customer over the intended period of the network’s use (Konak & Smith, 1999). The aim is to produce a network topology with the maximum reliability subject to the cost constraint to install the selected links. Both these problems are NPhard (Abo ElFotoh & Al-Sumait, 2001). We noticed that approaches that are good to solve NTD-CR, e.g., (Gen, 2006), (Atiqullah & Rao, 1993; Chelouah & Siarray, 2000), fail to effectively solve the related NTD-RC They either become computationally expensive or lack the necessary precision to generate an acceptable solution (Elshqeirat, et al, 2015). Authors in (Elshqeirat, et al, July 2013) have used DP approaches Their technique potentially require generating all (s, t) simple paths to solve the problem (refer to Section 2.2).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
