A Sliding Mode Approach to Traffic Engineering in Computer Networks

Bernardo A. Movsichoff, Constantino Manuel Lagoa, Hao Che

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    In this chapter, we address the problem of optimal Traffic Engineering (TE) in computer networks; i.e., determining an optimal traffic allocation in the presence of both multiple paths and multiple Classes of Service (CoSs). More precisely, we aim at designing data rate adaptation laws that maximize the utilization of the network resources (as measured by a given utility function) subject to link capacity constraints and call service requirements. This problem, as it is formulated here, is an "easy" problem; i.e., the problem of optimal traffic allocation can be stated as maximizing a concave function subject to linear constraints. Hence, if global information is available, one could use well-known algorithms, such as gradient descent, to determine the optimal traffic allocation.

    Original languageEnglish (US)
    Title of host publicationAdvances in Communication Control Networks
    EditorsSophie Tarbouriech, Chaouki Abdallah, John Chiasson
    Pages111-136
    Number of pages26
    Publication statusPublished - Dec 1 2005

    Publication series

    NameLecture Notes in Control and Information Sciences
    Volume308
    ISSN (Print)0170-8643

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Library and Information Sciences

    Cite this

    Movsichoff, B. A., Lagoa, C. M., & Che, H. (2005). A Sliding Mode Approach to Traffic Engineering in Computer Networks. In S. Tarbouriech, C. Abdallah, & J. Chiasson (Eds.), Advances in Communication Control Networks (pp. 111-136). (Lecture Notes in Control and Information Sciences; Vol. 308).