mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Program popularity and viewer behaviour in a large TV-on-Demand system
Swedish Institute of Computer Science, Kista, Sweden.
TeliaSonera AB, Stockholm, Sweden .
2012 (English)In: IMC '12 Proceedings of the 2012 ACM conference on Internet measurement conference, New York: ACM , 2012, 199-210 p.Conference paper, Published paper (Refereed)
Abstract [en]

Today increasingly large volumes of TV and video are distributed over IP-networks and over the Internet. It is therefore essential for traffic and cache management to understand TV program popularity and access patterns in real networks.

In this paper we study access patterns in a large TV-on-Demand system over four months. We study user behaviour and program popularity and its impact on caching. The demand varies a lot in daily and weekly cycles. There are large peaks in demand, especially on Friday and Saturday evenings, that need to be handled.

We see that the cacheability, the share of requests that are not first-time requests, is very high. Furthermore, there is a small set of programs that account for a large fraction of the requests. We also find that the share of requests for the top most popular programs grows during prime time, and the change rate among them decreases. This is important for caching. The cache hit ratio increases during prime time when the demand is the highest, and aching makes the biggest difference when it matters most.

We also study the popularity (in terms of number of requests and rank) of individual programs and how that changes over time. Also, we see that the type of programs offered determines what the access pattern will look like.

Place, publisher, year, edition, pages
New York: ACM , 2012. 199-210 p.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-16106DOI: 10.1145/2398776.2398798ISBN: 978-1-4503-1705-4 (print)OAI: oai:DiVA.org:mdh-16106DiVA: diva2:565256
Conference
Internet Measurement Conference 2012 (IMC’12), November 14-16, 2012 Boston Massachusetts USA
Available from: 2012-11-06 Created: 2012-11-06 Last updated: 2012-12-05Bibliographically approved
In thesis
1. Network overload avoidance by traffic engineering and content caching
Open this publication in new window or tab >>Network overload avoidance by traffic engineering and content caching
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers.  This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching.

This thesis studies access patterns for TV and video and the potential for caching.  The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months.

The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type.

For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands.

This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic.  We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2012
Series
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 133
National Category
Computer Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-16107 (URN)978-91-7585-087-1 (ISBN)
Public defence
2012-12-19, Kappa, Mälardalens högskola, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2012-11-07 Created: 2012-11-06 Last updated: 2012-11-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 208 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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