Adaptive control algorithms for decentralized optimal traffic engineering in the internet

Constantino Manuel Lagoa, Hao Che, Bernardo A. Movsichoff

    Research output: Contribution to journalArticle

    49 Citations (Scopus)

    Abstract

    In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.

    Original languageEnglish (US)
    Pages (from-to)415-428
    Number of pages14
    JournalIEEE/ACM Transactions on Networking
    Volume12
    Issue number3
    DOIs
    StatePublished - Jun 1 2004

    Fingerprint

    Internet
    Control theory
    Feedback

    All Science Journal Classification (ASJC) codes

    • Software
    • Computer Science Applications
    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    @article{131870e8cb48461991c870ad3cd12e6f,
    title = "Adaptive control algorithms for decentralized optimal traffic engineering in the internet",
    abstract = "In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family {"}steers{"} the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the {"}right{"} control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.",
    author = "Lagoa, {Constantino Manuel} and Hao Che and Movsichoff, {Bernardo A.}",
    year = "2004",
    month = "6",
    day = "1",
    doi = "10.1109/TNET.2004.828949",
    language = "English (US)",
    volume = "12",
    pages = "415--428",
    journal = "IEEE/ACM Transactions on Networking",
    issn = "1063-6692",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "3",

    }

    Adaptive control algorithms for decentralized optimal traffic engineering in the internet. / Lagoa, Constantino Manuel; Che, Hao; Movsichoff, Bernardo A.

    In: IEEE/ACM Transactions on Networking, Vol. 12, No. 3, 01.06.2004, p. 415-428.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Adaptive control algorithms for decentralized optimal traffic engineering in the internet

    AU - Lagoa, Constantino Manuel

    AU - Che, Hao

    AU - Movsichoff, Bernardo A.

    PY - 2004/6/1

    Y1 - 2004/6/1

    N2 - In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.

    AB - In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.

    UR - http://www.scopus.com/inward/record.url?scp=4344571007&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=4344571007&partnerID=8YFLogxK

    U2 - 10.1109/TNET.2004.828949

    DO - 10.1109/TNET.2004.828949

    M3 - Article

    VL - 12

    SP - 415

    EP - 428

    JO - IEEE/ACM Transactions on Networking

    JF - IEEE/ACM Transactions on Networking

    SN - 1063-6692

    IS - 3

    ER -