On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks
| Autor: | Aditya Ramamoorthy, Shurui Huang |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences Discrete mathematics Computer Science - Information Theory Information Theory (cs.IT) 05 social sciences 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Directed graph Constructive Computer Science - Networking and Internet Architecture Combinatorics 0508 media and communications Terminal (electronics) Encoding (memory) Linear network coding 0202 electrical engineering electronic engineering information engineering Routing (electronic design automation) Unicast Unit (ring theory) Mathematics |
| Zdroj: | ITA |
| DOI: | 10.1109/ita.2012.6181808 |
| Popis: | We consider the multiple unicast problem with three source-terminal pairs over directed acyclic networks with unit-capacity edges. The three $s_i-t_i$ pairs wish to communicate at unit-rate via network coding. The connectivity between the $s_i - t_i$ pairs is quantified by means of a connectivity level vector, $[k_1 k_2 k_3]$ such that there exist $k_i$ edge-disjoint paths between $s_i$ and $t_i$. In this work we attempt to classify networks based on the connectivity level. It can be observed that unit-rate transmission can be supported by routing if $k_i \geq 3$, for all $i = 1, \dots, 3$. In this work, we consider, connectivity level vectors such that $\min_{i = 1, \dots, 3} k_i < 3$. We present either a constructive linear network coding scheme or an instance of a network that cannot support the desired unit-rate requirement, for all such connectivity level vectors except the vector $[1~2~4]$ (and its permutations). The benefits of our schemes extend to networks with higher and potentially different edge capacities. Specifically, our experimental results indicate that for networks where the different source-terminal paths have a significant overlap, our constructive unit-rate schemes can be packed along with routing to provide higher throughput as compared to a pure routing approach. To appear in the IEEE/ACM Transactions on Networking |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|