Optimal distributed multicast routing using network coding

1 September 2004

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review

Vol. 32 (2) , 47-49
https://doi.org/10.1145/1035334.1035353

Abstract

Optimal data routing in a network can be often understood as a multicommodity flow problem. Given a network and a set of commodities, i.e., a set of source-destination pairs, one tries to achieve certain optimization goal, such as minimum delay, maximum throughput, while maintaining certain fairness among all commodities. The constraints of such optimization problems are usually network link capacity and traffic demand of each commodity. Multicommodity flow problem has been well studied as a typical linear programming problem. Its distributed solutions have also been proposed[2].

Keywords

This publication has 2 references indexed in Scilit:

Linear network coding
IEEE Transactions on Information Theory, 2003
Network information flow
IEEE Transactions on Information Theory, 2000