Decentralized optimal traffic engineering in connectionless networks

Bernardo A. Movsichoff, Constantino Manuel Lagoa, Hao Che

    Research output: Contribution to journalArticle

    23 Citations (Scopus)

    Abstract

    This paper addresses the problem of optimal traffic engineering in a connectionless autonomous system. Based on nonlinear control theory, the approach taken in this paper provides a family of optimal adaptation laws. These laws enable each node in the network to independently distribute traffic among any given set of next hops in an optimal way, as measured by a given global utility function of a general form. This optimal traffic distribution is achieved with minimum information exchange between neighboring nodes. Furthermore, this approach not only allows for optimal multiple forwarding paths but also enables multiple classes of service, e.g., classes of service defined in the differentiated services architecture. Moreover, the proposed decentralized control scheme enables optimal traffic redistribution in the case of link failures. Suboptimal control laws are also presented in an effort to reduce the computational burden imposed on the nodes of the network. Finally, an implementation of these laws with currently available technology is discussed.

    Original languageEnglish (US)
    Pages (from-to)293-303
    Number of pages11
    JournalIEEE Journal on Selected Areas in Communications
    Volume23
    Issue number2
    DOIs
    StatePublished - Feb 1 2005

    Fingerprint

    Decentralized control
    Control theory

    All Science Journal Classification (ASJC) codes

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    @article{0977587d3eaa4cf2b7131c93868620a5,
    title = "Decentralized optimal traffic engineering in connectionless networks",
    abstract = "This paper addresses the problem of optimal traffic engineering in a connectionless autonomous system. Based on nonlinear control theory, the approach taken in this paper provides a family of optimal adaptation laws. These laws enable each node in the network to independently distribute traffic among any given set of next hops in an optimal way, as measured by a given global utility function of a general form. This optimal traffic distribution is achieved with minimum information exchange between neighboring nodes. Furthermore, this approach not only allows for optimal multiple forwarding paths but also enables multiple classes of service, e.g., classes of service defined in the differentiated services architecture. Moreover, the proposed decentralized control scheme enables optimal traffic redistribution in the case of link failures. Suboptimal control laws are also presented in an effort to reduce the computational burden imposed on the nodes of the network. Finally, an implementation of these laws with currently available technology is discussed.",
    author = "Movsichoff, {Bernardo A.} and Lagoa, {Constantino Manuel} and Hao Che",
    year = "2005",
    month = "2",
    day = "1",
    doi = "10.1109/JSAC.2004.839384",
    language = "English (US)",
    volume = "23",
    pages = "293--303",
    journal = "IEEE Journal on Selected Areas in Communications",
    issn = "0733-8716",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "2",

    }

    Decentralized optimal traffic engineering in connectionless networks. / Movsichoff, Bernardo A.; Lagoa, Constantino Manuel; Che, Hao.

    In: IEEE Journal on Selected Areas in Communications, Vol. 23, No. 2, 01.02.2005, p. 293-303.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Decentralized optimal traffic engineering in connectionless networks

    AU - Movsichoff, Bernardo A.

    AU - Lagoa, Constantino Manuel

    AU - Che, Hao

    PY - 2005/2/1

    Y1 - 2005/2/1

    N2 - This paper addresses the problem of optimal traffic engineering in a connectionless autonomous system. Based on nonlinear control theory, the approach taken in this paper provides a family of optimal adaptation laws. These laws enable each node in the network to independently distribute traffic among any given set of next hops in an optimal way, as measured by a given global utility function of a general form. This optimal traffic distribution is achieved with minimum information exchange between neighboring nodes. Furthermore, this approach not only allows for optimal multiple forwarding paths but also enables multiple classes of service, e.g., classes of service defined in the differentiated services architecture. Moreover, the proposed decentralized control scheme enables optimal traffic redistribution in the case of link failures. Suboptimal control laws are also presented in an effort to reduce the computational burden imposed on the nodes of the network. Finally, an implementation of these laws with currently available technology is discussed.

    AB - This paper addresses the problem of optimal traffic engineering in a connectionless autonomous system. Based on nonlinear control theory, the approach taken in this paper provides a family of optimal adaptation laws. These laws enable each node in the network to independently distribute traffic among any given set of next hops in an optimal way, as measured by a given global utility function of a general form. This optimal traffic distribution is achieved with minimum information exchange between neighboring nodes. Furthermore, this approach not only allows for optimal multiple forwarding paths but also enables multiple classes of service, e.g., classes of service defined in the differentiated services architecture. Moreover, the proposed decentralized control scheme enables optimal traffic redistribution in the case of link failures. Suboptimal control laws are also presented in an effort to reduce the computational burden imposed on the nodes of the network. Finally, an implementation of these laws with currently available technology is discussed.

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

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

    U2 - 10.1109/JSAC.2004.839384

    DO - 10.1109/JSAC.2004.839384

    M3 - Article

    AN - SCOPUS:13844267526

    VL - 23

    SP - 293

    EP - 303

    JO - IEEE Journal on Selected Areas in Communications

    JF - IEEE Journal on Selected Areas in Communications

    SN - 0733-8716

    IS - 2

    ER -