liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient and Adaptive Content Delivery of Linear and Interactive Branched Videos
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
2016 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Video streaming over the Internet has gained tremendous popularity over recent years and currently constitutes the majority of Internet traffic. The on-demand delivery of high quality video streaming has been enabled by a combination of consistent improvements in residential download speeds, HTTP-based Adaptive Streaming (HAS), extensive content caching, and the use of Content Distribution Networks (CDNs). However, as large-scale on-demand streaming is gaining popularity, several important questions and challenges remain unanswered, including determining how the infrastructure can best be leveraged to provide users with the best possible playback experience. In addition, it is important to develop new techniques and protocols that facilitate the next generation of streaming applications. Innovative services such as interactive branched streaming are gaining popularity and are expected to be the next big thing in on-demand entertainment.

The major contributions of this thesis are in the area of efficient content delivery of video streams using HAS. To address the two challenges above, the work utilizes a combination of different methods and tools, ranging from real-world measurements, characterization of system performance, proof-of-concept implementations, protocol optimization, and evaluation under realistic environments. First, through careful experiments, we evaluate the performance impact and interaction of HAS clients with proxy caches. Having studied the typical interactions between HAS clients and caches, we then design and evaluate content-aware policies to be used by the proxy caches, which parse the client requests and prefetch the chunks that are most likely to be requested next. In addition, we also design cooperative policies in which clients and proxies share information about the playback session. Our evaluations reveal that, in general, the bottleneck location and network conditions play central roles in which policy choices are most advantageous, and the location of the bottlenecks significantly impact the relative performance differences between policy classes. We also show that careful design and policy selection is important when trying to enhance HAS performance using proxy assistance.

Second, this thesis proposes, models, designs, and evaluates novel streaming applications such as interactive branched videos. In such videos, users can influence the content that is being shown to them. We design and evaluate careful prefetching policies that provides seamless playback even when the users defer their path choices to the last possible moment. We derive optimized prefetching policies using an optimization framework, design and implement effective buffer management techniques for seamless playback at branch points, and use parallel TCP connections to achieve efficient buffer workahead. Through performance evaluations, we show that our policies can effectively prefetch data of carefully adapted qualities along multiple alternative paths so to ensure seamless playback, offering users a pleasant viewing experience without playback interruptions.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. , 112 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1758
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-131030DOI: 10.3384/lic.diva-131030ISBN: 9789176856802 (print)OAI: oai:DiVA.org:liu-131030DiVA: diva2:975228
Presentation
2016-11-04, Alan Turing, Hus E, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)
Opponent
Supervisors
Funder
CUGS (National Graduate School in Computer Science)
Note

The series title Linköping Studies in Science and Technology Licentiate Thesis is incorrect. The correct series title is Linköping Studies in Science and Technology Thesis.

Available from: 2016-09-30 Created: 2016-09-06 Last updated: 2016-09-30Bibliographically approved

Open Access in DiVA

Efficient and Adaptive Content Delivery of Linear and Interactive Branched Videos(1946 kB)120 downloads
File information
File name FULLTEXT03.pdfFile size 1946 kBChecksum SHA-512
be71cb4efdbfd9508b084cc4cc1f2dd59288fc2c53d0b4ea583f0e9fea65aee90d40f2d149bd7ddffc31609babb43e947eb54eca61f98771ac5337edc41b41da
Type fulltextMimetype application/pdf
omslag(20 kB)12 downloads
File information
File name COVER01.pdfFile size 20 kBChecksum SHA-512
b79c6ad89304b824cdfcd0eeaeb80b58a58e4e848243940cbf2da3aceafa941202358a2d5052d6e037097788342fce89c03a9a24e2f9eac9a7fbcd8cf9fbd743
Type coverMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Krishnamoorthi, Vengatanathan
By organisation
Database and information techniquesFaculty of Science & Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 120 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 602 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf