Publicação
Traffic engineering of telecommunication networks based on multiple spanning tree routing
| Resumo: | This paper focuses on tra±c engineering of telecommunica- tion networks, which arises in the context of switched Ethernet networks. It addresses the minimization of the maximum network link load. With the IEEE 802.1s Multiple Spanning Tree Protocol, it is possible to de¯ne multiple routing spanning trees to provide multiple alternatives to route VLAN tra±c demands. Two compact mixed integer linear programming models de¯ning the optimization problem and several models based on the Dantzig-Wolfe decomposition principle, which are solved by branch- and-price, are proposed and compared. The di®erent decompositions re- sult from de¯ning as subproblems either the supporting spanning trees and/or the demand routing paths, which can be solved by well known e±cient algorithms. |
|---|---|
| Autores principais: | Santos, Dorabella |
| Outros Autores: | Sousa, Amaro; Alvelos, Filipe Pereira e |
| Assunto: | Multiple spanning tree routing Integer programming Column generation |
| Ano: | 2009 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | This paper focuses on tra±c engineering of telecommunica- tion networks, which arises in the context of switched Ethernet networks. It addresses the minimization of the maximum network link load. With the IEEE 802.1s Multiple Spanning Tree Protocol, it is possible to de¯ne multiple routing spanning trees to provide multiple alternatives to route VLAN tra±c demands. Two compact mixed integer linear programming models de¯ning the optimization problem and several models based on the Dantzig-Wolfe decomposition principle, which are solved by branch- and-price, are proposed and compared. The di®erent decompositions re- sult from de¯ning as subproblems either the supporting spanning trees and/or the demand routing paths, which can be solved by well known e±cient algorithms. |
|---|