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
Simulation of IPTV caching strategies
Swedish Institute of Computer Science.
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-2419-2735
2010 (English)In: Proceedings of the 2010 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2010, 187-193 p.Conference paper, Published paper (Refereed)
Abstract [en]

IPTV, where television is distributed over the Internet Protocol in a single operator network, has become popular and widespread. Many telecom and broadband companies have become TV providers and distribute TV channels using multicast over their backbone networks. IPTV also means an evolution to time-shifted television where viewers now often can choose to watch the programs at any time. However, distributing individual TV streams to each viewer requires a lot of bandwidth and is a big challenge for TV operators. In this paper we present an empirical IPTV workload model, simulate IPTV distribution with time-shift, and show that local caching can limit the bandwidth requirements significantly.

Place, publisher, year, edition, pages
2010. 187-193 p.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-16104Scopus ID: 2-s2.0-78649246964OAI: oai:DiVA.org:mdh-16104DiVA: diva2:565254
Conference
International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS’10); Ottawa,11-14 July 2010
Available from: 2012-11-06 Created: 2012-11-06 Last updated: 2013-12-03Bibliographically 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

Scopushttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5588896

Search in DiVA

By author/editor
Björkman, Mats
By organisation
School of Innovation, Design and Engineering
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 155 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