On generating Pareto optimal set in bi-objective reliable network topology design Online publication date: Mon, 31-Jul-2023
by Basima Elshqeirat; Ahmad Aloqaily; Sieteng Soh; Kwan-Wu Chin; Amitava Datta
International Journal of Grid and Utility Computing (IJGUC), Vol. 14, No. 4, 2023
Abstract: This paper considers an NP-hard network topology design (NTD) problem called NTD-CB/R. A key challenge when solving the bi-objective optimisation problem is to simultaneously minimise cost while maximising bandwidth. This paper aims to generate the best set of non-dominated feasible topologies, known as the Pareto Optimal Set (POS). It formally defines a dynamic programming (DP) formulation for NTD-CB/R. Then, it proposes two alternative Lagrange relaxations to compute a weight for each link. The paper proposes a DP approach, called DPCB/R-LP, to generate POS with maximum weight. Extensive simulations on hundreds of networks that contain up to 299 paths show that DPCB/R-LP can generate 70.4% of the optimal POS while using only up to 984 paths and 27.06 CPU seconds. Overall-Pareto-spread (OR), DPCB/R-LP produces 94.4% of POS with OS = 1, measured against the optimal POS. Finally, all generated POS's with largest bcr, significantly higher than 88% obtained by existing methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook