Bernard Fortz, Mikkel Thorup  Home/Search
Context Related
| ieeeinfocom.org/2000/papers/165.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsc.edu/~rom/infocom20...program (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
iREX: Efficient inter-domain QoS policy architecture - Yahaya, Harks, Suda (2006) (Correct)
Traffic Engineering with Estimated Traffic Matrices - Matthew Roughan Mikkel (2003) (Correct)
Refactoring Network Control and Management: A Case .. - Greenberg.. (2005) (Correct)
Similar documents (at the sentence level):
66.8%: Internet Traffic Engineering by Optimizing OSPF Weights - Fortz, al. (2000) (Correct)
48.8%: Increasing Internet Capacity Using Local Search - Fortz, Thorup (2000) (Correct)
Active bibliography (related documents): More All
0.6: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.2: Robust optimization of OSPF/IS-IS weights - Fortz, Thorup (2003) (Correct)
0.1: A Genetic Algorithm For The Weight Setting Problem In.. - Ericsson, Resende.. (Correct)
Similar documents based on text: More All
0.9: On the Evaluation of the Reliability of OSPF routing in IP networks - Fortz (2002) (Correct)
0.7: A Memetic Algorithm for OSPF Routing - Buriol, Resende, Ribeiro, Mikkel (2002) (Correct)
0.5: Traffic Engineering with Traditional IP Routing Protocols - Fortz, Rexford, Thorup (2002) (Correct)
Related documents from co-citation: More All
29: Multiprotocol Label Switching Architecture (context) - Rosen, Viswanathan et al. - 1998
27: Requirements for traffic engineering over MPLS (context) - Awduche - 1998
25: Deriving traffic demands for operational IP networks: Methodology and experience - Feldmann, Greenberg et al. - 2000
BibTeX entry: (Update)
B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, March 2000. 13 http://citeseer.ist.psu.edu/fortz00internet.html More
@inproceedings{ fortz00internet,
author = "Bernard Fortz and Mikkel Thorup",
title = "Internet Traffic Engineering by Optimizing {OSPF} Weights",
booktitle = "{INFOCOM} (2)",
pages = "519-528",
year = "2000",
url = "citeseer.ist.psu.edu/fortz00internet.html" }
Citations (may not include all citations):417 Local Search in Combinatorial Optimization (context) - Aarts, Lenstra - 1997
344 How to model an internetwork - Zegura, Calvert et al. - 1996
326 Multiprotocol label switching architecture (context) - Rosen, Viswanathan et al. - 1999
132 Requirements for traffic engineering over MPLS (context) - Awduche, Malcolm et al. - 1999
107 Modeling internet topology - Calvert, Doar et al. - 1997
105 Future paths for integer programming and links to artificial.. (context) - Glover - 1986
49 An incremental algorithm for a generalization of the shortes.. - Ramalingam, Reps - 1996
17 A polynomial time algorithm for linear programming (context) - Khachiyan - 1979
13 Hashing vectors for tabu search (context) - Woodruff, Zemel - 1993
9 Experimental analysis of dynamic algorithms for the single-s.. - Frigioni, Ioffreda et al. - 1998
4 OSPF: Anatomy of an Internet Routing Protocal (context) - Moy - 1999
1 Universal hashing and k-wise independent random variables vi.. (context) - Dietzfelbibger - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ucsc.edu/~rom/infocom2000/program.html): More
Constrained Multicast Routing in WDM Networks with Sparse.. - Zhang, Wei, Qiao (1999) (Correct)
A Signaling System Using Lightweight Call Sessions - Wang, Joseph, Katz (2000) (Correct)
Layered Multicast Recovery - Rhee, Joshi, Lee, Muthukrishnan.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC