skip to main content
10.1145/2229087.2229106acmconferencesArticle/Chapter ViewAbstractPublication PagesmmsysConference Proceedingsconference-collections
research-article

Minimizing server throughput for low-delay live streaming in content delivery networks

Published: 07 June 2012 Publication History

Abstract

Large-scale live streaming systems can experience bottlenecks within the infrastructure of the underlying Content Delivery Network. In particular, the "equipment bottleneck" occurs when the fan-out of a machine does not enable the concurrent transmission of a stream to multiple other equipments. In this paper, we aim to deliver a live stream to a set of destination nodes with minimum throughput at the source and limited increase of the streaming delay. We leverage on rateless codes and cooperation among destination nodes. With rateless codes, a node is able to decode a video block of k information symbols after receiving slightly more than k encoded symbols. To deliver the encoded symbols, we use multiple trees where inner nodes forward all received symbols. Our goal is to build a diffusion forest that minimizes the transmission rate at the source while guaranteeing on-time delivery and reliability at the nodes. When the network is assumed to be lossless and the constraint on delivery delay is relaxed, we give an algorithm that computes a diffusion forest resulting in the minimum source transmission rate. We also propose an effective heuristic algorithm for the general case where packet loss occurs and the delivery delay is bounded. Simulation results for realistic settings show that with our solution the source requires only slightly more than the video bit rate to reliably feed all nodes.

References

[1]
M. Adler, R. K. Sitaraman, and H. Venkataramani. Algorithms for optimizing the bandwidth cost of content delivery. Computer Networks, 55(18):4007--4020, 2011.
[2]
J. M. Almeida, D. L. Eager, M. K. Vernon, and S. J. Wright. Minimizing delivery cost in scalable streaming content distribution systems. IEEE Trans. Multimedia, 6(2):356--365, 2004.
[3]
K. Andreev, B. Maggs, A. Meyerson, J. Saks, and R. Sitaraman. Algorithms for constructing overlay networks for live streaming. CoRR 1109.4114, 2011.
[4]
K. Andreev, B. M. Maggs, A. Meyerson, and R. K. Sitaraman. Designing overlay multicast networks for streaming. In Proc. ACM SPAA, pages 149--158, 2003.
[5]
R. Gibbs. A new approach to publishing and caching video. Technical report, Alcatel-Lucent, Jan. 2012.
[6]
M. Grangetto, R. Gaeta, and M. Sereno. Rateless codes network coding for simple and efficient P2P video streaming. In Proc. of ICME, pages 1500--1503, Jul. 2009.
[7]
S. Higginbotham. Smart TVs cause a net neutrality debate in S. Korea. Giga OM, Feb. 2012.
[8]
C. Liu, I. Bouazizi, M. M. Hannuksela, and M. Gabbouj. Rate adaptation for dynamic adaptive streaming over HTTP in content distribution network. Signal Processing: Image Communication, 27(4):288--311, 2012.
[9]
M. Luby. LT Codes. In Proc. of FOCS, pages 271--280, 2002.
[10]
M. Luby, T. Gasiba, T. Stockhammer, and M. Watson. Reliable multimedia download delivery in cellular broadcast networks. IEEE Trans. Broadcast., 53(1):235--246, 2007.
[11]
J. Ni and D. H. K. Tsang. Large-scale cooperative caching and application-level multicast in multimedia content delivery networks. IEEE Commun. Mag., 43(5):98--105, May 2005.
[12]
A. Shokrollahi. Raptor codes. IEEE Trans. Inf. Theory, 52(6):2551--2567, 2006.
[13]
T. Siglin. Super Bowl Streaming Fail. Streaming Media, Feb. 2012.
[14]
N. Thomos and P. Frossard. Network coding of rateless video in streaming overlays. IEEE Trans. Circuits Syst. Video Technol., 20(12):1834--1847, 2010.
[15]
C. Wu and B. Li. rstream: Resilient and optimal peer-to-peer streaming with rateless codes. IEEE Trans. Parallel Distrib. Syst., 19(1):77--92, 2008.

Cited By

View all
  • (2023)Bi-Criteria Approximation for a Multi-Origin Multi-Channel Auto-Scaling Live Streaming CloudIEEE Transactions on Multimedia10.1109/TMM.2022.315209325(2839-2850)Online publication date: 1-Jan-2023
  • (2021)Playing chunk-transferred DASH segments at low latency with QLiveProceedings of the 12th ACM Multimedia Systems Conference10.1145/3458305.3463376(51-64)Online publication date: 24-Jun-2021
  • (2017)Adaptive Bitrate Selection: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2017.272524119:4(2985-3014)Online publication date: Dec-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
NOSSDAV '12: Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
June 2012
116 pages
ISBN:9781450314305
DOI:10.1145/2229087
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. cdn
  2. delivery trees
  3. live streaming
  4. rateless codes

Qualifiers

  • Research-article

Conference

NOSSDAV '12
Sponsor:

Acceptance Rates

Overall Acceptance Rate 118 of 363 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Bi-Criteria Approximation for a Multi-Origin Multi-Channel Auto-Scaling Live Streaming CloudIEEE Transactions on Multimedia10.1109/TMM.2022.315209325(2839-2850)Online publication date: 1-Jan-2023
  • (2021)Playing chunk-transferred DASH segments at low latency with QLiveProceedings of the 12th ACM Multimedia Systems Conference10.1145/3458305.3463376(51-64)Online publication date: 24-Jun-2021
  • (2017)Adaptive Bitrate Selection: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2017.272524119:4(2985-3014)Online publication date: Dec-2018
  • (2016)Tree construction algorithm for virtual content distribution networkMultimedia Tools and Applications10.1007/s11042-014-2277-775:1(131-144)Online publication date: 1-Jan-2016
  • (2016)Optimal tree packing for discretized live rate-adaptive streaming in CDNMultimedia Systems10.1007/s00530-015-0471-822:5(559-573)Online publication date: 1-Oct-2016
  • (2015)On crowdsourced interactive live streamingProceedings of the 25th ACM Workshop on Network and Operating Systems Support for Digital Audio and Video10.1145/2736084.2736091(55-60)Online publication date: 18-Mar-2015
  • (2015)Joint Optimization for the Delivery of Multiple Video Channels in Telco-CDNsIEEE Transactions on Network and Service Management10.1109/TNSM.2015.240091512:1(87-100)Online publication date: Mar-2015
  • (2015)Leveraging Light Forest With Rateless Network Coding to Design Efficient All-Optical Multicast Schemes for Elastic Optical NetworksJournal of Lightwave Technology10.1109/JLT.2015.245709233:18(3945-3955)Online publication date: 15-Sep-2015
  • (2014)Optimal Delivery of Rate-Adaptive Streams in Underprovisioned NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2014.14040432:4(706-718)Online publication date: Apr-2014
  • (2014)Web of Objects Platform for Service Composition Using Devices Profile for Web Services2014 International Conference on Information Science & Applications (ICISA)10.1109/ICISA.2014.6847482(1-4)Online publication date: May-2014
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media