An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis
The problem of characterizing the utility of network coding for multiple unicasts is an intriguing one. In the multiple unicast problem there is a set of source-terminal pairs in a network that wish to communicate messages. This is in contrast to the multicast problem where each terminal requests exactly the same set of messages from the source nodes. The multicast problem under network coding is very well understood. In particular, several papers discuss the exact capacity region and network code construction algorithms for this problem.