The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Traffic engineering of multiple spanning tree routing networks: the load balancing case

Author

  • D Santos
  • A de sousa
  • F Alvelos
  • M Dzida
  • Michal Pioro
  • M Zagozdzon

Summary, in English

This paper deals with optimal load balancing in telecommunication networks based on multiple spanning tree routing. This is the case in switched Ethernet networks where the operator configures different routing spanning trees and assigns each demand VLAN to one of the spanning trees. We consider modeling and solving three load balancing objectives: (i) minimization of the average link load with a guaranteed optimal worst case link load, (ii) minimization of the worst case link load with a guaranteed optimal average link load and (iii) the min-max optimization of link loads. We also propose heuristic techniques to compute both feasible solutions and lower bounds for the addressed optimization problems. Finally, we assess both the efficiency and the efficacy of the different solution techniques and compare the quality of each problem solution taking into account the optimization criteria of the other problems

Publishing year

2009

Language

English

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

5th Euro-NGI on next generation internet networks, NGI 2009

Conference date

2009-07-01 - 2009-07-03

Conference place

Eveiro, Portugal

Status

Published

Research group

  • Networking

ISBN/ISSN/Other

  • ISBN: 978-1-4244-4244-7