A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Asynchronous Network Coded Multicast
2010 IEEE International Conference on Communications
We consider the problem of setting up a multicast connection of minimum cost using network coding. It is wellknown 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.doi:10.1109/icc.2010.5501823 dblp:conf/icc/TraskovLRM10 fatcat:wemrakk2dvbdhonp5555ckk554