[go: up one dir, main page]

Fortz et al., 2017 - Google Patents

A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem

Fortz et al., 2017

View PDF
Document ID
6521507654815399495
Author
Fortz B
Gorgone E
Papadimitriou D
Publication year
Publication venue
Networks

External Links

Snippet

During the planning of communication networks, the routing decision process (distributed and online) often remains decoupled from the network design process, that is, resource installation and allocation‐planning process (centralized and offline). To reconcile both …
Continue reading at orbi.uliege.be (PDF) (other versions)

Classifications

    • 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
    • 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
    • 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/08—Configuration management of network or network elements
    • H04L41/0803—Configuration setting of network or network elements
    • 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
    • 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
    • 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]
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • 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"
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks

Similar Documents

Publication Publication Date Title
Yeremenko et al. Secure routing in reliable networks: proactive and reactive approach
US8949959B2 (en) Reduced authentication times for shared-media network migration
Thar et al. Online caching and cooperative forwarding in information centric networking
Mattia et al. A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
US10158554B1 (en) Heuristic topology management system for directional wireless networks
Fortz et al. A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
Salman et al. Boosting performance for software defined networks from traffic engineering perspective
Li et al. Optimal resource allocation for heterogeneous traffic in multipath networks
Tsygankov et al. Network aware VM load balancing in cloud data centers using SDN
Papadimitriou et al. A rolling horizon heuristic for the multiperiod network design and routing problem
Vallet et al. Online OSPF weights optimization in IP networks
Clímaco et al. MCDA/M in telecommunication networks: challenges and trends
Tseng et al. Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints
Saputra et al. JOCAR: A jointly optimal caching and routing framework for cooperative edge caching networks
Papadimitriou et al. Lagrangian relaxation for the time-dependent combined network design and routing problem
Santos et al. A hybrid column generation with GRASP and path relinking for the network load balancing problem
Su et al. Efficient algorithms for scheduling multiple bulk data transfers in inter‐datacenter networks
Ren et al. The packing problem of uncertain multicasts
Song et al. Enabling Robust and Generalized DRL-Driven Routing Optimization via Exploration of Graph Neural Networks
Ba et al. Reducing the power consumption of hose‐model networks with bundled links
Yu et al. An efficient approximate algorithm for disjoint QoS routing
Li et al. Global optimal rate control and scheduling for spectrum-sharing multi-hop networks
Wei et al. A simulated annealing based heuristic for the multi-source single-path multi-commodity network flow problem
Khallef et al. ILP formulation of the exact solution of multi-constrained minimum cost multicast
de Deus et al. Internet capacity: optimizing autonomous system inbound traffic using specialist knowledge as support for decision-making