| Robust network design takes the very successful framework of robust optimization and applies it to the area of network design, motivated by applications in communication networks. The main premise is that demands across the network are not fixed, but are variable or uncertain. However, they are known to fall within a prescribed uncertainty set. Our solution must have sufficient capacity to route any demand in this set; moreover, the routing must be oblivious, meaning it must be fixed up front, and not depend on the particular choice of demand from within the uncertainty set.;We initiate a study of the robust network design problem more generally, with a focus on approximability. In the general model, where the uncertainty set is given by an arbitrary separable polyhedron, we give a strong inapproximability result. We then consider a new and natural model generalizing the symmetric hose model, based on demands routable on a given tree, and provide a constant factor approximation algorithm.;Lastly, we compare oblivious routing with the much more flexible (but also less practical) dynamic routing scheme where the routing may vary depending on the demand pattern. We show that in the worst case, the cost of an optimal oblivious routing solution can be much more expensive than the dynamic optimum, by up to a logarithmic factor.;A particular choice of uncertainty set within this framework yields the "hose model", which has received particular attention due to applications to virtual private networks. A 2-approximation was known for the problem, using a solution template in the form of a tree. It was conjectured that this tree solution is actually always optimal; this became known as the VPN Conjecture. As one of the central results of this thesis, we prove this conjecture in full generality. In addition, we demonstrate a counterexample to a stronger multipath (fractional routing) version of the conjecture which had also been proposed. |
