[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

de Oliveira et al., 2020 - Google Patents

Firefly algorithm based optimization model for planning of optical transport networks

de Oliveira et al., 2020

View PDF
Document ID
5259905318793031437
Author
de Oliveira B
de SOUSA M
Vieira F
Publication year
Publication venue
Advances in Electrical and Computer Engineering

External Links

Snippet

The growth in data traffic is raising serious challenges for OTN in terms of improving their capacity efficiency in order to meet the new traffic requirements. Under these circumstances, the task of efficiently utilizing available resources opens opportunities for the development of …
Continue reading at www.researchgate.net (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0637—Strategic management or analysis
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • 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/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Rusek et al. RouteNet: Leveraging graph neural networks for network modeling and optimization in SDN
Festa et al. An annotated bibliography of GRASP–Part II: Applications
Panayiotou et al. Survey on machine learning for traffic-driven service provisioning in optical networks
De Araújo et al. An evolutionary approach with surrogate models and network science concepts to design optical networks
Xiao et al. Service-oriented DU-CU placement using reinforcement learning in 5G/B5G converged wireless-optical networks
Chu et al. Digital data networks design using genetic algorithms
Przewoźniczek et al. Towards solving practical problems of large solution space using a novel pattern searching hybrid evolutionary algorithm–an elastic optical network optimization case study
Liu et al. Performance studies of evolutionary transfer learning for end-to-end QoT estimation in multi-domain optical networks
Haddaji et al. BackHauling-as-a-service (BHaaS) for 5G optical sliced networks: An optimized TCO approach
de Oliveira et al. Firefly algorithm based optimization model for planning of optical transport networks
US10791034B2 (en) Telecommunications network planning
Kong et al. Path-link graph neural network for IP network performance prediction
de Oliveira et al. A hybrid firefly-genetic algorithm for planning of optical transport networks
Ignacio et al. Lower and upper bounds for a two-level hierarchical location problem in 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
Aibin LSTM for cloud data centers resource allocation in software-defined optical networks
Mesquita et al. Resource planning on elastic optical networks using traffic matrix prediction
Clímaco et al. MCDA/M in telecommunication networks: challenges and trends
Cheng et al. Routing and spectrum assignment employing long short-term memory technique for elastic optical networks
Brintrup et al. Multi-objective optimisation of reliable product-plant network configuration
Candeias et al. Memetic evolutionary algorithms to design optical networks with a local search that improves diversity
Lezama et al. Routing and spectrum allocation in flexgrid optical networks using differential evolution optimization
Shen et al. A tabu search algorithm for the routing and capacity assignment problem in computer networks
Lemamou et al. A hybrid iterated local search algorithm for the global planning problem of survivable 4G wireless networks
Przewozniczek et al. The practical use of problem encoding allowing cheap fitness computation of mutated individuals