IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

An algorithm for routing optimization in DiffServ-aware MPLS networks

Listed author(s):
  • Luigi Atzori


    (Dipartimento di Ingegneria Elettrica ed Elettronica Universita' di Cagliari)

  • Fabio D'Andreagiovanni


    (Dipartimento di Informatica e Sistemistica, Universita' di Roma "Sapienza")

  • Carlo Mannino


    (Dipartimento di Informatica e Sistemistica, Universita' di Roma "Sapienza")

  • Tatiana Onali


    (Dipartimento di Ingegneria Elettrica ed Elettronica Universita' di Cagliari)

Registered author(s):

    This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propose a single-phase approach that simultaneously takes into account both preemption and rerouting. In contrast with the standard approach, we always find an optimal solution when enough bandwidth is available. Otherwise, we apply a heuristic post-processing procedure in order to minimize unsatisfied commodities. The routing problem is modeled as a Multicommodity Flow Problem (MCFP) with side constraints, which is solved by a Column Generation approach. Namely, a sequence of restricted MCFPs is solved, by including new routing paths only if necessary. When new requests are routed, the use of existing paths is preferred in order to reduce preemption. Computational experience on real networks shows that the overall approach is able to (i) obtain a good exploitation of the network resources, (ii) achieve a remarkable acceptance rate and, (iii) hold down the impact of rerouting.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    File Function: First version, 2010
    Download Restriction: no

    Paper provided by Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2010-04.

    in new window

    Date of creation: Apr 2010
    Handle: RePEc:aeg:wpaper:2010-4
    Contact details of provider: Phone: +390677274140
    Fax: +39 0677274129
    Web page:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2010-4. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.