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
OSPF Weight Tuning for Efficient Routing in IP Networks
KTH, School of Electrical Engineering (EES), Automatic Control.
2004 (English)Student paper other, 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Routing within a telecommunication network defines how the traffic flow is mapped on the network topology. The increasing commercial importance of the Internet together with a rising number of real-time applications make of the routing mechanisms as essential feature in the control of the network performance. The routing mechanisms involved allow to assign the network capacities, more or less efficiently, to the demands or requests of traffic. The routing choice has a direct impact on the existence and location of congestion within the network. A high level of congestion may decrease the grade of service (increased delays, packet losses, call blocking, etc). Today several mechanisms are proposed to increase the routing control and to optimize the network performance, without introducing complexity in the network management but keeping the actual routers configuration.

In this Thesis, we addressed the problem of local balancing in networks that use shortest path routing. In particular, starting from a given network topology, we are aimed in finding the link-distance metric assignment to all links in the network that minimize the maximum utilization and therefore minimize the congestion.

Since it has shown that optimizing the weight setting for a given demand of traffic between routers is NP-hard, we resorted to a local search heuristic. This method has been considered for OSPF and ECMP routing disciplines, and we have found a weight set that are within a few percent from that of the optimal general routing where the flow for each demand is optimally distributed over all path between source and destination.

Place, publisher, year, edition, pages
2004. , 66 p.
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-109473OAI: oai:DiVA.org:kth-109473DiVA: diva2:582533
Uppsok
Technology
Examiners
Available from: 2013-01-28 Created: 2013-01-04 Last updated: 2013-01-28Bibliographically approved

Open Access in DiVA

fulltext(465 kB)235 downloads
File information
File name FULLTEXT01.pdfFile size 465 kBChecksum SHA-512
1f4eec181bf9fe67298d905215855f4887c43cebda3dce34d302bbba9ef4e145e0a24394b0ff33107e1d14fb82e7fe1880ac9f16559ac82e70c73287ab38fb59
Type fulltextMimetype application/pdf

By organisation
Automatic Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 235 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

urn-nbn

Altmetric score

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