Abstract
Computer and communication networks are often stochastic capacitated networks due to partial or complete failure of network components such as links and nodes. Therefore, in practice, network components have different associated costs based on their bandwidth and failure probabilities. Different topologies which are composed of different components of the network may provide various reliability values for a given cost constraint. Finding a topology of a stochastic flow network that can pass a set of demand from multiple sources to multiple destinations with maximum reliability under given cost constraint is an important problem. This work presents an efficient approach to find such topologies in two phases: First, it finds the upper boundary topologies which are subset of topologies that satisfy the cost constraint and are more reliable amongst the others. Second, it evaluates the reliability of upper boundary topologies and chooses the one that provides maximum reliability. Reliability evaluation is computationally hard problem. Proposed method minimizes number of reliability evaluations of topologies through upper boundary topologies. Further, it presents two efficient methods for obtaining the upper boundary flow vectors which are required for reliability evaluation of the upper boundary topologies. We implemented the proposed methods in MATLAB and analyzed their performance using the benchmark networks available in the literature.
Similar content being viewed by others
References
Lin YK (2002) Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab Eng Syst Saf 75:41–46
Datta E, Goyal NK (2017) Sum of disjoint product approach for reliability evaluation of stochastic flow networks. Int J Syst Assur Eng Manag 8:1734–1749
Abd-El-Barr M (2009) Topological network design: a survey. J Netw Comput Appl 32:501–509
Hoc HH (1973) A computational approach to the selection of an optimal network. Manage Sci 19:488–498
Rong-Hong J, Fung-Jen H (1990) Topological optimization problem of communication networks subject to a reliability constraint. In: Proc. IEEE, INFOCOM, vol 2, pp 487–494
Koide T, Shinmori S, Ishii H (2001) Topological optimization with a network reliability constraint. Discrete Appl Math 115:135–149
Aggarwal KK, Chopra YC, Bajwa JS (1982) Topological layout of links for optimizing the s-t reliability in a computer communication system. Microelectron Reliab 22:341–345
Chopra YC, Sohi BS, Tiwari RK, Aggarwal KK (1984) Nework topology for maximizing the terminal reliability in a computer communication network. Microelectron Reliab 24:911–913
Venetsanopoulos AN, Singh I (1987) Network optimization subject to reliability constraints Dordrecht, pp 375–386
Shao F-M, Zhao L-C (1998) Topological optimization of computer network expansion with reliability constraint. Comput Math Appl 35:17–26
Pióro M, Jüttner A, Harmatos J, Szentesi Á, Gajowniczek P, Mysŀek A (2001) Topological design of telecommunication networks Nodes and links localization under demand constraints. In: Teletraffic science and engineering, Elsevier, pp 629–642
Atiqullah MM, Rao SS (1993) Reliability optimization of communication networks using simulated annealing. Microelectron Reliab 33:1303–1319
Kumar A, Pathak RM, Gupta YP, Parsaei HR (1995) A genetic algorithm for distributed system topology design. Comput Ind Eng 28:659–670
Kumar A, Pathak RM, Gupta YP (1995) Genetic-algorithm-based reliability optimization for computer network expansion. IEEE Trans Reliab 44:63–72
Dengiz B, Altiparmak F, Smith AE (1997) Efficient optimization of all-terminal reliable networks, using an evolutionary approach. IEEE Trans Reliab 46:18–26
Deeter DL, Smith AE (1997) Heuristic optimization of network design considering all-terminal reliability. In: Annual reliability and maintainability symposium, pp 194–199
Sheng-Tzong C (1998) Topological optimization of a reliable communication network. IEEE Trans Reliab 47:225–233
AboElFotoh HMF, Al-Sumait LS (2001) A neural approach to topological optimization of communication networks, with reliability constraints. IEEE Trans Reliab 50:397–408
Altiparmak F, Dengiz B (2009) A cross entropy approach to design of reliable networks. Eur J Oper Res 199:542–552
Shukla N, Dashora Y, Tiwari MK, Shankar R (2013) Design of computer network topologies: a vroom inspired psychoclonal algorithm. Appl Math Model 37:888–902
Rahman IJ, Zain AR, Syambas NR (2016) A new heuristic method for optical network topology optimization. In: Proc. 2nd international conference on wireless and telematics (ICWT), pp 73–77
Elshqeirat B, Soh S, Rai S, Lazarescu M (2015) Bi-objective topology design of communication networks using dynamic programming. Int J Perf Eng 11:3
Elshqeirat B, Soh S, Rai S, Lazarescu M (2014) A dynamic programming algorithm for reliable network design. IEEE Trans Reliab 63:443–454
Elshqeirat B, Soh S, Rai S, Lazarescu M (2015) Topology design with minimal cost subject to network reliability constraint. IEEE Trans Reliab 64:118–131
Elshqeirat B, Soh S, Rai S, Manaseer S (2018) On maximizing reliability of network topology design using a practical dynamic programming approach. Mod Appl 12:1
Wang C, Huang N, Bai Y, Zhang S (2018) A method of network topology optimization design considering application process characteristic. Mod Phys Lett B 32:1850091
Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
Gebre BA, Ramirez-Marquez JE (2007) Element substitution algorithm for general two-terminal network reliability analyses. IIE Trans 39:265–275
Rauzy A (2003) A new methodology to handle Boolean models with loops. IEEE Trans Reliab 52:96–105
Datta E, Goyal NK (2019) Reliability evaluation of stochastic flow networks susceptible to contemporaneous demand requirements between multiple sources and multiple destinations. Int J Syst Assur Eng Manag 10:1302–1327
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Datta, E., Goyal, N.K. An efficient approach to find reliable topology of stochastic flow networks under cost constraint. Int. j. inf. tecnol. (2021). https://doi.org/10.1007/s41870-020-00555-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s41870-020-00555-0