Minimal feedback optimal algorithms for traffic engineering in computer networks

Bernardo A. Movsichoff, Constantino Lagoa

    Research output: Contribution to journalConference articlepeer-review


    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)
    Article numberWeC03.6
    Pages (from-to)2396-2402
    Number of pages7
    JournalProceedings of the IEEE Conference on Decision and Control
    StatePublished - Jan 1 2004
    Event2004 43rd IEEE Conference on Decision and Control (CDC) - Nassau, Bahamas
    Duration: Dec 14 2004Dec 17 2004

    All Science Journal Classification (ASJC) codes

    • Control and Systems Engineering
    • Modeling and Simulation
    • Control and Optimization

    Fingerprint Dive into the research topics of 'Minimal feedback optimal algorithms for traffic engineering in computer networks'. Together they form a unique fingerprint.

    Cite this