Algorithms in C
Data networks (2nd ed.)
Telecommunications network design algorithms
Telecommunications network design algorithms
An approach to a problem in network design using genetic algorithms
An approach to a problem in network design using genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic Algorithms for Control and Signal Processing
Genetic Algorithms for Control and Signal Processing
Topological design of local area networks using genetic algorithms
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Evolutionary Techniques for Web Caching
Distributed and Parallel Databases
Spare Capacity Planning for Survivable Mesh Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Multiobjective network design for realistic traffic models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Case studies of network designs with technology considerations
Computer Communications
Survivable and delay-guaranteed backbone wireless mesh network design
Journal of Parallel and Distributed Computing
AIC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Informatics and Communications - Volume 7
IEEE/ACM Transactions on Networking (TON)
On the QoS tree construction in WiMAX mesh networks based on genetic algorithm approach
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
Multicriteria network design using evolutionary algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Managing traffic growth in solar powered wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Multiobjective network topology design
Applied Soft Computing
Optimisation of CDMA-based mobile telephone networks: algorithmic studies on real-world networks
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A genetic algorithm based approach to route selection and capacity flow assignment
Computer Communications
Automated design of hierarchical intranets
Computer Communications
Design of network topology based on delay-cost sink tree
International Journal of Communication Networks and Distributed Systems
Meta-heuristic algorithms for optimized network flow wavelet-based image coding
Applied Soft Computing
Hi-index | 4.11 |
Designing mesh communication networks is a complex, multiconstraint optimization problem. The design of a network connecting 10 Chinese cities demonstrates the elegance and simplicity that genetic algorithms offer in handling such problems. Designs for mesh communication networks must meet conflicting, interdependent requirements. This sets the stage for a complex problem with a solution that targets optimal topological connections, routing, and link capacity assignments. These assignments must minimize cost while satisfying traffic requirements and keeping network delays within permissible values. Since such a problem is NP-complete (one which has a solution in polynomial time, but can only be solved by nondeterministic algorithms), we must use heuristic techniques to handle the complexity and solve practical problems with a modest number of nodes. The heuristic methods used to design mesh networks include branch exchange, cut saturation, and Mentor algorithms. Another heuristic technique, genetic algorithms,1,2 appear ideal to design mesh networks with capability of handling discrete values, multiobjective functions, and multiconstraint problems.3 Existing applications of genetic algorithms to this problem,4-6 however, have only optimized the network topology. They ignore the difficult subproblems of routing and capacity assignment, a crucial determiner of network quality and cost. We present a total solution to mesh network design using a genetic algorithm approach. Not only does our method optimize network topology, it also optimizes routing and capacity assignment. In the following design for a proposed communications network, genetic algorithms produced a solution that costs 9 percent less and has two-thirds the delay of a typical design method. In our method, each optimization level uses genetic algorithms as its core, a similarity that reduces the complexity of system design. The advantages of this approach are not only its elegance and algorithmic simplicity, but also its ability to handle complicated issues such as continuous and discrete link capacities, linear or discrete cost structures, additional constraints, and various constraint models. We believe our genetic-algorithm approach to network design is novel and better than existing methods. Our 10-city network demonstrates that this method can be used for networks of reasonable size with realistic topology and traffic requirement.