TY - GEN

T1 - On the tightness of the generalized network sharing bound for the two-unicast-Z network

AU - Zeng, Weifei

AU - Cadambe, Viveck

AU - Medard, Muriel

PY - 2013

Y1 - 2013

N2 - We study two-unicast-Z networks1 - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination.

AB - We study two-unicast-Z networks1 - two-source two-destination (two-unicast) wireline networks over directed acyclic graphs, where one of the two destinations (say the second destination) is apriori aware of the interfering (first) source's message. For certain classes of two-unicast-Z networks, we show that the rate-tuple (N, 1) is achievable as long as the individual source-destination cuts for the two source-destination pairs are respectively at least as large as N and 1, and the generalized network sharing cut - a bound previously defined by Kamath et. al. - is at least as large as N +1. We show this through a novel achievable scheme which is based on random linear coding at all the edges in the network, except at the GNS-cut set edges, where the linear coding co-efficients are chosen in a structured manner to cancel interference at the receiver first destination.

UR - http://www.scopus.com/inward/record.url?scp=84890319473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890319473&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620793

DO - 10.1109/ISIT.2013.6620793

M3 - Conference contribution

AN - SCOPUS:84890319473

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3085

EP - 3089

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013

Y2 - 7 July 2013 through 12 July 2013

ER -