[go: up one dir, main page]

El Azouzi et al., 2003 - Google Patents

Constrained traffic equilibrium in routing

El Azouzi et al., 2003

View PDF
Document ID
12554389380426278310
Author
El Azouzi R
Altman E
Publication year
Publication venue
IEEE Transactions on Automatic Control

External Links

Snippet

We study noncooperative routing in which each user is faced with a multicriterion optimization problem, formulated as the minimization of one criterion subject to constraints on others. We address the questions of existence and uniqueness of equilibrium. We show …
Continue reading at www-sop.inria.fr (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/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • 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
    • H04L45/121—Minimizing delay
    • 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
    • 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/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • 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
    • H04L45/123—Evaluation of link metrics
    • 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/5003—Managing service level agreement [SLA] or interaction between SLA and quality of service [QoS]
    • 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
    • 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/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/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/30—Special provisions for routing multiclass traffic
    • H04L45/306—Route determination based on the nature of the carried application

Similar Documents

Publication Publication Date Title
Lazar et al. Virtual path bandwidth allocation in multiuser networks
Altman et al. Equilibrium, games, and pricing in transportation and telecommunication networks
Bahk et al. Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network
El Azouzi et al. Constrained traffic equilibrium in routing
Hu et al. Reliable and load balance-aware multi-controller deployment in SDN
Hyman et al. Joint scheduling and admission control for ATS-based switching nodes
Marbach Pricing differentiated services networks: Bursty traffic
Kameda et al. Inefficient noncooperation in networking games of common-pool resources
Arif et al. Load balancing routing in time-sensitive networks
De Veciana et al. Stability and performance analysis of networks supporting services with rate control-could the internet be unstable?
Lemeshko et al. Quality of Service Protection Scheme under Fast ReRoute and Traffic Policing Based on Tensor Model of Multiservice Network
Yang et al. Quality of service routing algorithms for bandwidth-delay constrained applications
Xiao et al. Constrained shortest link-disjoint paths selection: A network programming based approach
Lemeshko et al. QoE-centric adaptive multipath routing under R-factor with load balancing in SDN
Feng et al. A delay-aware deployment policy for end-to-end 5G network slicing
Wang et al. An atomic routing game for multi-class communication networks with quality of service requirements
Sahin et al. A flow and routing control policy for communication networks with multiple competitive users
Mori Controller parameterization of Anantharam's example
Raychev et al. Optimizing SDN Control Plane Scalability by Efficient Switch to Controller Migration
Tizghadam et al. On traffic-aware betweenness and network criticality
Yaghmaei et al. A fuzzy QoS routing algorithm for communication networks
Ninan et al. Pricing mediated bandwidth allocation for the next generation Internet
Hendling et al. A new bandwidth guaranteed routing approach for online calculation of LSPs for MPLS traffic engineering
El-Azouzi et al. Combined competitive flow control and routing in multiuser communication network with hard side-constraints
Garcia et al. Optimal lsp placement with qos constraints in diffserv/mpls networks