Year: 2010
Type: conference-paper
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.
Authors: D. Traskov, J. Lenz, N. Ratnakar, M. Medard
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1965000141