The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Overview and Principles of Internet Traffic Engineering
Open accessAbstract
This memo describes the principles of Traffic Engineering (TE) in the Internet.The document is intended to promote better understanding of the issues surrounding traffic engineering in IP networks, and to provide a common basis for the development of traffic engineering capabilities for the Internet.The principles, architectures, and methodologies for performance evaluation and performance optimization of operational IP networks are discussed throughout this document.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
An Architecture for Differentiated Services
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998) · doi:10.17487/rfc2475 · Cited by 3,965
Multiprotocol Label Switching Architecture
Rosen, E., Viswanathan, A., & Callon, R. (2001) · doi:10.17487/rfc3031 · Cited by 2,976
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
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
Requirements for Traffic Engineering Over MPLS
Awduche, D. O., Malcolm, J., Agogbua, J., O’Dell, M., & McManus, J. (1999) · doi:10.17487/rfc2702 · Cited by 1,021
Self-citationTCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
Specification of Guaranteed Quality of Service
Shenker, S., Partridge, C., & Guerin, R. (1997) · doi:10.17487/rfc2212 · Cited by 941
The New Routing Algorithm for the ARPANET
McQuillan, J., Richer, I., & Rosen, E. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094721 · Cited by 686
Optimizing 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
Specification of the Controlled-Load Network Element Service
Wroclawski, J. (1997) · doi:10.17487/rfc2211 · Cited by 656
A Framework for QoS-based Routing in the Internet
Crawley, E., Nair, R., Rajagopalan, B., & Sandick, H. (1998) · doi:10.17487/rfc2386 · Cited by 647
Requirements for IP Version 4 Routers
(1995) · doi:10.17487/rfc1812 · Cited by 462
A Framework for Integrated Services Operation over Diffserv Networks
Bernet, Y., Ford, P., Yavatkar, R., Baker, F., Zhang, L., Speer, M., Braden, R., Davie, B., Wroclawski, J., & Felstaine, E. (2000) · doi:10.17487/rfc2998 · Cited by 390
MPLS and traffic engineering in IP networks
Awduche, D. O. (1999) · IEEE Communications Magazine · doi:10.1109/35.809383 · Cited by 363
Self-citationGeneral Characterization Parameters for Integrated Service Network Elements
Shenker, S., & Wroclawski, J. (1997) · doi:10.17487/rfc2215 · Cited by 249
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
Design considerations for supporting TCP with per-flow queueing
Suter, B., Lakshman, T. V., Stiliadis, D., & Choudhury, A. K. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1998.659666 · Cited by 121
Lougheed, K., & Rekhter, Y. (1990) · doi:10.17487/rfc1163 · Cited by 91
Network Element Service Specification Template
Shenker, S. J., & Wroclawski, J. T. (1997) · doi:10.17487/rfc2216 · Cited by 71
An Application of the BGP Community Attribute in Multi-home Routing
Chen, E., & Bates, T. (1996) · doi:10.17487/rfc1998 · Cited by 45
Cited by
A 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
Traffic engineering with traditional IP routing protocols
Fortz, B., Rexford, J., & Thorup, M. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1039866 · Cited by 460
Software Defined Networking Architecture, Security and Energy Efficiency: A Survey
Rawat, D. B., & Reddy, S. R. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2618874 · Cited by 372
Network-Wide Configuration Synthesis
El-Hassany, A., Tsankov, P., Vanbever, L., & Vechev, M. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63390-9_14 · Cited by 93
Metadata
- Authors
- Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., & Xiao, X.
- Publisher
- RFC Editor
- Published
- 2002-05
- OpenAlex
- W1612056114
- Cited by
- 590
- References
- 21
- Type
- report
- Language
- en
- Open access
- gold
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
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.