A comparison of routing sets for robust network design

Abstract : Designing a network able to route a set of non-simultaneous demand vectors is an important problem arising in telecommunications. In this paper, we compare the optimal capacity allocation costs for six routing sets: affine routing, volume routing and its two simplifications, the routing based on an unrestricted 2-cover of the uncertainty set, and the routing based on a cover delimited by a hyperplane.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01099565
Contributor : Michael Poss <>
Submitted on : Thursday, January 8, 2015 - 3:28:55 PM
Last modification on : Wednesday, November 28, 2018 - 10:54:08 AM
Long-term archiving on : Thursday, April 9, 2015 - 10:15:57 AM

File

draft-rev2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michael Poss. A comparison of routing sets for robust network design. Optimization Letters, Springer Verlag, 2014, 8 (5), pp.1619-1635. ⟨10.1007/s11590-013-0679-5⟩. ⟨hal-01099565⟩

Share

Metrics

Record views

468

Files downloads

275