A Note on the Multiple Unicast Capacity of Directed Acyclic Networks

作者：Shurui Huang, Aditya Ramamoorthy · 年份：2011 · DOI：10.1109/icc.2011.5962872 · 被引用次数：12 · 研究领域：Cooperative Communication and Network Coding、Full-Duplex Wireless Communications、Advanced Wireless Communication Technologies

We consider the multiple unicast problem under network coding over directed acyclic networks with unit capacity edges. There is a set of n source-terminal (si-ti) pairs that wish to communicate at unit rate over this network. The connectivity between the si-tipairs is quantified by means of a connectivity level vector, [k1k2... kn] such that there exist kiedge-disjoint paths between siand ti. Our main aim is to characterize the feasibility of achieving this for different values of n and [k1... kn]. For 3 unicast connections (n = 3), we characterize several achievable and unachievable values of the connectivity 3-tuple. In addition, in this work, we have found certain network topologies, and capacity characterizations that are useful in understanding the case of general n.