[go: up one dir, main page]

Bentall et al., 1997 - Google Patents

Benchmarking the restoration of heavily loaded networks using a two dimensional order-based genetic algorithm

Bentall et al., 1997

Document ID
11219387601622776614
Author
Bentall M
Turton B
Hobbs C
Publication year
Publication venue
Second International Conference On Genetic Algorithms In Engineering Systems: Innovations And Applications

External Links

Snippet

Modern telecommunication network operators are demanding high utilisation, fast and robust networks. Network equipment manufactures are investigating techniques to design robust networks while maintaining their high utilisation. One technique is based on …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • 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/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
    • H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
    • 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/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/22—Arrangements for maintenance or administration or management of packet switching networks using GUI [Graphical User Interface]
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Waxman Performance evaluation of multipoint routing algorithms
CN107317697B (en) A Routing Configuration Method for OSPF and SDN Hybrid Network
Sahoo et al. Optimal controller selection in software defined network using a greedy-SA algorithm
Kumar et al. Topological design of communication networks using multiobjective genetic optimization
Viet et al. Traffic engineering for multiple spanning tree protocol in large data centers
CN109347657A (en) The virtual data domain construction method of scientific and technological business is supported under SDN mode
Banerjee et al. Multiobjective network design for realistic traffic models
Al-Rumaih et al. Spare capacity planning for survivable mesh networks
Cavers Cutset manipulations for communication network reliability estimation
Bentall et al. Benchmarking the restoration of heavily loaded networks using a two dimensional order-based genetic algorithm
Garcia et al. Iterative improvement methods for a multiperiod network design problem
US9009004B2 (en) Generating interconnect fabric requirements
Maruyama et al. Heuristic design algorithm for computer communication networks with different classes of packets
US20010015958A1 (en) Complex node representations in PNNI systems
Shami et al. Evolving simple fault-tolerant routing rules using genetic programming
Khodayari et al. Network routing based on reinforcement learning in dynamically changing networks
Oommen et al. Discretized learning automata solutions to the capacity assignment problem for prioritized networks
Mohammad et al. Localized quality based QoS routing
Przewoźniczek et al. Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
KR101806932B1 (en) Load balancer and thereof method using genetic algorithm
Thompson et al. Comparison of two swap heuristics with a genetic algorithm for the design of an ATM network
Józsa et al. Reroute sequence planning for label switched paths in multiprotocol label switching networks
Dasgupta et al. Optimization of multiple objectives and topological design of data networks using genetic algorithm
Kumar Multicriteria network design using distributed evolutionary algorithm
Ho et al. Using local search for traffic engineering in switched ethernet networks