Robust routing and optimal partitioning of a traffic demand polytope
In this paper we consider the problem of optimal partitioning of a traffic demand polytope using a hyperplane. In our model all possible demand matrices belong to a polytope. The polytope can be divided into parts, and different routing schemes can be applied while dealing with traffic matrices from different parts of the polytope. We consider three basic models: Robust-Routing, No-Sharing and Dynamic-Routing. We apply two different partitioning strategies depending on whether the reservation vectors on opposite sides of the hyperplane are required to be identical, or allowed to differ. We provide efficient algorithms that solve these problems. Moreover, we prove polynomiality of some of the considered cases. Finally, we present numerical results proving the applicability of the introduced algorithms and showing differences between the routing strategies.