Skip to main content
SpringerLink
Log in
Book cover

Graphs and Algorithms in Communication Networks pp 119–136Cite as

Routing and Label Space Reduction in Label Switching Networks

  • Chapter
  • First Online:

  • 1415 Accesses

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

This chapter is devoted to the analysis and modeling of some problems related to the optimal usage of the label space in label switching networks. Label space problems concerning three different technologies and architectures – namely Multi-protocol Label Switching (MPLS), Ethernet VLAN-Label Switching (ELS) and All-Optical Label Switching (AOLS) – are discussed in this chapter. Each of these cases yields to different constraints of the general label space reduction problem. We propose a generic optimization model and, then, we describe some adaptations aiming at modeling each particular case. Simulation results are briefly discussed at the end of this chapter.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Awduche, D., Berger, L., Gan, D. H., Li, T., Srinivasan, V., Swallow, G.: Extensions to RSVP for LSP Tunnels. IETF (2001). RFC 3209

    Google Scholar 

  2. Caenegem, R. V., Colle, D., Pickavet, M., Demeester, P.: Benefits of label stripping compared to label swapping from the point of node dimensioning. Photonic Network Communications Journal 12(3), 227–244 (2006)

    Article  Google Scholar 

  3. Caro, L. F., Papadimitriou, D., Marzo, J. L.: Improving label space usage for Ethernet label switched paths. In: Proc. IEEE International Conference on Communications (ICC 2008) (2008)

    Google Scholar 

  4. Ciavaglia, L., et al.: TIGER: Optimizing IP & Ethernet adaptation for the Metro Ethernet market. In: Proc. European Conference in Networks and Optical Communications (NOC 2007) (2007). Invited Paper.

    Google Scholar 

  5. Kodialam, M., Laksham, T.: Minimum interference routing with applications to MPLS traffic engineering. In: Proc. IEEE Infocom 2000, vol. 2, pp. 884–893 (2000)

    Google Scholar 

  6. Kompella, K., Rekhter, Y.: Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE). IETF (2005). RFC 4206

    Google Scholar 

  7. Mannie, E.: Generalized Multi-Protocol Label Switching (GMPLS) Architecture. IETF (2004). RFC 3945

    Google Scholar 

  8. Papadimitriou, D., Dotaro, E., Vigoureux, M.: Ethernet layer 2 label switched paths (LSP). In: Proc. of Next Generation Internet Networks, pp. 620–621 (2005)

    Google Scholar 

  9. Ramos, F., Kehayas, E., Martinez, J. M., Clavero, R., Marti, J., Stampoulidis, L., Tsiokos, D., Avramopoulos, H., Zhang, J., Holm-Nielsen, P. V., Chi, N., Jeppesen, P., Yan, N., Monroy, I. T., Koonen, A., Hill, M., Liu, Y., Dorren, H., Caenegem, R. V., Colle, D., Pickavet, M., Riposati, B.: IST-LASAGNE: Towards all-optical label swapping employing optical logic gates and optical flip-flops. IEEE J. Select. Areas Commun. 23(10), 2993–3011 (2005)

    Google Scholar 

  10. Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF (2001). RFC 3031

    Google Scholar 

  11. Solano, F., Colle, R. V. C. D., Fabregat, R., Pickavet, M., Marzo, J., Demeester, P.: All-optical label stacking: Easing the trade-offs between routing and architecture cost in all-optical packet switching. In: Proc. IEEE Infocom 2008 (2008)

    Google Scholar 

  12. Solano, F., Fabregat, R., Donoso, Y., Marzo, J.: Asymmetric tunnels in P2MP LSPs as a label space reduction method. In: Proc. IEEE International Conference on Communications (ICC 2005), pp. 43–47 (2005)

    Google Scholar 

  13. Solano, F., Fabregat, R., Marzo, J.: A fast algorithm based on the MPLS label stack for the label space reduction problem. In: Proc. IEEE IP Operations and Management (IPOM 2005) (2005)

    Google Scholar 

  14. Solano, F., Fabregat, R., Marzo, J.: Full label space reduction in MPLS networks: Asymmetric merged tunneling. IEEE Commun. Lett. 9(11), 1021–1023 (2005)

    Article  Google Scholar 

  15. Solano, F., Fabregat, R., Marzo, J.: On optimal computation of MPLS label binding for multipoint-to-point connections. IEEE Transactions on Communications 56(7), 1056–1059 (2008)

    Article  Google Scholar 

  16. Solano, F., Stidsen, T., Fabregat, R., Marzo, J.: Label space reduction in MPLS networks: How much can a single stacked label do? IEEE/ACM Trans. Networking 16(6), 1308–1320 (2008)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to acknowledge the support of the EU COST action 293 – Graphs and Algorithms in Communication Networks (GRAAL) for the scientific collaboration and financial support related to the mathematical formulation of the label space reduction problem.

Author information

Authors and Affiliations

  1. Institute of Telecommunications, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665, Warsaw, Poland

    Fernando Solano

  2. Institute of Informatics and Applications, University of Girona, Campus Montilivi, 17071, Girona, Spain

    Luis Fernando Caro

  3. Informatics and Mathematical Modeling, Danish Technical University, Richard Petersens Plads, DK-2800 Kgs., Lyngby, Denmark

    Thomas Stidsen

  4. Network and Technology Strategy, Alcatel-Lucent, Copernicuslaan 50, B-2018, Antwerpen, Belgium

    Dimitri Papadimitriou

Authors
  1. Fernando Solano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Fernando Caro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Stidsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dimitri Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Fernando Solano , Luis Fernando Caro , Thomas Stidsen or Dimitri Papadimitriou .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Solano, F., Caro, L.F., Stidsen, T., Papadimitriou, D. (2009). Routing and Label Space Reduction in Label Switching Networks. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation