Internet traffic engineering by optimizing OSPF weights (2000)
Cached
Download Links
- [www.cs.utexas.edu]
- [www-cse.ucsd.edu]
- [www.ieee-infocom.org]
- [eeweb.poly.edu]
- [suraj.lums.edu.pk]
- [cs.unibg.it]
- DBLP
Other Repositories/Bibliography
| Venue: | in Proc. IEEE INFOCOM |
| Citations: | 261 - 11 self |
BibTeX
@INPROCEEDINGS{Fortz00internettraffic,
author = {Bernard Fortz},
title = {Internet traffic engineering by optimizing OSPF weights},
booktitle = {in Proc. IEEE INFOCOM},
year = {2000},
pages = {519--528}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 shortest paths to the destination. The weights of the links, and thereby the shortest path routes, can be changed by the network operator. The weights could be set proportional to their physical distances, but often the main goal is to avoid congestion, i.e. overloading of links, and the standard heuristic recommended by Cisco is to make the weight of a link inversely proportional to its capacity. Our starting point was a proposed AT&T WorldNet backbone with demands projected from previous measurements. The desire was to optimize the weight setting based on the projected demands. We showed that optimizing the weight settings for a given set of demands is NP-hard, so we resorted to a local search heuristic. Surprisingly it turned out that for the proposed AT&T WorldNet backbone, we found weight settings that performed
