par Altin, Aysegul 
;Fortz, Bernard ;Umit, H.
Référence International Network Optimization Conference(26/29-04-2009: Pisa, Italy), INOC 2009
Publication Publié, 2009-04
;Fortz, Bernard ;Umit, H.Référence International Network Optimization Conference(26/29-04-2009: Pisa, Italy), INOC 2009
Publication Publié, 2009-04
Publication dans des actes
| Résumé : | The desire for con¯guring well-managed OSPF routes to handle the communication needs in thecontemporary business world with larger networks and changing service requirements has openedthe way to use tra±c engineering tools with the OSPF protocol. Moreover, anticipating possibleshifts in expected tra±c demands while using network resources e±ciently has started to gain moreattention. We take these two crucial issues into consideration and study a weight-managed OSPFrouting problem for polyhedral demands. Our motivation is to optimize the link weight metric suchthat the minimum cost routing uses shortest paths with Equal Cost Multi-Path (ECMP) splitting,and the routing decisions are robust to possible °uctuations in demands. In addition to a compactmixed integer programming model, we provide an algorithmic approach with two variations to tacklethe problem. We present several test results for these two strategies and discuss whether we couldmake our weight-managed OSPF comparable to unconstrained routing under polyhedral demanduncertainty. |
