Minimal feedback optimal algorithms for traffic engineering in computer networks

Bernardo A. Movsichoff, Constantino Manuel Lagoa

    Research output: Contribution to journalArticle

    Abstract

    This paper addresses the problem of Traffic Engineering in Computer Networks. More precisely, optimal data rate adaptation laws are provided, which are applicable to networks where both multiple paths are available between any pair of source/destination nodes and multiple Classes of Service are to be provided. In particular, it is shown that the algorithms presented only need a minimal amount of information to achieve the optimal operating point More precisely, they only require knowledge of whether a path is congested or not Hence, the control laws provided in this paper require much less feedback than currently available ones. The proposed approach is applicable to utility functions of a very general form and endows the network with the very important property of robustness with respect to node/link failures; i.e., upon the occurrence of such failure, the presented control laws reroute traffic away from the inoperative node/link and converge to the optimal allocation for the "reduced" network.

    Original languageEnglish (US)
    Pages (from-to)2396-2402
    Number of pages7
    JournalProceedings of the IEEE Conference on Decision and Control
    Volume3
    StatePublished - 2004

    Fingerprint

    Traffic Engineering
    Computer Networks
    Computer networks
    Optimal Algorithm
    Feedback
    Vertex of a graph
    Rate Adaptation
    Path
    Optimal Allocation
    Utility Function
    Traffic
    Robustness
    Converge

    All Science Journal Classification (ASJC) codes

    • Chemical Health and Safety
    • Control and Systems Engineering
    • Safety, Risk, Reliability and Quality

    Cite this

    @article{b46313538aff42daa824e27e3dc0d61a,
    title = "Minimal feedback optimal algorithms for traffic engineering in computer networks",
    abstract = "This paper addresses the problem of Traffic Engineering in Computer Networks. More precisely, optimal data rate adaptation laws are provided, which are applicable to networks where both multiple paths are available between any pair of source/destination nodes and multiple Classes of Service are to be provided. In particular, it is shown that the algorithms presented only need a minimal amount of information to achieve the optimal operating point More precisely, they only require knowledge of whether a path is congested or not Hence, the control laws provided in this paper require much less feedback than currently available ones. The proposed approach is applicable to utility functions of a very general form and endows the network with the very important property of robustness with respect to node/link failures; i.e., upon the occurrence of such failure, the presented control laws reroute traffic away from the inoperative node/link and converge to the optimal allocation for the {"}reduced{"} network.",
    author = "Movsichoff, {Bernardo A.} and Lagoa, {Constantino Manuel}",
    year = "2004",
    language = "English (US)",
    volume = "3",
    pages = "2396--2402",
    journal = "Proceedings of the IEEE Conference on Decision and Control",
    issn = "0191-2216",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    Minimal feedback optimal algorithms for traffic engineering in computer networks. / Movsichoff, Bernardo A.; Lagoa, Constantino Manuel.

    In: Proceedings of the IEEE Conference on Decision and Control, Vol. 3, 2004, p. 2396-2402.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Minimal feedback optimal algorithms for traffic engineering in computer networks

    AU - Movsichoff, Bernardo A.

    AU - Lagoa, Constantino Manuel

    PY - 2004

    Y1 - 2004

    N2 - This paper addresses the problem of Traffic Engineering in Computer Networks. More precisely, optimal data rate adaptation laws are provided, which are applicable to networks where both multiple paths are available between any pair of source/destination nodes and multiple Classes of Service are to be provided. In particular, it is shown that the algorithms presented only need a minimal amount of information to achieve the optimal operating point More precisely, they only require knowledge of whether a path is congested or not Hence, the control laws provided in this paper require much less feedback than currently available ones. The proposed approach is applicable to utility functions of a very general form and endows the network with the very important property of robustness with respect to node/link failures; i.e., upon the occurrence of such failure, the presented control laws reroute traffic away from the inoperative node/link and converge to the optimal allocation for the "reduced" network.

    AB - This paper addresses the problem of Traffic Engineering in Computer Networks. More precisely, optimal data rate adaptation laws are provided, which are applicable to networks where both multiple paths are available between any pair of source/destination nodes and multiple Classes of Service are to be provided. In particular, it is shown that the algorithms presented only need a minimal amount of information to achieve the optimal operating point More precisely, they only require knowledge of whether a path is congested or not Hence, the control laws provided in this paper require much less feedback than currently available ones. The proposed approach is applicable to utility functions of a very general form and endows the network with the very important property of robustness with respect to node/link failures; i.e., upon the occurrence of such failure, the presented control laws reroute traffic away from the inoperative node/link and converge to the optimal allocation for the "reduced" network.

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

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

    M3 - Article

    VL - 3

    SP - 2396

    EP - 2402

    JO - Proceedings of the IEEE Conference on Decision and Control

    JF - Proceedings of the IEEE Conference on Decision and Control

    SN - 0191-2216

    ER -