Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
DOI: 10.1109/infcom.2005.1498443
|View full text |Cite
|
Sign up to set email alerts
|

Achieving minimum-cost multicast: a decentralized approach based on network coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
169
0
1

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 210 publications
(173 citation statements)
references
References 16 publications
3
169
0
1
Order By: Relevance
“…The fundamental insight of network coding is that information to be transmitted from the source in a session can be inferred, or decoded, by the intended receivers, and does not have to be transmitted verbatim. The benefits for coding at intermediate nodes include high throughput [1], [3], efficient routing algorithm design [17], energy savings in wireless networking [18], and security [19]. Network coding may be performed over a large finite field, as in ReedSolomon codes, or over a binary field, as in fountain codes [20], [21].…”
Section: Related Workmentioning
confidence: 99%
“…The fundamental insight of network coding is that information to be transmitted from the source in a session can be inferred, or decoded, by the intended receivers, and does not have to be transmitted verbatim. The benefits for coding at intermediate nodes include high throughput [1], [3], efficient routing algorithm design [17], energy savings in wireless networking [18], and security [19]. Network coding may be performed over a large finite field, as in ReedSolomon codes, or over a binary field, as in fountain codes [20], [21].…”
Section: Related Workmentioning
confidence: 99%
“…This problem is very similar to the principal optimization problem studied in [12]. The main difference is that it involves more constraints.…”
Section: Distributed Random Network Codingmentioning
confidence: 99%
“…If the connectivity of nodes is kept more or less constant as the network grows, however, then the problem should be computationally tractable. In [12], two distributed approaches to the problem are proposed. The first applies in the case of linear cost, i.e.…”
Section: Distributed Random Network Codingmentioning
confidence: 99%
See 2 more Smart Citations