Asynchronous Network Coded Multicast
Name
Medard_Asynchronous network.pdf
Size
114.21 KB
Format
Adobe PDF
Checksum (MD5)
4d202d7fd8187b422aeadd6145c03999
Author(s)
Traskov, Danail
Lenz, Johannes
Ratnakar, Niranjan
Medard, Muriel
Date Issued
July 2010
Journal
2010 IEEE International Conference on Communications (ICC)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Traskov, D. et al. “Asynchronous Network Coded Multicast.” Communications (ICC), 2010 IEEE International Conference on. 2010. 1-5.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ICC.2010.5501823
