On the solvability of single rate 2-pair networks - A cut-based characterization

Kai Cai, Khaled Letaief, Pingyi Fan, Rongquan Feng

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair problem. It is shown that the solvability of a single rate 2-pair problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a single rate 2-pair problem is presented.

Original languageEnglish
Pages (from-to)124-133
Number of pages10
JournalPhysical Communication
Volume6
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint

Decomposition
set theory
decomposition

Keywords

  • A-set
  • Capacity
  • Network coding
  • Single rate 2-pair problem

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

On the solvability of single rate 2-pair networks - A cut-based characterization. / Cai, Kai; Letaief, Khaled; Fan, Pingyi; Feng, Rongquan.

In: Physical Communication, Vol. 6, 2013, p. 124-133.

Research output: Contribution to journalArticle

@article{5fde23b7b4b140e1867b33cc9c9ca50a,
title = "On the solvability of single rate 2-pair networks - A cut-based characterization",
abstract = "In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair problem. It is shown that the solvability of a single rate 2-pair problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a single rate 2-pair problem is presented.",
keywords = "A-set, Capacity, Network coding, Single rate 2-pair problem",
author = "Kai Cai and Khaled Letaief and Pingyi Fan and Rongquan Feng",
year = "2013",
doi = "10.1016/j.phycom.2012.05.001",
language = "English",
volume = "6",
pages = "124--133",
journal = "Physical Communication",
issn = "1874-4907",
publisher = "Elsevier",

}

TY - JOUR

T1 - On the solvability of single rate 2-pair networks - A cut-based characterization

AU - Cai, Kai

AU - Letaief, Khaled

AU - Fan, Pingyi

AU - Feng, Rongquan

PY - 2013

Y1 - 2013

N2 - In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair problem. It is shown that the solvability of a single rate 2-pair problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a single rate 2-pair problem is presented.

AB - In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate 2-pair problem. It is shown that the solvability of a single rate 2-pair problem is completely determined by four specific link subsets, namely, A1,1, A2,2, A1,2 and A2,1 of its underlying network. As a result, an efficient cut-based algorithm to determine the solvability of a single rate 2-pair problem is presented.

KW - A-set

KW - Capacity

KW - Network coding

KW - Single rate 2-pair problem

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

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

U2 - 10.1016/j.phycom.2012.05.001

DO - 10.1016/j.phycom.2012.05.001

M3 - Article

AN - SCOPUS:84876140696

VL - 6

SP - 124

EP - 133

JO - Physical Communication

JF - Physical Communication

SN - 1874-4907

ER -