Distributed minimum cost multicasting with lossless source coding and network coding
- Creators
- Cui, Tao
- Ho, Tracey
- Chen, Lijun
Abstract
In this paper, we consider minimum cost lossless source coding for multiple multicast sessions. Each session comprises a set of correlated sources whose information is demanded by a set of sink nodes. We propose a distributed end-to-end algorithm which operates over given multicast trees, and a back-pressure algorithm which optimizes routing and coding over the whole network. Unlike other existing algorithms, the source rates need not be centrally coordinated; the sinks control transmission rates across the sources. With random network coding, the proposed approach yields completely distributed and optimal algorithms for intra-session network coding. We prove the convergence of our proposed algorithms. Some practical considerations are also discussed. Experimental results are provided to complement our theoretical analysis.
Additional Information
© 2007 IEEE. This work has been supported in part by DARPA grant N66001-06-C-2020, Caltech's Lee Center for Advanced Networking, a gift from Microsoft Research, and NSF through grant CNS-0435520.Attached Files
Published - Cui2007p8450Proceedings_Of_The_46Th_Ieee_Conference_On_Decision_And_Control_Vols_1-14.pdf
Files
Name | Size | Download all |
---|---|---|
md5:8878fd42d5280833d08a931c1d20bd81
|
270.9 kB | Preview Download |
Additional details
- Eprint ID
- 19678
- Resolver ID
- CaltechAUTHORS:20100826-151540718
- Defense Advanced Research Projects Agency (DARPA)
- N66001-06-C-2020
- Caltech's Lee Center for Advanced Networking
- Microsoft Research
- NSF
- CNS-0435520
- Created
-
2010-08-30Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9886060