The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Optimizing OSPF/IS-IS weights in a changing world
Open accessAbstract
A system of techniques is presented for optimizing open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS) weights for intradomain routing in a changing world, the goal being to avoid overloaded links. We address predicted periodic changes in traffic as well as problems arising from link failures and emerging hot spots.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Multiprotocol Label Switching Architecture
Rosen, E., Viswanathan, A., & Callon, R. (2001) · doi:10.17487/rfc3031 · Cited by 2,976
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Local Search in Combinatorial Optimization
(2003) · Princeton University Press eBooks · doi:10.1515/9780691187563 · Cited by 2,057
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,679
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-citationRequirements 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
A random graph model for massive graphs
Aiello, W., Chung, F., & Lu, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335326 · Cited by 917
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
Cited by
Overview and Principles of Internet Traffic Engineering
Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., & Xiao, X. (2002) · doi:10.17487/rfc3272 · Cited by 590
Traffic engineering in software defined networks
Agarwal, S., Kodialam, M., & Lakshman, T. V. (2013) · 2013 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2013.6567024 · Cited by 547
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
Fast accurate computation of large-scale IP traffic matrices from link loads
Zhang, Y., Roughan, M., Duffield, N., & Greenberg, A. (2003) · Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/781027.781053 · Cited by 505
Borstad, J. D., & Ludewig, P. M. (2005) · Journal of Orthopaedic & Sports Physical Therapy · doi:10.2519/jospt.2005.35.4.227 · Cited by 489
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
Self-citationCharacterization of failures in an IP backbone
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., & Diot, C. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354653 · Cited by 430
Characterization of Failures in an Operational IP Backbone Network
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., Ganjali, Y., & Diot, C. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.902727 · Cited by 407
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
Walking the tightrope: responsive yet stable traffic engineering
Kandula, S., Katabi, D., Davie, B., & Charny, A. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080122 · Cited by 352
Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)
Roughan, M., Zhang, Y., Willinger, W., & Qiu, L. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2169424 · Cited by 267
Tang, F., Mao, B., Fadlullah, Z. M., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1700244 · Cited by 247
Metadata
- Authors
- Fortz, B., & Thorup, M.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2002-05
- Volume
- 20
- Issue
- 4
- Pages
- 756-767
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2163907500
- Cited by
- 660
- References
- 16
- FWCI
- 38.33
- 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
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.