Chapter

Graphs and Algorithms in Communication Networks

Part of the series Texts in Theoretical Computer Science. An EATCS Series pp 119-136

Date:

Routing and Label Space Reduction in Label Switching Networks

  • Fernando SolanoAffiliated withInstitute of Telecommunications, Warsaw University of Technology Email author 
  • , Luis Fernando CaroAffiliated withInstitute of Informatics and Applications, University of Girona, Campus Montilivi Email author 
  • , Thomas StidsenAffiliated withInformatics and Mathematical Modeling, Danish Technical University, Richard Petersens Plads Email author 
  • , Dimitri PapadimitriouAffiliated withNetwork and Technology Strategy, Alcatel-Lucent Email author 

* Final gross prices may vary according to local VAT.

Get Access

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.

key words

MPLS AOLS ELS label space reduction