[go: up one dir, main page]

Pióro et al., 2016 - Google Patents

Optimizing flow thinning protection in multicommodity networks with variable link capacity

Pióro et al., 2016

View PDF
Document ID
10890989038655279851
Author
Pióro M
Fouquet Y
Nace D
Poss M
Publication year
Publication venue
Operations Research

External Links

Snippet

Flow thinning (FT) is a concept of a traffic routing and protection strategy applicable to communication networks with variable capacity of links. In such networks, the links do not attain their nominal (maximum) capacity simultaneously, so in a typical network state only …
Continue reading at hal.science (PDF) (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/5695—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/12—Congestion avoidance or recovery
    • 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/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/5019—Ensuring SLA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/82—Miscellaneous aspects
    • 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/22—Alternate 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/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/30—Special provisions for routing multiclass traffic
    • H04L45/306—Route determination based on the nature of the carried application
    • 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/30—Special provisions for routing multiclass traffic
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATIONS NETWORKS
    • H04W28/00—Network traffic or resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]

Similar Documents

Publication Publication Date Title
Pióro et al. Optimizing flow thinning protection in multicommodity networks with variable link capacity
Kodialam et al. Dynamic routing of bandwidth guaranteed tunnels with restoration
US7778182B2 (en) Method and apparatus for communications traffic engineering
US7864751B2 (en) Traffic engineering method, system and computer program product for managing traffic over dynamic networks during both normal and unexpected traffic scenarios
US8027245B2 (en) Efficient and robust routing of potentially-variable traffic for path restoration following link failure
US6978394B1 (en) Linear program-based technique for placing FRR TE tunnels with bandwidth guarantee
Zhang et al. Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
Seok et al. Explicit multicast routing algorithms for constrained traffic engineering
Iosifidis et al. The impact of storage capacity on end-to-end delay in time varying networks
Lemeshko et al. Design and research of the model for secure traffic engineering fast ReRoute under traffic policing approach
Wang et al. Reliability as an interdomain service
Seok et al. Dynamic constrained traffic engineering for multicast routing
Bley et al. Optimization of OSPF routing in IP networks
EP2898626A1 (en) Method and system for supporting dynamic resource management in a backhaul network
Mereu et al. Primary and backup paths optimal design for traffic engineering in hybrid IGP/MPLS networks
Ott et al. Algorithms for flow allocation for multi protocol label switching
Zhang et al. A practical traffic control scheme with load balancing based on PCE architecture
Yetginer et al. Robust path design algorithms for traffic engineering with restoration in MPLS networks
Pióro et al. An optimization model for communication networks with partial multiple link failures
Walkowiak Survivable online routing for MPLS traffic engineering
Lessmann Resource optimization in realistic mobile backhaul networks
Karasan et al. Robust path design algorithms for traffic engineering with restoration in MPLS networks
Fouquet et al. Elastic routing: a distributed variant, implementation issues, and numerical results
Saidi On end-to-end protection of service function chain
Lassila et al. Dimensioning of data networks: a flow‐level perspective