Channelization for network coding in wireless networks

Raju Kumar, Heesook Choi, Jae Sheung Shin, Thomas F. La Porta

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

1 Citation (Scopus)

Abstract

Network coding is increasingly being investigated as an alternative to routing to increase throughput in packet networks. Like most data transfer schemes, the effectiveness of network coding may be limited by extreme congestion. When using network coding, these congested conditions are mitigated somewhat, but may still occur. We propose a selective channelization scheme in which links that experience congestion at a level that cannot be overcome by network coding are given reserved communication resources. This method has the following benefits. First, the algorithm proposed allows network coding full opportunity to overcome congestion before performing channelization, thus reducing the number of reserved resources used. Second, when triggered, the channelization of severely congested links greatly improves the end-to-end performance of flows that traverse the channelized link. To determine the point at which channelization should be triggered, we perform a thorough analysis of potential coding gains in a network facing errors due to collisions, and determine the point at which network coding loses its effectiveness.

Original languageEnglish (US)
Title of host publicationINFOCOM 2008
Subtitle of host publication27th IEEE Communications Society Conference on Computer Communications
Pages1031-1039
Number of pages9
DOIs
StatePublished - Sep 15 2008
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

Fingerprint

Network coding
Wireless networks
Packet networks
Data transfer
Throughput
Communication

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Kumar, R., Choi, H., Shin, J. S., & La Porta, T. F. (2008). Channelization for network coding in wireless networks. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications (pp. 1031-1039). [4509677] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.82
Kumar, Raju ; Choi, Heesook ; Shin, Jae Sheung ; La Porta, Thomas F. / Channelization for network coding in wireless networks. INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. pp. 1031-1039 (Proceedings - IEEE INFOCOM).
@inproceedings{069ab97fa8c747a9aa80b941518d4bed,
title = "Channelization for network coding in wireless networks",
abstract = "Network coding is increasingly being investigated as an alternative to routing to increase throughput in packet networks. Like most data transfer schemes, the effectiveness of network coding may be limited by extreme congestion. When using network coding, these congested conditions are mitigated somewhat, but may still occur. We propose a selective channelization scheme in which links that experience congestion at a level that cannot be overcome by network coding are given reserved communication resources. This method has the following benefits. First, the algorithm proposed allows network coding full opportunity to overcome congestion before performing channelization, thus reducing the number of reserved resources used. Second, when triggered, the channelization of severely congested links greatly improves the end-to-end performance of flows that traverse the channelized link. To determine the point at which channelization should be triggered, we perform a thorough analysis of potential coding gains in a network facing errors due to collisions, and determine the point at which network coding loses its effectiveness.",
author = "Raju Kumar and Heesook Choi and Shin, {Jae Sheung} and {La Porta}, {Thomas F.}",
year = "2008",
month = "9",
day = "15",
doi = "10.1109/INFOCOM.2007.82",
language = "English (US)",
isbn = "9781424420261",
series = "Proceedings - IEEE INFOCOM",
pages = "1031--1039",
booktitle = "INFOCOM 2008",

}

Kumar, R, Choi, H, Shin, JS & La Porta, TF 2008, Channelization for network coding in wireless networks. in INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications., 4509677, Proceedings - IEEE INFOCOM, pp. 1031-1039, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.82

Channelization for network coding in wireless networks. / Kumar, Raju; Choi, Heesook; Shin, Jae Sheung; La Porta, Thomas F.

INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 1031-1039 4509677 (Proceedings - IEEE INFOCOM).

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

TY - GEN

T1 - Channelization for network coding in wireless networks

AU - Kumar, Raju

AU - Choi, Heesook

AU - Shin, Jae Sheung

AU - La Porta, Thomas F.

PY - 2008/9/15

Y1 - 2008/9/15

N2 - Network coding is increasingly being investigated as an alternative to routing to increase throughput in packet networks. Like most data transfer schemes, the effectiveness of network coding may be limited by extreme congestion. When using network coding, these congested conditions are mitigated somewhat, but may still occur. We propose a selective channelization scheme in which links that experience congestion at a level that cannot be overcome by network coding are given reserved communication resources. This method has the following benefits. First, the algorithm proposed allows network coding full opportunity to overcome congestion before performing channelization, thus reducing the number of reserved resources used. Second, when triggered, the channelization of severely congested links greatly improves the end-to-end performance of flows that traverse the channelized link. To determine the point at which channelization should be triggered, we perform a thorough analysis of potential coding gains in a network facing errors due to collisions, and determine the point at which network coding loses its effectiveness.

AB - Network coding is increasingly being investigated as an alternative to routing to increase throughput in packet networks. Like most data transfer schemes, the effectiveness of network coding may be limited by extreme congestion. When using network coding, these congested conditions are mitigated somewhat, but may still occur. We propose a selective channelization scheme in which links that experience congestion at a level that cannot be overcome by network coding are given reserved communication resources. This method has the following benefits. First, the algorithm proposed allows network coding full opportunity to overcome congestion before performing channelization, thus reducing the number of reserved resources used. Second, when triggered, the channelization of severely congested links greatly improves the end-to-end performance of flows that traverse the channelized link. To determine the point at which channelization should be triggered, we perform a thorough analysis of potential coding gains in a network facing errors due to collisions, and determine the point at which network coding loses its effectiveness.

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

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

U2 - 10.1109/INFOCOM.2007.82

DO - 10.1109/INFOCOM.2007.82

M3 - Conference contribution

SN - 9781424420261

T3 - Proceedings - IEEE INFOCOM

SP - 1031

EP - 1039

BT - INFOCOM 2008

ER -

Kumar R, Choi H, Shin JS, La Porta TF. Channelization for network coding in wireless networks. In INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 1031-1039. 4509677. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2007.82