Skip to main content

NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information

  • Conference paper
Book cover Quality of Service in Multiservice IP Networks (QoS-IP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3375))

Abstract

We present NPP – a new framework for online routing of bandwidth guaranteed paths with local restoration. NPP relies on the propagation of only aggregate link usage information [2,9] through routing protocols. The key advantage of NPP is that it delivers the bandwidth sharing performance achieved by propagating complete per path link usage information [9], while incurring significantly reduced routing protocol overhead. We specify precise implementation models for the restoration routing frameworks presented in [1] and [2] and compare their traffic placement characteristics with those of NPP. Simulation results show that NPP performs significantly better in terms of number of LSPs accepted and total bandwidth placed on the network. For 1000 randomly selected LSP requests on a 20-node homogenous ISP network [8], NPP accepts 775 requests on average compared to 573 requests accepted by the framework of [2] and 693 requests accepted by the framework of [1]. Experiments with different sets of LSP requests and on other networks indicate that NPP results in similar performance gains.

This work was supported by a research grant from Cisco Systems, San Jose, CA.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vasseur, J.-P., Charny, A., Le Faucheur, F., Achirica, J., Leroux, J.-L.: MPLS Traffic Engineering Fast Reroute: Bypass Tunnel Path Computation for Bandwidth Protection. IETF draft (February 2003)

    Google Scholar 

  2. Kini, S., Kodialam, M., Sengupta, S., Villamizar, C.: Shared Backup Label Switched Path Restoration. IETF draft (May 2001)

    Google Scholar 

  3. Pan, P., Swallow, G., Atlas, A. (eds.): Fast Reroute Extensions to RSVP-TE for LSP Tunnels. IETF draft (August 2004)

    Google Scholar 

  4. Vasseur, J.-P., Pickavet, M., Demeester, P.: Network Recovery: Restoration and Protection of Optical, SONET-SDH, IP and MPLS. Morgan Kaufmann, Elsevier (2004)

    Google Scholar 

  5. Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X.: Overview and Principles of Internet Traffic Engineering. RFC 3272 (May 2002)

    Google Scholar 

  6. Kodialam, M., Lakshman, T.V.: Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Link Usage Information. In: Proceedings of IEEE Infocom, pp. 376–385 (2001)

    Google Scholar 

  7. Li, L., Buddhikot, M.M., Chekuri, C., Guo, K.: Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. In: Proceedings of IEEE ICNP, pp. 110–120 (2002)

    Google Scholar 

  8. Norden, S., Buddhikot, M.M., Waldvogel, M., Suri, S.: Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks. In: Proceedings of IEEE ICNP, pp. 71–79 (2001)

    Google Scholar 

  9. Kodialam, M., Lakshman, T.V.: Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration. In: Proceedings of IEEE Infocom, pp. 902–911 (2000)

    Google Scholar 

  10. Swallow, G.: MPLS Advantages for Traffic Engineering. IEEE Communications Magazine 37(12), 54–57 (1999)

    Article  Google Scholar 

  11. Iannaccone, G., Chuah, C.N., Bhattacharrya, S., Diot, C.: Feasibility of IP Restoration in a Tier-1 Backbone. IEEE Network 18(2), 13–19 (2004)

    Article  Google Scholar 

  12. Davie, B., Rekhter, Y.: MPLS Technology and Applications. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  13. Alcatel: Traffic Engineering Solutions for Core Networks. White Paper (July 2001)

    Google Scholar 

  14. Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Quality of Service Routing: A Performance Perspective. In: The Proceedings of ACM SIGCOMM, pp. 17–28 (1998)

    Google Scholar 

  15. Rosen, E., Viswanathan, A., Callon, R.: Multi-Protocol Label Switching (MPLS) Architecture. RFC 3031 (January 2001)

    Google Scholar 

  16. Charny, A., Vasseur, J.-P.: Distinguish a link from a node failure using RSVP Hellos extensions. IETF draft (October 2002)

    Google Scholar 

  17. Katz, D., Kompella, K., Yeung, D.: Traffic Engineering (TE) Extensions to OSPF Version 2. RFC 3630 (September 2003)

    Google Scholar 

  18. Jamoussi, B. (ed.): Constraint-Based LSP Setup using LDP. RFC 3212 (January 2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aslam, F., Raza, S., Dogar, F.R., Ahmad, I.U., Uzmi, Z.A. (2005). NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information. In: Ajmone Marsan, M., Bianchi, G., Listanti, M., Meo, M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30573-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30573-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24557-5

  • Online ISBN: 978-3-540-30573-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics