Optimal distributed multicast routing using network coding: theory and applications

Authors:
Yi Cui;Yuan Xue;Klara Nahrstedt
Affiliations:
University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2004

Citing 2
Cited 4

Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory

Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A constant bound on throughput improvement of multicast network coding in undirected networks

IEEE Transactions on Information Theory
End-to-end delay analysis for reliable communications over lossy channels: integrating network coding and ARQ schemes

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed algorithms for minimum cost multicast with network coding

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.06

Visualization

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].