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
Robust Traffic Engineering using L-balanced Weight-Settings in OSPF/IS-IS
Swedish Institute of Computer Science.
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-2419-2735
2009 (English)In: Proceedings of the 2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009, 2009Conference paper, Published paper (Refereed)
Abstract [en]

Internet traffic volumes continue to grow at a great rate, now pushed by video and TV distribution in the networks. This brings up the need for traffic engineering mechanisms to better control the traffic. The objective of traffic engineering is to avoid congestion in the network and make good use of available resources by controlling and optimising the routing function. The challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands. Today, the main alternative for intra-domain traffic engineering in IP networks is to use different methods for setting the weights in the routing protocols OSPF and IS-IS. In this paper we revisit the weight setting approach to traffic engineering but with focus on robustness. We propose I-balanced weight settings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level I. This gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present a heuristic search method for finding I-balanced weight settings and show that it works well in real network scenarios

Place, publisher, year, edition, pages
2009.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:mdh:diva-9104DOI: 10.4108/ICST.BROADNETS2009.7184Scopus ID: 2-s2.0-74549167229ISBN: 978-963979949-3 (print)OAI: oai:DiVA.org:mdh-9104DiVA: diva2:301677
Conference
2009 6th International Conference on Broadband Communications, Networks and Systems, BROADNETS 2009; Madrid; 14-16 September 2009
Available from: 2010-03-03 Created: 2010-03-03 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

Publisher's full textScopus

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 110 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