On routing-optimal networks for multiple unicasts

Abstract

In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. It is well known that linear network coding is insufficient for achieving the capacity region, in the general case. However, there exist networks for which routing is sufficient to achieve the whole rate region, and we refer to them as routing-optimal networks. We identify a class of routing-optimal networks, which we refer to as information-distributive networks, defined by three topological features. Due to these features, for each rate vector achieved by network coding, there is always a routing scheme such that it achieves the same rate vector, and the traffic transmitted through the network is exactly the information transmitted over the cut-sets between the sources and the sinks in the corresponding network coding scheme. We present examples of information-distributive networks, including some examples from (1) index coding and (2) from a single unicast session with hard deadline constraint. © 2014 IEEE