Optimization-based, QoS-aware distributed traffic control laws for networks with time-varying link capacities

Wenjing Su, Constantino M. Lagoa, Hao Che

    Research output: Contribution to journalArticle

    1 Scopus citations

    Abstract

    It is a challenge to design optimal, distributed traffic control mechanisms in a network where the link capacities and Class of Service (CoS) requirements may vary with time, such as a virtual network, an overlay network, or a wireless network. In this paper, we develop a family of optimization-based distributed traffic control laws to meet this challenge. This family of control laws enables Quality of Service (QoS), Traffic Engineering (TE), and Failure Recovery (FR) features simultaneously in a network where the link capacities and CoS requirement may vary with time. The approach taken relies on the concept of Sliding Modes to solve the resulting time-varying optimization problem. Running at the edge of a network, a set of control laws selected from this family enables class-of-service-based multi-path load balancing and/or rate adaptation to respond to network congestion, CoS requirement variation and link failures. The only nonlocal information needed as input to the control laws is the number of congested links along a forwarding path. This family of control laws is particularly viable to be implemented in a software-defined network (SDN) where the available underlying resources may not be accurately predictable and vary with time, due to, e.g., network virtualization.

    Original languageEnglish (US)
    Pages (from-to)158-165
    Number of pages8
    JournalAutomatica
    Volume72
    DOIs
    StatePublished - Oct 1 2016

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering
    • Electrical and Electronic Engineering

    Fingerprint Dive into the research topics of 'Optimization-based, QoS-aware distributed traffic control laws for networks with time-varying link capacities'. Together they form a unique fingerprint.

  • Cite this