DocumentCode :
2273117
Title :
Minimal network coding for multicast
Author :
Bhattad, Kapil ; Ratnakar, Niranjan ; Koetter, Ralf ; Narayanan, Krishna R.
Author_Institution :
Texas A&M Univ., College Station, TX
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
1730
Lastpage :
1734
Abstract :
We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize the number of packets that undergo network coding. We also propose a decentralized algorithm to construct capacity achieving multicast codes when the processing at some nodes is restricted to routing. The proposed algorithms can be coupled with existing decentralized schemes to achieve minimum cost multicast
Keywords :
multicast communication; random codes; telecommunication network routing; decentralized algorithm; information flow interpretation; multicast codes; random network coding; Bandwidth; Costs; Decoding; Distributed algorithms; Galois fields; Linear code; Multicast algorithms; Network coding; Optical fiber networks; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523641
Filename :
1523641
Link To Document :
بازگشت