2009
DOI: 10.1002/bltj.20394
|View full text |Cite
|
Sign up to set email alerts
|

Network coding for efficient network multicast

Abstract: and consumed do not necessarily need to be kept separate when they are transported throughout the network: there are ways to combine and later extract independent information.Combining independent data streams enables us to better tailor the information flow to the network environment and accommodate the demands of specific traffic patterns. This shift in paradigm is expected to revolutionize the way we manage, operate, and even understand networks and will have a deep impact on a wide range of areas such as r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2012
2012

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 63 publications
0
1
0
Order By: Relevance
“…Multicast routing [3,4,5,6] essentially is finding a minimum cost delivery tree which is referred to as Steiner tree via which multicast packets forward. There are some existing Steiner tree algorithms in literatures [8,9].…”
Section: Related Workmentioning
confidence: 99%
“…Multicast routing [3,4,5,6] essentially is finding a minimum cost delivery tree which is referred to as Steiner tree via which multicast packets forward. There are some existing Steiner tree algorithms in literatures [8,9].…”
Section: Related Workmentioning
confidence: 99%