Work

Minimal network coding for multicast

Year: 2005

Type: 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 multicast

Source: IEEE International Symposium on Information Theory (ISIT)

DOI: 10.1109/isit.2005.1523641

Authors: K. Bhattad, N. Ratnakar, R. Koetter, K.R. Narayanan

Institutions: Texas A&M University, University of Illinois Urbana-Champaign

Language: English

Topic: Cooperative Communication and Network Coding

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1997825969

FWCI: 3.561

Cites: 7

Cited by: 71

Related to: 10