Campus Event Calendar
Event Entry
What and Who
Internet Traffic Engineering by Optimizing OSPF Weights
Domagoj Matijevic
Intl. Max Planck Research School
Lecture
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 21 January 2002
16:15
-- Not specified --
46.1 - MPII
024
Saarbrücken
Abstract
Open Shortest Path First (OSPF) is the most commonly used intra-domain
internet routing protocol. Traffic flow is routed along shortest paths,
splitting flow at nodes where several outgoing links are on the shortest
paths to the destination.
The desire was to optimise the weight setting based on the projected
demands using local search heuristic that is original in its use of hash
tables to avoid cycling. Surprisingly it turned out that for the proposed
AT&T WorldNet backbone there exists weights settings that performed within
a few percent from that of the optimal general routing.
These results are based on a paper by Fortz and Thorup (INFOCOM 2000).
Contact
Piotr Krysta
--email hidden
passcode not visible
logged in users only