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.
Domains
Operations Research [cs.RO]
Origin : Files produced by the author(s)
Loading...