Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimal layered multicast

Optimal layered multicast Optimal Layered Multicast AJAY GOPINATHAN and ZONGPENG LI, University of Calgary Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them ef ciently computable. While most such algorithm design assumes a single le/layer being multicast, layered coding introduces new challenges into the paradigm due to its cumulative decoding nature. Layered coding is designed to handle heterogeneity in receiver capacities, and a node may decode layer k only if it successfully receives all layers in 1..k. We show that recently proposed optimization models for layered multicast do not correctly address this challenge. We argue that in order to achieve the absolute maximum throughput (or minimum cost), it is necessary to decouple the application-layer throughput from network-layer throughput. In particular, a node should be able to receive a nonconsecutive layer or a partial layer even if it cannot decode and utilize it (e.g., for playback in media streaming applications). The rationale is that nodes at critical network locations need to receive data just for helping other peers. We present a mathematical programming model that addresses these challenges and achieves absolute optimal performance. Simulation results show considerable throughput gain (cost reduction) compared http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) Association for Computing Machinery

Optimal layered multicast

Download PDF
20 pages

Loading next page...
 
/lp/association-for-computing-machinery/optimal-layered-multicast-jilWGydLqf
Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1551-6857
DOI
10.1145/1925101.1925102
Publisher site
See Article on Publisher Site

Abstract

Optimal Layered Multicast AJAY GOPINATHAN and ZONGPENG LI, University of Calgary Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them ef ciently computable. While most such algorithm design assumes a single le/layer being multicast, layered coding introduces new challenges into the paradigm due to its cumulative decoding nature. Layered coding is designed to handle heterogeneity in receiver capacities, and a node may decode layer k only if it successfully receives all layers in 1..k. We show that recently proposed optimization models for layered multicast do not correctly address this challenge. We argue that in order to achieve the absolute maximum throughput (or minimum cost), it is necessary to decouple the application-layer throughput from network-layer throughput. In particular, a node should be able to receive a nonconsecutive layer or a partial layer even if it cannot decode and utilize it (e.g., for playback in media streaming applications). The rationale is that nodes at critical network locations need to receive data just for helping other peers. We present a mathematical programming model that addresses these challenges and achieves absolute optimal performance. Simulation results show considerable throughput gain (cost reduction) compared

Journal

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) – Association for Computing Machinery

Published: Feb 1, 2011

There are no references for this article.