ICDCS 2009, June 24 2009, Montreal. Stochastic Multicast with Network Coding. Ajay Gopinathan, Zongpeng Li Department of Computer Science University of Calgary. Outline. Capacity planning at multicast service provider Solution 1 – Heuristic Usually but not always good solutions
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
ICDCS 2009, June 24 2009, Montreal
Stochastic Multicast with Network Coding
Ajay Gopinathan, Zongpeng Li
Department of Computer Science
University of Calgary
Network Service Provider
Usage beyond SLA incurs penalties!
“A multicast rate of d is achievable if and only if d is a feasible unicast rate to each multicast receiver separately”
If there exists a -strict cost sharing scheme, then sampling provides a (1 + )-approximate solution
The variables in the dual linear program for multicast constitute a 2-strict cost sharing scheme