Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing
BT Technology Journal
Improving communication network topologies using tabu search
LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Proceedings of the 2003 ACM symposium on Applied computing
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
An interactive augmented max-min MCS-RSM method for the multi-objective network reliability problem
International Journal of Systems Science
Topological optimization of the large-scale data transmission networks
Automation and Remote Control
Multiobjective network design for realistic traffic models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Building Multiobjective Resilient Networks
UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation
Local search genetic algorithm for optimal design of reliablenetworks
IEEE Transactions on Evolutionary Computation
Maximum entropy method and underdetermined systems applied to computer network topology and routing
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A heuristic algorithm for the network design problem
NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
An algorithm for the network design problem based on the maximum entropy method
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
| Hi-index | 0.00 |
We consider the problem of topological optimization of communication networks subject to a number of design constraints, such as maximum network diameter, maximum node degree, k-node (link) survivability, and network fault tolerance. The primary design problem can be described as follows: Given a set of network nodes, it is required to find a topology @J, selected from all possible topologies, so that the cost of @J (measured possibly in terms of the maximum diameter, maximum node degree, etc.) is less than that of any other network topology and such that @J satisfies some given design constraints. Fault tolerance is concerned with the ability of the network nodes to communicate in the presence of a set of faulty links and/or nodes. The network design problem considering reliability constraints is NP-hard. We classify the research efforts presented in the literature for solving the topological optimization design problem as hierarchical, enumerative, or iterative techniques. In this paper, we provide a survey of the topological network design techniques under different design constraints. Experimental results obtained by applying a number of algorithms to a set of randomly generated networks are presented and compared.