Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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 routing under BGP reroutes
2007 (English)In: GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, 2719-2723 p.Conference paper, Published paper (Refereed)
Abstract [en]

Configuration of the routing is critical for the quality and reliability of the communication in a large IP backbone. Large traffic shifts can occur due to changes in the Inter-domain routing that are hard to control by the network operator. This paper describes a framework for modeling, potential traffic shifts due to BGP reroutes, calculating worst-case traffic scenarios, and finding a single routing configuration that is robust against all possible traffic shifts due to BGP reroutes. The benefit of our approach is illustrated using BGP routing updates and network. topology from an operational IP network. Experiments demonstrate that the robust routing is able to obtain a consistently strong performance under large Inter-domain routing changes.

Place, publisher, year, edition, pages
2007. 2719-2723 p.
Series
IEEE Global Telecommunications Conference (Globecom), ISSN 1930-529X
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-7731ISI: 000257505702125Scopus ID: 2-s2.0-39349094037ISBN: 978-1-4244-1042-2 (print)OAI: oai:DiVA.org:kth-7731DiVA: diva2:12843
Conference
IEEE Global Telecommunications Conference (GLOBECOM 07) Washington, DC, NOV 26-30, 2007
Note
QC 20101105Available from: 2007-11-25 Created: 2007-11-25 Last updated: 2010-11-05Bibliographically approved
In thesis
1. Towards robust traffic engineering in IP networks
Open this publication in new window or tab >>Towards robust traffic engineering in IP networks
2007 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

To deliver a reliable communication service it is essential for the network operator to manage how traffic flows in the network. The paths taken by the traffic is controlled by the routing function. Traditional ways of tuning routing in IP networks are designed to be simple to manage and are not designed to adapt to the traffic situation in the network. This can lead to congestion in parts of the network while other parts of the network are far from fully utilized. In this thesis we explore issues related to optimization of the routing function to balance load in the network.

We investigate methods for efficient derivation of the traffic situation using link count measurements. The advantage of using link counts is that they are easily obtained and yield a very limited amount of data. We evaluate and show that estimation based on link counts give the operator a fast and accurate description of the traffic demands. For the evaluation we have access to a unique data set of complete traffic demands from an operational IP backbone.

Furthermore, we evaluate performance of search heuristics to set weights in link-state routing protocols. For the evaluation we have access to complete traffic data from a Tier-1 IP network. Our findings confirm previous studies that use partial traffic data or synthetic traffic data. We find that optimization using estimated traffic demands has little significance to the performance of the load balancing.

Finally, we device an algorithm that finds a routing setting that is robust to shifts in traffic patterns due to changes in the interdomain routing. A set of worst case scenarios caused by the interdomain routing changes is identified and used to solve a robust routing problem. The evaluation indicates that performance of the robust routing is close to optimal for a wide variety of traffic scenarios.

The main contribution of this thesis is that we demonstrate that it is possible to estimate the traffic matrix with good accuracy and to develop methods that optimize the routing settings to give strong and robust network performance. Only minor changes might be necessary in order to implement our algorithms in existing networks.

Place, publisher, year, edition, pages
Stockholm: KTH, 2007. xi, 36 p.
Series
Trita-EE, ISSN 1653-5146 ; 2007:073
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-4557 (URN)978-91-7178-816-0 (ISBN)
Presentation
2007-12-10, Q31, KTH, Osquldas väg 6, Stockholm, 10:00
Opponent
Supervisors
Note
QC 20101105Available from: 2007-11-25 Created: 2007-11-25 Last updated: 2010-11-05Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Gunnar, Anders
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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