Optimization of link load balancing in multiple spanning tree routing networks

Dorabella Santos, Amaro de Sousa, Filipe Alvelos, Mateusz Dzida, Michal Pioro

Research output: Contribution to journalArticlepeer-review

16 Citations (SciVal)

Abstract

In telecommunication networks based on the current Ethernet technology, routing of traffic demands is based on multiple spanning trees: the network operator configures different routing spanning trees and assigns each demand to be routed in one of the selected spanning trees. A major optimization issue in this solution is the combined determination of (i) a set of appropriate spanning trees, and (ii) assignment of demands to the trees, in order to achieve an optimal load balancing on the links of the network. In this paper we consider models and solving techniques for lexicographical optimization of two load balancing objective functions. The first objective is the min-max optimization of the n worst link loads (with n up to the total number of network links), and the second objective is the minimization of the average link load (when n is smaller than the total number of network links). Besides exact methods, a heuristic technique that can compute both feasible solutions and lower bounds for the addressed optimization problem is proposed. Finally, we discuss effectiveness of different solution using results of a numerical study of realistic case studies.
Original languageEnglish
Pages (from-to)109-124
JournalTelecommunications Systems
Volume48
Issue number1-2
DOIs
Publication statusPublished - 2011

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Ethernet networks
  • Load balancing
  • Multiple spanning tree routing
  • Traffic engineering
  • Integer programming

Fingerprint

Dive into the research topics of 'Optimization of link load balancing in multiple spanning tree routing networks'. Together they form a unique fingerprint.

Cite this