A note on the multiple unicast capacity of directed acyclic networks
| Autor: | Aditya Ramamoorthy, Shurui Huang |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: |
FOS: Computer and information sciences
060102 archaeology Artificial neural network Computer science Information Theory (cs.IT) Computer Science - Information Theory 020206 networking & telecommunications 06 humanities and the arts 02 engineering and technology Directed graph Network topology Topology Combinatorics Channel capacity Linear network coding 0202 electrical engineering electronic engineering information engineering Entropy (information theory) 0601 history and archaeology Unicast |
| Zdroj: | ICC |
| Popis: | 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 (s_i - t_i) pairs that wish to communicate at unit rate over this network. The connectivity between the s_i - t_i pairs is quantified by means of a connectivity level vector, [k_1 k_2 ... k_n] such that there exist k_i edge-disjoint paths between s_i and t_i. Our main aim is to characterize the feasibility of achieving this for different values of n and [k_1 ... k_n]. 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. ICC, 2011 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|