Robust network flow against attackers with knowledge of routing method

Abstract

Recently, many algorithms are proposed to find a communication flow that is robust against k-edges failures. That flow can be weaker, if attackers can obtain forwarding information in each router. In this paper, we propose an algorithm that find a forwarding algorithm maximizing the remaining flow in that situation. We show that Kishimoto's multiroute flow is a (k + 1)-approximation algorithm for the problem, when the route number is k + 1. When the route number is optimally chosen, we show that the multiroute flow is a 2-approximation algorithm for most of randomly generated graphs. Our experimental results show that our algorithm has 15%-37% better performance than max-flow algorithm.