Please use this identifier to cite or link to this item:
Title: Optimization of link load balancing in multiple spanning tree routing networks
Author: Santos, Dorabella
Sousa, Amaro Fernandes de
Dzida, Mateusz
Pióro, Michal
Alvelos, Filipe
Keywords: Ethernet networks
Load balancing
Multiple spanning tree routing
Traffic engineering
Integer programming
Issue Date: 2011
Publisher: Springer Verlag
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.
Peer review: yes
ISSN: 1018-4864
Appears in Collections:DETI - Artigos

Files in This Item:
File Description SizeFormat 
10.1007_s11235-010-9337-8.pdfCópia pessoal dos autores795.93 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.