Record Details

A simple necessary and sufficient condition for the double unicast problem

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A simple necessary and sufficient condition for the double unicast problem
 
Creator SHENVI, S
DEY, BK
 
Subject network
multicast
 
Description We consider a directed acyclic network where there are two source-terminal pairs and the terminals need to receive the symbols generated at the respective sources. Each source independently generates an i.i.d. random process over the same alphabet. Each edge in the network is error-free, delay-free, and can carry one symbol from the alphabet per use. We give a simple necessary and sufficient condition for being able to simultaneously satisfy the unicast requirements of the two source-terminal pairs at rate-pair (1, 1) using vector network coding. The condition is also sufficient for doing this using only "XOR" network coding and is much simpler compared to the necessary and sufficient conditions known from previous work. Our condition also yields a simple characterization of the capacity region of a double-unicast network which does not support the rate-pair (1, 1).
 
Publisher IEEE
 
Date 2011-10-28T00:30:40Z
2011-12-15T09:12:51Z
2011-10-28T00:30:40Z
2011-12-15T09:12:51Z
2010
 
Type Proceedings Paper
 
Identifier 2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - ICC 2010,
978-1-4244-6404-3
1550-3607
http://dspace.library.iitb.ac.in/xmlui/handle/10054/16460
http://hdl.handle.net/100/2936
 
Source 2010 IEEE International Conference on Communications,Cape Town, SOUTH AFRICA,MAY 23-27, 2010
 
Language English