Author :
Barbero, Ángela I. ; Ytrehus, øyvind
Author_Institution :
Valladolid Univ., Valladolid
Abstract :
The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a "real" network, through the use of a simulation model. We present results on the algorithm\´s ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.
Keywords :
multicast communication; telecommunication computing; telecommunication network routing; encoding complexity; linear information flow algorithm; linear information flow on edges algorithm; multicast communication; network codes; network encoding equations; simulation model; Algorithm design and analysis; Analytical models; Encoding; Equations; Informatics; Mathematics; Multicast algorithms; Multicast communication; Parity check codes; Vectors; Network codes; encoding complexity; field size; multicasting;
Conference_Titel :
Computer Communications and Networks, 2007. ICCCN 2007. Proceedings of 16th International Conference on
Conference_Location :
Honolulu, HI
Print_ISBN :
978-1-4244-1251-8
Electronic_ISBN :
1095-2055
DOI :
10.1109/ICCCN.2007.4317921
