Delay-constrained unicast and the triangle-cast problem

Chandra Chekuri; Sudeep Kamath; Sreeram Kannan; Pramod Viswanath

doi:10.1109/ISIT.2015.7282566

Delay-constrained unicast and the triangle-cast problem

Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider the single-unicast communication problem in a network with a delay constraint. For this setting, it has recently been shown that network coding offers an advantage over routing. We show that the existing upper bound in the literature on the capacity offered by network coding can be a factor of Θ(D) larger than the true capacity where D is the delay bound. In this work, we tighten this gap significantly to 8 log(D + 1) by proving a new upper bound. The key insight is a connection to a new traffic model that we call triangle-cast (or degraded multiple-unicast), for which we obtain a logarithmic flow-cut gap by suitably adapting the techniques from the approximation algorithms literature.

Original language	English (US)
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	804-808
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282566
State	Published - Sep 28 2015
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June
ISSN (Print)	2157-8095

Other

Other	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	6/14/15 → 6/19/15

Keywords

delay-constrained unicast
generalized network sharing bound
region-growing lemma
triangle-cast

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/ISIT.2015.7282566

Library availability

Discover UIUC Full Text

Cite this

Chekuri, C., Kamath, S., Kannan, S., & Viswanath, P. (2015). Delay-constrained unicast and the triangle-cast problem. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 804-808). Article 7282566 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282566

Delay-constrained unicast and the triangle-cast problem. / Chekuri, Chandra; Kamath, Sudeep; Kannan, Sreeram et al.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 804-808 7282566 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chekuri, C, Kamath, S, Kannan, S & Viswanath, P 2015, Delay-constrained unicast and the triangle-cast problem. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282566, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 804-808, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282566

@inproceedings{6e5ee16cac4540458b8b4cfa8d0827b8,

title = "Delay-constrained unicast and the triangle-cast problem",

abstract = "We consider the single-unicast communication problem in a network with a delay constraint. For this setting, it has recently been shown that network coding offers an advantage over routing. We show that the existing upper bound in the literature on the capacity offered by network coding can be a factor of Θ(D) larger than the true capacity where D is the delay bound. In this work, we tighten this gap significantly to 8 log(D + 1) by proving a new upper bound. The key insight is a connection to a new traffic model that we call triangle-cast (or degraded multiple-unicast), for which we obtain a logarithmic flow-cut gap by suitably adapting the techniques from the approximation algorithms literature.",

keywords = "delay-constrained unicast, generalized network sharing bound, region-growing lemma, triangle-cast",

author = "Chandra Chekuri and Sudeep Kamath and Sreeram Kannan and Pramod Viswanath",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282566",

language = "English (US)",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "804--808",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

address = "United States",

}

TY - GEN

T1 - Delay-constrained unicast and the triangle-cast problem

AU - Chekuri, Chandra

AU - Kamath, Sudeep

AU - Kannan, Sreeram

AU - Viswanath, Pramod

PY - 2015/9/28

Y1 - 2015/9/28

N2 - We consider the single-unicast communication problem in a network with a delay constraint. For this setting, it has recently been shown that network coding offers an advantage over routing. We show that the existing upper bound in the literature on the capacity offered by network coding can be a factor of Θ(D) larger than the true capacity where D is the delay bound. In this work, we tighten this gap significantly to 8 log(D + 1) by proving a new upper bound. The key insight is a connection to a new traffic model that we call triangle-cast (or degraded multiple-unicast), for which we obtain a logarithmic flow-cut gap by suitably adapting the techniques from the approximation algorithms literature.

AB - We consider the single-unicast communication problem in a network with a delay constraint. For this setting, it has recently been shown that network coding offers an advantage over routing. We show that the existing upper bound in the literature on the capacity offered by network coding can be a factor of Θ(D) larger than the true capacity where D is the delay bound. In this work, we tighten this gap significantly to 8 log(D + 1) by proving a new upper bound. The key insight is a connection to a new traffic model that we call triangle-cast (or degraded multiple-unicast), for which we obtain a logarithmic flow-cut gap by suitably adapting the techniques from the approximation algorithms literature.

KW - delay-constrained unicast

KW - generalized network sharing bound

KW - region-growing lemma

KW - triangle-cast

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

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

U2 - 10.1109/ISIT.2015.7282566

DO - 10.1109/ISIT.2015.7282566

M3 - Conference contribution

AN - SCOPUS:84969800163

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 804

EP - 808

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

Delay-constrained unicast and the triangle-cast problem

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this