The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Traffic engineering with traditional IP routing protocols
Open accessAbstract
Traffic engineering involves adapting the routing of traffic to network conditions, with the joint goals of good user performance and efficient use of network resources. We describe an approach to intradomain traffic engineering that works within the existing deployed base of interior gateway protocols, such as Open Shortest Path First and Intermediate System-Intermediate System. We explain how to adapt the configuration of link weights, based on a networkwide view of the traffic and topology within a domain. In addition, we summarize the results of several studies of techniques for optimizing OSPF/IS-IS weights to the prevailing traffic. The article argues that traditional shortest path routing protocols are surprisingly effective for engineering the flow of traffic in large IP networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
Internet traffic engineering by optimizing OSPF weights
Fortz, B., & Thorup, M. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832225 · Cited by 1,110
Self-citationOptimizing OSPF/IS-IS weights in a changing world
Fortz, B., & Thorup, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1003042 · Cited by 660
Self-citationOverview and Principles of Internet Traffic Engineering
Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., & Xiao, X. (2002) · doi:10.17487/rfc3272 · Cited by 590
Deriving traffic demands for operational IP networks: methodology and experience
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., & True, F. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929850 · Cited by 430
Self-citationMPLS and traffic engineering in IP networks
Awduche, D. O. (1999) · IEEE Communications Magazine · doi:10.1109/35.809383 · Cited by 363
Time-Varying Network Tomography: Router Link Data
Cao, J., Davis, D., Vander Wiel, S., & Yu, B. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10474303 · Cited by 319
Trajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
NetScope: traffic engineering for IP networks
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000) · IEEE Network · doi:10.1109/65.826367 · Cited by 224
Self-citationIP network configuration for intradomain traffic engineering
Feldmann, A., & Rexford, J. (2001) · IEEE Network · doi:10.1109/65.953233 · Cited by 93
Self-citation
Cited by
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486019 · Cited by 1,771
Achieving high utilization with software-driven WAN
Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., & Wattenhofer, R. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486012 · Cited by 1,057
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2534169.2486019 · Cited by 1,004
A clean slate 4D approach to network control and management
Greenberg, A., Hjalmtysson, G., Maltz, D. A., Myers, A., Rexford, J., Xie, G., Yan, H., Zhan, J., & Zhang, H. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1096536.1096541 · Cited by 650
Self-citationA roadmap for traffic engineering in SDN-OpenFlow networks
Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536
Metadata
- Authors
- Fortz, B., Rexford, J., & Thorup, M.
- Venue
- IEEE Communications Magazine
- Published
- 2002-10
- Volume
- 40
- Issue
- 10
- Pages
- 118-124
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2165030634
- Cited by
- 460
- References
- 10
- FWCI
- 25.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Traffic engineering with traditional IP routing protocols. https://app.cochat.ai/papers/10.1109/mcom.2002.1039866
- The paper
- Fortz, B., Rexford, J., & Thorup, M. (2002). Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine. https://doi.org/10.1109/mcom.2002.1039866
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.