Kim et al., 1999 - Google Patents
Bicriteria network design using a spanning tree-based genetic algorithmKim et al., 1999
- Document ID
- 9868983526411431819
- Author
- Kim J
- Gen M
- Ida K
- Publication year
- Publication venue
- Artificial Life and Robotics
External Links
Snippet
The optimization problems in communication networks have received the attention of many researchers in such related fields as network designer, network analysis, and network administration. The use of computer communication networks has been increasing rapidly in …
- 230000002068 genetic 0 title abstract description 25
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
- H04Q3/0075—Fault management techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Gen et al. | A spanning tree-based genetic algorithm for bicriteria topological network design | |
Cheng | Topological optimization of a reliable communication network | |
Zhou et al. | A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm | |
Gen et al. | Network design techniques using adapted genetic algorithms | |
Altiparmak et al. | Optimal design of reliable computer networks: A comparison of metaheuristics | |
Elshqeirat et al. | Topology design with minimal cost subject to network reliability constraint | |
CN104618134B (en) | A kind of multistage light splitting passive optical network optimization method of power distribution communication net | |
CN113190939B (en) | Large sparse complex network topology analysis and simplification method based on polygon coefficient | |
Kim et al. | Bicriteria network design using a spanning tree-based genetic algorithm | |
Berretta et al. | Enhancing the performance of memetic algorithms by using a matching-based recombination algorithm | |
Szlachcic | Fault tolerant topological design for computer networks | |
Przewozniczek et al. | Empirical problem decomposition—the key to the evolutionary effectiveness in solving a large-scale non-binary discrete real-world problem | |
Kim et al. | Hierarchical spanning tree network design with Nash genetic algorithm | |
Premkumar et al. | Telecommunications network design—Comparison of alternative approaches | |
Przewoźniczek | Subpopulation initialization driven by linkage learning for dealing with the Long-Way-To-Stuck effect | |
Saxena | A survey of evolving models for weighted complex networks based on their dynamics and evolution | |
Nakashima et al. | Performance evaluation of combined cellular genetic algorithms for function optimization problems | |
Doostie et al. | A Novel Genetic Algorithm-Based Methodology for Large-Scale Fixed Charge Plus Routing Network Design Problem With Efficient Operators | |
CN115086224B (en) | Shortest route implementation method and system based on Farey model | |
Mahmood et al. | Reliability evaluation using a clustering technique based on tie-set method | |
Akram et al. | Genetic algorithm-based optimized fuzzy adaptive path selection in wireless sensor networks | |
Hashemi et al. | An ACO algorithm to design UMTS access network using divided and conquer technique | |
Liu et al. | [Retracted] Fault‐Tolerant Secure Routing Based on Trust Evaluation Model in Data Center Networks | |
Elshqeirat | Optimizing reliable network topology design using dynamic programming | |
CN110233752B (en) | Robust deployment method and device for anti-attack controller |