Abstract
AbstractNetwork topological optimization in communication network is to find the topological layout of network links with the minimal cost under the constraint that all-terminal reliability of network is not less than a given level of system reliability. The all-terminal reliability is defined as the probability that every pair of nodes in the network can communicate with each other. The topological optimization problem is an NP-hard combinatorial problem. In this paper, a noisy chaotic neural network model is adopted to solve the all-terminal network design problem when considering cost and reliability. Two sets of problems are tested and the results show better performance compared to previous methods, especially when the network size is large.KeywordsTopological OptimizationTravel Salesman ProblemTravel Salesman ProblemTopological Optimization ProblemNetwork ReliabilityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
