Graphs and Algorithms in Communication Networks

Part of the series Texts in Theoretical Computer Science. An EATCS Series pp 179-197


Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks

  • Xavier HesselbachAffiliated withDeparment of Telematics Engineering, Universitat Politècnica de Catalunya, C/Jordi Girona Email author 
  • , Christos KoliasAffiliated withCovad Communications Email author 
  • , Ramón FabregatAffiliated withInstitute of Informatics and Applications, University of Girona Email author 
  • , Mónica HuertaAffiliated withElectronics and Circuits Department, University Simón Bolívar Email author 
  • , Yezid DonosoAffiliated withComputer Science and Engineering Department, University of Los Andes Email author 

* Final gross prices may vary according to local VAT.

Get Access


In this chapter, the analysis of the problems emerging from dynamic bandwidth allocation in connection-oriented packet networks is considered in a multilayer scenario, considering IP protocols on top of an MPLS network over an OBS optical network. The issue (and problem) is to maintain and ensure the end-to-end in-sequence routing of packets, combining load balancing in packet switching architectures and bandwidth/flow allocation in MPLS-based architectures to establish the ordering of packets. If load balancing can be achieved by switches or routers, this can greatly facilitate applying load balancing across the network. Traffic characteristics such as QoS (delay bounds, throughput) and burstiness are considered.


multi-path quality of service class differentiation load balancing traffic partitioning MPLS OBS