Scaling Laws with Network Coding

Atilla Eryilmaz, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

This chapter provides an overview of the scaling law results associated with network coding as the network size and/or the coding window size scale. These results highlight the potential gains to be derived from network coding in various scenarios of interest. It covers the scaling of throughput and delay performance metrics for wireless networks both under time-varying channel conditions and node mobility. The fundamental strength of coding is its ability to spread information across long chunks of transmission signals to achieve robustness against statistical channel variations. While this idea has transformed the world by enabling a global communication network, most of the exciting advances have been limited to point-to-point links with a few other capacity results relating to limited multi-user scenarios. The interesting findings on the performance of network coding in unreliable wireless networks under several scaling regimes includes the network size, the coding window size, the number of flows in the network, and the application delay constraints. These results not only help quantify the performance of network coding for comparison to traditional scheduling and routing policies, but also identify cases in which significant throughput, delay, or economic gains are achievable even with simple randomized network coding strategies.

Original languageEnglish (US)
Title of host publicationNetwork Coding
PublisherElsevier Inc.
Pages235-265
Number of pages31
ISBN (Print)9780123809186
DOIs
StatePublished - 2012
Externally publishedYes

Fingerprint

Network coding
Scaling laws
Wireless networks
Throughput
Telecommunication networks
Scheduling
Economics

Keywords

  • Mobile ad hoc networks
  • Mobility models
  • Random network coding
  • Scaling laws
  • Throughput-delay trade-offs
  • Wireless scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Eryilmaz, A., & Ying, L. (2012). Scaling Laws with Network Coding. In Network Coding (pp. 235-265). Elsevier Inc.. https://doi.org/10.1016/B978-0-12-380918-6.00009-3

Scaling Laws with Network Coding. / Eryilmaz, Atilla; Ying, Lei.

Network Coding. Elsevier Inc., 2012. p. 235-265.

Research output: Chapter in Book/Report/Conference proceedingChapter

Eryilmaz, A & Ying, L 2012, Scaling Laws with Network Coding. in Network Coding. Elsevier Inc., pp. 235-265. https://doi.org/10.1016/B978-0-12-380918-6.00009-3
Eryilmaz A, Ying L. Scaling Laws with Network Coding. In Network Coding. Elsevier Inc. 2012. p. 235-265 https://doi.org/10.1016/B978-0-12-380918-6.00009-3
Eryilmaz, Atilla ; Ying, Lei. / Scaling Laws with Network Coding. Network Coding. Elsevier Inc., 2012. pp. 235-265
@inbook{b567c061fc844a84bc6dd350e4582a0f,
title = "Scaling Laws with Network Coding",
abstract = "This chapter provides an overview of the scaling law results associated with network coding as the network size and/or the coding window size scale. These results highlight the potential gains to be derived from network coding in various scenarios of interest. It covers the scaling of throughput and delay performance metrics for wireless networks both under time-varying channel conditions and node mobility. The fundamental strength of coding is its ability to spread information across long chunks of transmission signals to achieve robustness against statistical channel variations. While this idea has transformed the world by enabling a global communication network, most of the exciting advances have been limited to point-to-point links with a few other capacity results relating to limited multi-user scenarios. The interesting findings on the performance of network coding in unreliable wireless networks under several scaling regimes includes the network size, the coding window size, the number of flows in the network, and the application delay constraints. These results not only help quantify the performance of network coding for comparison to traditional scheduling and routing policies, but also identify cases in which significant throughput, delay, or economic gains are achievable even with simple randomized network coding strategies.",
keywords = "Mobile ad hoc networks, Mobility models, Random network coding, Scaling laws, Throughput-delay trade-offs, Wireless scheduling",
author = "Atilla Eryilmaz and Lei Ying",
year = "2012",
doi = "10.1016/B978-0-12-380918-6.00009-3",
language = "English (US)",
isbn = "9780123809186",
pages = "235--265",
booktitle = "Network Coding",
publisher = "Elsevier Inc.",

}

TY - CHAP

T1 - Scaling Laws with Network Coding

AU - Eryilmaz, Atilla

AU - Ying, Lei

PY - 2012

Y1 - 2012

N2 - This chapter provides an overview of the scaling law results associated with network coding as the network size and/or the coding window size scale. These results highlight the potential gains to be derived from network coding in various scenarios of interest. It covers the scaling of throughput and delay performance metrics for wireless networks both under time-varying channel conditions and node mobility. The fundamental strength of coding is its ability to spread information across long chunks of transmission signals to achieve robustness against statistical channel variations. While this idea has transformed the world by enabling a global communication network, most of the exciting advances have been limited to point-to-point links with a few other capacity results relating to limited multi-user scenarios. The interesting findings on the performance of network coding in unreliable wireless networks under several scaling regimes includes the network size, the coding window size, the number of flows in the network, and the application delay constraints. These results not only help quantify the performance of network coding for comparison to traditional scheduling and routing policies, but also identify cases in which significant throughput, delay, or economic gains are achievable even with simple randomized network coding strategies.

AB - This chapter provides an overview of the scaling law results associated with network coding as the network size and/or the coding window size scale. These results highlight the potential gains to be derived from network coding in various scenarios of interest. It covers the scaling of throughput and delay performance metrics for wireless networks both under time-varying channel conditions and node mobility. The fundamental strength of coding is its ability to spread information across long chunks of transmission signals to achieve robustness against statistical channel variations. While this idea has transformed the world by enabling a global communication network, most of the exciting advances have been limited to point-to-point links with a few other capacity results relating to limited multi-user scenarios. The interesting findings on the performance of network coding in unreliable wireless networks under several scaling regimes includes the network size, the coding window size, the number of flows in the network, and the application delay constraints. These results not only help quantify the performance of network coding for comparison to traditional scheduling and routing policies, but also identify cases in which significant throughput, delay, or economic gains are achievable even with simple randomized network coding strategies.

KW - Mobile ad hoc networks

KW - Mobility models

KW - Random network coding

KW - Scaling laws

KW - Throughput-delay trade-offs

KW - Wireless scheduling

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

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

U2 - 10.1016/B978-0-12-380918-6.00009-3

DO - 10.1016/B978-0-12-380918-6.00009-3

M3 - Chapter

AN - SCOPUS:84882548167

SN - 9780123809186

SP - 235

EP - 265

BT - Network Coding

PB - Elsevier Inc.

ER -