Routing and Design in K-Shared Networks

In this paper, we present novel routing and design algorithms for K-shared networks. We also show that a practical version of the routing problem is NP-Hard and present heuristics to solve it. We also summarize experimental results demonstrating that the additional capacity requirements imposed by K-sharing are in fact minimal in practice.