Skip to main content
SpringerLink
Log in

A Preemption-Aware On-line Routing Algorithm for MPLS Networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In the context of Multiprotocol Label Switching (MPLS), we look at the problem of organizing the mapping of Label Switched Paths (LSPs) in an optimal way throughout the network on the basis of a given objective function. This problem is highly combinatorial and makes dynamic and real-time features a difficult issue for any LSP routing scheme. For this reason, we propose a computationally efficient, though approximate, on-line scheme adapted to an incremental optimization of the network state. We also propose an integration of a computationally efficient preemption mechanism into this approximation. The efficiency of this algorithm is obtained through a very rigid but seemingly appropriate policy concerning which LSPs are appropriate for preemption. A feedback from preemption on the routing process is proposed, in order to regulate the rate of the reroutings and to tune the balance between stability and continuous reorganization in a network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Aukia, M. Kodialam, P. Koppol, T. Lakshman, H. Sarin and B. Suter, RATES: A server for MPLS traffic engineering, IEEE Network Magazine 2 (March/April 2000) 34–41.

    Google Scholar 

  2. D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan and G. Swallow, RSVP-TE: Extensions to RSVP for LSP tunnels, RFC 3209 (December 2001).

  3. G. Banerjee and D. Sidhu, Comparative analysis of path computation techniques for MPLS traffic engineering, Computer Networks 40 (2002) 149–165.

    Google Scholar 

  4. R. Bellman and R. Kalaba, Shortest paths through networks, in: Dynamic Programming and Modern Control Theory (Academic Press, New York, 1965) pp. 50–54.

    Google Scholar 

  5. F. Blanchy, L. Mélon and G. Leduc, Assessment of protocols and algorithms for intra-domain traffic engineering, Deliverable 3.2 for the ATRIUM project funded by the European Commission, available at http://run.montefiore.ulg.ac.be/~blanchy (January 2003).

  6. F. Blanchy, L. Mélon and G. Leduc, An efficient decentralized on-line traffic engineering algorithm for MPLS networks, in: Proc. of 18th Internat. Teletraffic Congress (ITC 18), September 2003, Berlin, Germany.

  7. J. de Oliveira, C. Scoglio, I. Akyildiz and G. Uhl, A new preemption policy for diffserv-aware traffic engineering to minimize rerouting, in: IEEE INFOCOM, Vol. 1, June 2002, pp. 665–704.

  8. E. Rosen, A. Viswanathan and R. Calon, Multiprotocol label switching architecture, RFC 3031 (January 2001).

  9. F. L. Faucheur and W. Lai, Requirements for support of diff-serv-aware MPLS traffic engineering, IETF draft draft-ietf-tewg-diff-te-reqts-06.txt (September 2002).

  10. B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: IEEE INFOCOM, Vol. 2, 2000, pp. 519–528.

  11. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).

    Google Scholar 

  12. B. Jamoussi, ed., L. Andersson, R. Callon, R. Dantu, L. Wu, P. Doolan, T. Worster, N. Feldman, A. Fredette, M. Girish, E. Gray, J. Heinanen, T. Kilty and A. Malis, Constraint-based LSP setup using LDP, RFC 3212 (January 2002).

  13. M. S. Kodialam and T. V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, in: IEEE INFOCOM, Vol. 2, 2000, pp. 884–893.

  14. L. Mélon, F. Blanchy and G. Leduc, Decentralized local backup LSP calculation with efficient bandwidth sharing, in: Proc. of 10th Internat. Conf. on Telecommunications (ICT '2003), February 2003, Papeete, Tahiti.

  15. M. Peyravian and A.D. Kshemkalyani, Connection preemption: Issues, algorithms, and a simulation study, in: IEEE INFOCOM, April 1997, pp. 143–151.

  16. E. Ricciato, S. Salsano, A. Belmonte and M. Listanti, Offline configuration of a MPLS over WDM network under time-varying offered traffic, in: IEEE INFOCOM, Vol. 1, June 2002, pp. 57–65.

  17. P. Srisuresh and P. Joseph, TELSAs to extend OSPF for traffic engineering, Internet-draft: draftsrisuresh-ospf-te-02.txt (January 2002).

  18. B. Szviatovszki, A. Szentesi and A. Juttner, Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing, Computer Communications 25 (2002) 1076–1083.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Unit in Networking, EECS Department, Montefiore Institute, University of Liège, 4000, Belgium

    François Blanchy, Laurent Mélon & Guy Leduc

Authors
  1. François Blanchy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Mélon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guy Leduc
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blanchy, F., Mélon, L. & Leduc, G. A Preemption-Aware On-line Routing Algorithm for MPLS Networks. Telecommunication Systems 24, 187–206 (2003). https://doi.org/10.1023/A:1026166813657

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026166813657

Search

Navigation