On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization

Details On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization

2010-07-03

arxiv.org/abs/1007.0465v1

Computer Science

Information Theory

15 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Solvability of 2-pair Unicast Networks --- A Cut-based Characterization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402346