Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Network overload avoidance by traffic engineering and content caching
RISE., Swedish ICT, SICS. School of Innovation, Design and Engineering.ORCID-id: 0000-0002-8102-5773
Rekke forfattare: 12012 (engelsk)Doktoravhandling, monografi (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Västerås, Sweden, 2012, 10.
Serie
SICS dissertation series, ISSN 1101-1335 ; 58
HSV kategori
Identifikatorer
URN: urn:nbn:se:ri:diva-24104OAI: oai:DiVA.org:ri-24104DiVA, id: diva2:1043183
Tilgjengelig fra: 2016-10-31 Laget: 2016-10-31 Sist oppdatert: 2018-07-04bibliografisk kontrollert

Open Access i DiVA

fulltekst(1763 kB)103 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1763 kBChecksum SHA-512
38a0939680d5b48c5b760568a3993bacafccd144782e08b512e48ae44c22f4b2fad0fbd733e38168d0699089e67d7d8f31d7004684f011327364cd14a1da512d
Type fulltextMimetype application/pdf

Personposter BETA

Abrahamsson, Henrik

Søk i DiVA

Av forfatter/redaktør
Abrahamsson, Henrik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 103 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 258 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.10