Abstract
In this chapter we use a Hopfield-type neural network to solve the following topology optimization problem. Given a set of n sites, a set of possible links, each link has an associated cost and a probability of failure, we are required to choose a subset of links such that the cost is minimized under the constraint that the network connectivity is not less than a given threshold. The network connectivity is defmed to be the probability that every pair of nodes can communicate with each other (the all-terminal reliability). The neural network consists of n×(n-1)/2 Hysteresis McCulloch-Pitts neurons. The solution of the problem corresponds to the minimum of a Lyapunov (energy) function that represents the constraints of the problem. (This chapter is based on reference [1].)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
AboElFotoh HMF, Al-Sumait LS (2001) A Neural Approach to Topological Optimization of Communication Networks with Reliability Constraints. IEEE Transactions on Reliability, 50:4, 397–408
Boorstyn RR, Frank H (1977) Large-scale network Topological Optimization. IEEE Trans. Communication, com 25:1, 29–47
Chopra YC, Sohi BS, Tiwari, RK, Aggarwal KK (1984) Network Topology for Maximizing the Terminal Reliability in a computer Communication Network. Microelectronics and reliability, 24:5, 911–913
Aggarwal KK, YC Chopra, Bajwa JS (1982) Topological Layout of links for Optimizing the s-t reliability in a computer Communication Network. Microelectronics and reliability, 22:3, 341–345
Jan Rong-Hong (1993) Design of reliable networks. Comp Operation Research, 20:1, 25–34
Jan Rong-Hong, Hwang Fung-Jen, Cheng Sheng Tzong (1993) “Topological Optimization of a Communication Network subject to a Reliability Constraint”, IEEE Trans Reliability, 42:1, 63–70
Aggarwal KK, Chopra YC, Bajwa JS (1982) Topological Layout of links for optimizing the overall reliability in a computer communication system. Microelectronics and reliability, 22:3, 347–351
Colbourn CJ (1987) The Combimatorics of Network Reliability. Oxford University Press
Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco
Deeter DL, Smith AE (1997) Heuristic Optimization of Network design Considering All-terminal Reliability. IEEE 1997 Proceedings annual Reliability and Maintainability Symposium, 194–199
Dengiz B, Altipamak F, Smith AE (1997) Local Search Genetic Algorithm for Optimal Design of Reliable Networks. IEEE Trans Evolutionary Computation, 1:3, 179–188
Kumar A, Pathak RM, Gupta YP, Parsaei HR(1995) A Genetic algorithm for Distributed System Topology Design. Computers ind Eng, 28:3, 659–670
Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52, 141–152
Takefuji Y, Wang J (1996) Neural computing for Optimization and Combinatorics. World Scientific Publishing Co
Fanabiki N, Takefuji Y (1992) A Neural Network Parallel Algorithm for Channel Assignment Problems in Cellular Radio Networks. IEEE Trans Vehicular Technology, 41:4, 430–437
Ali MKM, Kamoun F (1993) Neural networks for Shortest Path computation and Routing in Computer networks. IEEE Trans Neural Networks, 4:6, 941–955
Funabiki N, Nishikawa S (1996) A binary neural network approach for link activation problems in multihop radio networks. IEOCI Trans Comm, E79-B:8, 1086–1093
Funabiki N, Nishikawa S (1997) A Binary Hopfield Neural Network Approach for Satellite Scheduling problems. IEEE Trans Neural Networks. 8:2, 441–445
Takefuji Y, Lee KC (1991) An Artificial Hysteresis Binary Neuron: a Model Suppressing the Oscillatory Behaviors of Neural Dynamics. Biol Cybern, 64, 353–356
Takefuji Y, Lee KC (1991) Artificial neural networks for four-coloring problems and k-colorability problems. IEEE Trans on Circuits and Systems, 38:3, 326–333
Wang L, Ross J (1990) Synchronous neural networks of non-linear threshold elements with hysteresis. Proc. National Academy of Sciences (USA), 87, 988–992
Wang Lipo (1997) Discrete-Time Convergence Theory and updating Rules for Neural Networks with Energy Function. IEEE Trans Neural Networks, 8:2, 445–447
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
AboElFotoh, H.M.F. (2004). Maximizing Topology Connectivity Using a Hopfield Neural Network. In: Soft Computing in Communications. Studies in Fuzziness and Soft Computing, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45090-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-45090-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53623-6
Online ISBN: 978-3-540-45090-0
eBook Packages: Springer Book Archive