DocumentCode :
2378053
Title :
Robust network coding using information flow decomposition
Author :
Rezagholipour, Mohammad ; Ahmadian, Mahmoud ; Aref, Mohammad R.
Author_Institution :
Dept. of Electr. Eng., K.N. Toosi Univ. of Technol., Tehran
fYear :
2008
fDate :
1-3 April 2008
Firstpage :
528
Lastpage :
532
Abstract :
In this paper, we propose a new approach to find a static solution for a multicast network problem. Our work relates the existence of a static network code to minimal subtree graphs of a given network. For a given multicast network there are different solutions. Sometimes some links of a network may be removed and then we will be encountered with link failure in the network. Therefore, to choose a specific satisfactory network code solution among different options, we must see how much the network code adds the network robustness against link failures. In this paper we extend the definition of the minimal subtree graph and replace it with a new definition of minimal subgraph and show that the static network code that is robust against all of solvable link failure patterns is a code that comes from solving all minimal subgraphs of a given network simultaneously.
Keywords :
encoding; graph theory; multicast communication; telecommunication network reliability; information flow decomposition; minimal subtree graph; multicast network problem; network link failure pattern; robust network coding; Information analysis; Network coding; Robustness; Tree graphs; Network coding; link failure; minimal subtree graph; multicast; robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops, 2008. WiOPT 2008. 6th International Symposium on
Conference_Location :
Berlin
Print_ISBN :
978-963-9799-18-9
Electronic_ISBN :
978-963-9799-18-9
Type :
conf
DOI :
10.1109/WIOPT.2008.4586123
Filename :
4586123
Link To Document :
بازگشت