The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Achieving sub-second IGP convergence in large IP networks
Open accessAbstract
We describe and analyse in details the various factors that influence the convergence time of intradomain link state routing protocols. This convergence time reflects the time required by a network to react to the failure of a link or a router. To characterise the convergence process, we first use detailed measurements to determine the time required to perform the various operations of a link state protocol on currently deployed routers. We then build a simulation model based on those measurements and use it to study the convergence time in large networks. Our measurements and simulations indicate that sub-second link-state IGP convergence can be easily met on an ISP network without any compromise on stability.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Characterization 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
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Vasseur, J.-P., Pickavet, M., & Demeester, P. M. A. (2004) · Cited by 370
OSI IS-IS Intra-domain Routing Protocol
(1990) · doi:10.17487/rfc1142 · Cited by 331
Internet Engineering Task Force
(2018) · The SAGE Encyclopedia of the Internet · doi:10.4135/9781473960367.n143 · Cited by 266
Feasibility of IP restoration in a tier 1 backbone
Iannoccone, G. J., Chuch, C.-N., Bhattachoryya, S., & Diot, C. (2004) · IEEE Network · doi:10.1109/mnet.2004.1276606 · Cited by 172
A study of packet delivery performance during routing convergence
Pei, D., Wang, L., Massey, D. F., Wu, S. F., & Zhang, L. (2004) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2003.1209929 · Cited by 35
Cited by
Adaptive forwarding in named data networking
Yi, C., Afanasyev, A., Wang, L., Zhang, B., & Zhang, L. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2317307.2317319 · Cited by 308
Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case
Almasan, P., Suárez-Varela, J., Rusek, K., Barlet-Ros, P., & Cabellos-Aparicio, A. (2022) · Computer Communications · doi:10.1016/j.comcom.2022.09.029 · Cited by 290
Hybrid SDN evolution: A comprehensive survey of the state-of-the-art
Khorsandroo, S., Sánchez, A. G., Tosun, A. S., Arco, J., & Doriguzzi-Corin, R. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.107981 · Cited by 111
“During this period of time, which is referred to as routing convergence time [144], there is no guarantee on when and in what order the routers receive messages about new network states.”
BackgroundLossless migrations of link-state IGPs
Vanbever, L., Vissicchio, S., Pelsser, C., Francois, P., & Bonaventure, O. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2190767 · Cited by 46
Self-citation
Metadata
- Authors
- Francois, P., Filsfils, C., Evans, J., & Bonaventure, O.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2005-07
- Volume
- 35
- Issue
- 3
- Pages
- 35-44
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2009038171
- Cited by
- 288
- References
- 7
- FWCI
- 20.86
- 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.