Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2011 IEEE International Conference on Communications

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/icc.2011.5962872

Publication Date

2011

Journal or Book Title

2011 IEEE International Conference on Communications (ICC)

DOI

10.1109/icc.2011.5962872

Conference Title

2011 IEEE International Conference on Communications

Conference Date

June 5-9, 2011

City

Kyoto, Japan

Abstract

We consider the multiple unicast problem under network coding over directed acyclic networks with unit capacity edges. There is a set of n source-terminal (si-ti) pairs that wish to communicate at unit rate over this network. The connectivity between the si-ti pairs is quantified by means of a connectivity level vector, [k1 k2 ... kn] such that there exist ki edge-disjoint paths between si and ti. Our main aim is to characterize the feasibility of achieving this for different values of n and [k1 ... kn]. For 3 unicast connections (n = 3), we characterize several achievable and unachievable values of the connectivity 3-tuple. In addition, in this work, we have found certain network topologies, and capacity characterizations that are useful in understanding the case of general n.

Comments

This is a manuscript of a proceeding from the IEEE International Conference on Communications (2011), doi:10.1109/icc.2011.5962872. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS