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

Weifei Zeng, Viveck Ramesh Cadambe, Muriel Medard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages3085-3089
Number of pages5
DOIs
StatePublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

Fingerprint

Tightness
Sharing
Coding
Cutset
Directed Acyclic Graph
Cancel
Receiver
Interference
Coefficient

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Zeng, W., Cadambe, V. R., & Medard, M. (2013). On the tightness of the generalized network sharing bound for the two-unicast-Z network. In 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 3085-3089). [6620793] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620793
Zeng, Weifei ; Cadambe, Viveck Ramesh ; Medard, Muriel. / On the tightness of the generalized network sharing bound for the two-unicast-Z network. 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. pp. 3085-3089 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{c446b054501044c784cc61eda80608ec,
title = "On the tightness of the generalized network sharing bound for the two-unicast-Z network",
abstract = "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.",
author = "Weifei Zeng and Cadambe, {Viveck Ramesh} and Muriel Medard",
year = "2013",
month = "12",
day = "19",
doi = "10.1109/ISIT.2013.6620793",
language = "English (US)",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "3085--3089",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

}

Zeng, W, Cadambe, VR & Medard, M 2013, On the tightness of the generalized network sharing bound for the two-unicast-Z network. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620793, IEEE International Symposium on Information Theory - Proceedings, pp. 3085-3089, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620793

On the tightness of the generalized network sharing bound for the two-unicast-Z network. / Zeng, Weifei; Cadambe, Viveck Ramesh; Medard, Muriel.

2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 3085-3089 6620793 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Zeng, Weifei

AU - Cadambe, Viveck Ramesh

AU - Medard, Muriel

PY - 2013/12/19

Y1 - 2013/12/19

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

SN - 9781479904464

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3085

EP - 3089

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

ER -

Zeng W, Cadambe VR, Medard M. On the tightness of the generalized network sharing bound for the two-unicast-Z network. In 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 3085-3089. 6620793. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620793