The effect of removing a network communication edge: Group network codes

Fei Wei; Michael Langberg

doi:10.1109/ALLERTON.2017.8262729

The effect of removing a network communication edge: Group network codes

Fei Wei
, Michael Langberg

Department of Electrical Engineering

University at Buffalo

SUNY Buffalo

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

1 Scopus citations

Abstract

The edge removal problem quantifies the loss in rate when removing an edge from a given network. In this work, we study the edge removal problem on network coding instances that are solvable using group network codes. We show that removing any edge of capacity R_e from a given network reduces the rate vector achievable by abelian group network codes by at most an additive R_e. Our work extends previous results of similar nature on linear network codes which are a special case of group network codes. The extent to which the achievable rate is affected by removing an R_e capacity edge, in the presence of general network coding functions, is yet to be quantified.

Original language	English
Title of host publication	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	134-141
Number of pages	8
ISBN (Electronic)	9781538632666
DOIs	https://doi.org/10.1109/ALLERTON.2017.8262729
State	Published - Jul 1 2017
Event	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 - Monticello, United States Duration: Oct 3 2017 → Oct 6 2017

Publication series

Name	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Volume	2018-January

Conference

Conference	55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Country/Territory	United States
City	Monticello
Period	10/3/17 → 10/6/17

Access to Document

10.1109/ALLERTON.2017.8262729

Cite this

Wei, F., & Langberg, M. (2017). The effect of removing a network communication edge: Group network codes. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 (pp. 134-141). (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ALLERTON.2017.8262729

@inproceedings{b029e107b8984d2daab7adc0b1aeac93,

title = "The effect of removing a network communication edge: Group network codes",

abstract = "The edge removal problem quantifies the loss in rate when removing an edge from a given network. In this work, we study the edge removal problem on network coding instances that are solvable using group network codes. We show that removing any edge of capacity Re from a given network reduces the rate vector achievable by abelian group network codes by at most an additive Re. Our work extends previous results of similar nature on linear network codes which are a special case of group network codes. The extent to which the achievable rate is affected by removing an Re capacity edge, in the presence of general network coding functions, is yet to be quantified.",

author = "Fei Wei and Michael Langberg",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 ; Conference date: 03-10-2017 Through 06-10-2017",

year = "2017",

month = jul,

day = "1",

doi = "10.1109/ALLERTON.2017.8262729",

language = "English",

series = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017",

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

pages = "134--141",

booktitle = "55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017",

address = "United States",

}

Wei, F & Langberg, M 2017, The effect of removing a network communication edge: Group network codes. in 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 134-141, 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, United States, 10/3/17. https://doi.org/10.1109/ALLERTON.2017.8262729

The effect of removing a network communication edge: Group network codes. / Wei, Fei; Langberg, Michael.
55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 134-141 (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017; Vol. 2018-January).

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

TY - GEN

T1 - The effect of removing a network communication edge

T2 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

AU - Wei, Fei

AU - Langberg, Michael

PY - 2017/7/1

Y1 - 2017/7/1

N2 - The edge removal problem quantifies the loss in rate when removing an edge from a given network. In this work, we study the edge removal problem on network coding instances that are solvable using group network codes. We show that removing any edge of capacity Re from a given network reduces the rate vector achievable by abelian group network codes by at most an additive Re. Our work extends previous results of similar nature on linear network codes which are a special case of group network codes. The extent to which the achievable rate is affected by removing an Re capacity edge, in the presence of general network coding functions, is yet to be quantified.

AB - The edge removal problem quantifies the loss in rate when removing an edge from a given network. In this work, we study the edge removal problem on network coding instances that are solvable using group network codes. We show that removing any edge of capacity Re from a given network reduces the rate vector achievable by abelian group network codes by at most an additive Re. Our work extends previous results of similar nature on linear network codes which are a special case of group network codes. The extent to which the achievable rate is affected by removing an Re capacity edge, in the presence of general network coding functions, is yet to be quantified.

UR - https://www.scopus.com/pages/publications/85048138684

U2 - 10.1109/ALLERTON.2017.8262729

DO - 10.1109/ALLERTON.2017.8262729

M3 - Conference contribution

T3 - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

SP - 134

EP - 141

BT - 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 3 October 2017 through 6 October 2017

ER -

Wei F, Langberg M. The effect of removing a network communication edge: Group network codes. In 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 134-141. (55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017). doi: 10.1109/ALLERTON.2017.8262729

The effect of removing a network communication edge: Group network codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this