Topological design of computer communication networks using simulated annealing

Engineering Applications of Artificial Intelligence

Volumn 8, Issue 1, 1995, Pages 61-69

  Pierre, Samuel ^a   Hyppolite, Michel Ange ^a   Bourjolly, Jean Marie ^b   Dioume, Oumar ^c  

^a UNIVERSITY OF QUEBEC   (Canada)

^b Gina Cody School of Engineering and Computer Science   (Canada)

^c DTI Télecom ^*  (Canada)

Author keywords

communication network; heuristic method; knowledge based system; Simulated annealing; topological design

Indexed keywords

BLOCK CODES; COMPUTER NETWORKS; CONSTRAINT THEORY; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; RESPONSE TIME (COMPUTER SYSTEMS); SIMULATED ANNEALING;

COMPUTER COMMUNICATION NETWORKS; LEAST COST NETWORK TOPOLOGIES;

DATA COMMUNICATION SYSTEMS;

EID: 0029254013     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/0952-1976(94)00041-K     Document Type: Article

References (35)

1. On the topological design of distributed computer networks
2. Large-scale network topological optimization
3. Approximations and bounds for the topological design of distributed computer networks
4. Practical design tools for large packet-switched networks
5. Fault tolerant packet-switched network design and its sensitivity
6. A new method for topological design in large traffic laden packed-switched networks
7. Topological analysis of packet networks
8. An efficient method for determining economical configurations of elementary packet-switched networks
9. Backbone network design and performance analysis: a methodology for packet switching networks
10. Design of survivable communications networks under performance constraints
11. On the Smallest Disconnecting Set in a Graph
12. A study of fairness in packet-switching networks
13. Integrating heuristic knowledge and optimization models for communication network design
14. Fair integration of routing and flow control in communication networks
15. Interactions between routing and flow control algorithms
16. The partial line digraph technique in the design of large interconnection networks
17. An algorithm for construction of a K-connected graph with minimum number of edges and quasiminimal diameter
18. An adaptive link assignment algorithm for dynamically changing topologies
19. Network survivability through connectivity optimization
20. A cut saturation algorithm for topological design of packet-switched communication networks
21. Reliability optimization in generalized stochastic-flow networks
22. The flow deviation method: an approach to store and forward communication network design
23. Topological considerations in the design of the ARPA computer network
24. The design of store and forward networks for computer communications
25. Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network
26. Application of heuristic problem-solving methods in computer communication networks
27. Specifications of a knowledge system for packet-switched data network topological design
28. Application of artificial intelligence techniques to computer network topology design
29. An artificial intelligence approach for improving computer communications network topologies
30. Optimization by simulated annealing
31. Optimization by simulated annealing: quantitative studies
32. General local search heuristics in combinatorial optimization: a survey
33. Using distributed topology update and preplanned configurations to achieve trunk network survivability