Minimal network coding for multicast Conference Paper

abstract

• We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize the number of packets that undergo network coding. We also propose a decentralized algorithm to construct capacity achieving multicast codes when the processing at some nodes is restricted to routing. The proposed algorithms can be coupled with existing decentralized schemes to achieve minimum cost muticast.

name of conference

• Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

authors

• Narayanan, Krishna

published proceedings

• 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2

author list (cited authors)

• Bhattad, K., Ratnakar, N., Koetter, R., & Narayanan, K. R.

citation count

• 54

complete list of authors

• Bhattad, K||Ratnakar, N||Koetter, R||Narayanan, KR

publication date

• January 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

Digital Object Identifier (DOI)

• 10.1109/isit.2005.1523641

International Standard Book Number (ISBN) 10

• 0-7803-9150-0

International Standard Book Number (ISBN) 13

• 9780780391512

start page

• 1730

end page

• 1734

volume

• 2005

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fisit.2005.1523641