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
Towards robust traffic engineering in IP networks
KTH, School of Electrical Engineering (EES), Electric Power Systems.
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: urn:nbn:se:kth:diva-4557ISBN: 978-91-7178-816-0 (print)OAI: oai:DiVA.org:kth-4557DiVA: diva2:12844
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
List of papers
1. Traffic matrix estimation on a large IP backbone: a comparison on real data
Open this publication in new window or tab >>Traffic matrix estimation on a large IP backbone: a comparison on real data
2004 (English)In: IMC '04 Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, 2004, 149-160 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers the problem of estimating the point-to-point traffic matrix in an operational IP backbone. Contrary to previous studies, that have used a partial traffic matrix or demands estimated from aggregated Netflow traces, we use a unique data set of complete traffic matrices from a global IP network measured over five-minute intervals. This allows us to do an accurate data analysis on the time-scale of typical link-load measurements and enables us to make a balanced evaluation of different traffic matrix estimation techniques. We describe the data collection infrastructure, present spatial and temporal demand distributions, investigate the stability of fan-out factors, and analyze the mean-variance relationships between demands. We perform a critical evaluation of existing and novel methods for traffic matrix estimation, including recursive fanout estimation, worst-case bounds, regularized estimation techniques, and methods that rely on mean variance relationships. We discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the European and American subnetworks.

Keyword
Traffic matrix estimation, Optimization, SNMP, MPLS
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-7729 (URN)10.1145/1028788.1028807 (DOI)2-s2.0-14944378851 (Scopus ID)
Conference
IMC’04 October 25–27, 2004, Taormina, Sicily, Italy
Note
QC 20101105Available from: 2007-11-25 Created: 2007-11-25 Last updated: 2012-03-02Bibliographically approved
2. Performance of traffic engineering in operational IP-networks: an experimental study
Open this publication in new window or tab >>Performance of traffic engineering in operational IP-networks: an experimental study
2005 (English)In: 5th IEEE International Workshop on IP Operations and Management, 2005, 202-211 p.Conference paper, Published paper (Refereed)
Abstract [en]

Today, the main alternative for intra-domain traffic engineering in IP networks is to use different methods for setting the weights (and so decide upon the shortest-paths) in the routing protocols OSPF and IS-IS. In this paper we study how traffic engineering perform in real networks. We analyse different weight-setting methods and compare performance with the optimal solution given by a multi-commodity flow optimization problem. Further, we investigate their robustness in terms of how well they manage to cope with estimated traffic matrix data. For the evaluation we have access to net-work topology and traffic data from an operational IP network.

Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, ISSN 0302-9743
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-7730 (URN)10.1007/11567486_21 (DOI)978-354029356-9 (ISBN)
Conference
5th IEEE International Workshop on IP Operations and Management, IPOM 2005; Barcelona; 26 October 2005 through 28 October 2005
Note
QC 20101105Available from: 2007-11-25 Created: 2007-11-25 Last updated: 2011-02-11Bibliographically approved
3. Robust routing under BGP reroutes
Open this publication in new window or tab >>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.

Series
IEEE Global Telecommunications Conference (Globecom), ISSN 1930-529X
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-7731 (URN)000257505702125 ()2-s2.0-39349094037 (Scopus ID)978-1-4244-1042-2 (ISBN)
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

Open Access in DiVA

fulltext(1266 kB)651 downloads
File information
File name FULLTEXT01.pdfFile size 1266 kBChecksum MD5
aff9fe22d31ed37017a8bc7751a15c0962d4181a5229288ce6b7253c9fef55d570794e61
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Gunnar, Anders
By organisation
Electric Power Systems
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 651 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

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