Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

  • D Santos
  • A de sousa
  • F Alvelos
  • M Dzida
  • Michal Pioro
  • M Zagozdzon
Publiceringsår: 2009
Språk: Engelska
Publikation/Tidskrift/Serie: [Host publication title missing]
Dokumenttyp: Konferensbidrag
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


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


  • Electrical Engineering, Electronic Engineering, Information Engineering


5th Euro-NGI on next generation internet networks, NGI 2009
  • Networking-lup-obsolete
  • ISBN: 978-1-4244-4244-7

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen