Asynchronous Network Coded Multicast
Author(s)Traskov, Danail; Lenz, Johannes; Ratnakar, Niranjan; Medard, Muriel
MetadataShow full item record
We consider the problem of setting up a multicast connection of minimum cost using network coding. It is well-known that this can be posed in the form of a convex program. Our contribution is an asynchronous algorithm for solving the optimization problem, in analogy to the well-known distributed asynchronous Bellman-Ford algorithm for routing. Furthermore, we provide extensive simulation results showing fast convergence despite the lack of any central clock in the network and robustness with respect to link- or node failures.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
2010 IEEE International Conference on Communications (ICC)
Institute of Electrical and Electronics Engineers
Traskov, D. et al. “Asynchronous Network Coded Multicast.” Communications (ICC), 2010 IEEE International Conference on. 2010. 1-5.
Author's final manuscript