The DOI matches its Crossref record.
The synchronization of periodic routing messages
Abstract
The paper considers a network with many apparently-independent periodic processes and discusses one method by which these processes can inadvertently become synchronized. In particular, the authors study the synchronization of periodic routing messages, and offer guidelines on how to avoid inadvertent synchronization. Using simulations and analysis, they study the process of synchronization and show that the transition from unsynchronized to synchronized traffic is not one of gradual degradation but is instead a very abrupt 'phase transition': in general, the addition of a single router will convert a completely unsynchronized traffic stream into a completely synchronized one. They show that synchronization can be avoided by the addition of randomization to the traffic sources and quantify how much randomization is necessary. In addition, they argue that the inadvertent synchronization of periodic processes is likely to become an increasing problem in computer networks.>
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
Cited by
GPSR: greedy perimeter stateless routing for wireless networks
Karp, B., & Kung, H. T. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345953 · Cited by 7,050
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
Self-citationRTP: A Transport Protocol for Real-Time Applications
Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (2003) · doi:10.17487/rfc3550 · Cited by 5,776
Self-citationWide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Self-citationAlizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851192 · Cited by 1,877
Complex networks: Small-world, scale-free and beyond
Wang, X. F., & Chen, G. (2003) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2003.1228503 · Cited by 1,348
Synchronization in scale-free dynamical networks: robustness and fragility
Wang, X. F., & Chen, G. (2002) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.974874 · Cited by 1,127
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Controlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
Self-citationEnd-to-end routing behavior in the Internet
Paxson, V. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649563 · Cited by 698
Empirically derived analytic models of wide-area TCP connections
Paxson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.330413 · Cited by 581
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION
WANG, X. F. (2002) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127402004802 · Cited by 565
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1851275.1851192 · Cited by 548
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
Deadline-aware datacenter tcp (D2TCP)
Vamanan, B., Hasan, J., & Vijaykumar, T. N. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342388 · Cited by 473
Labovitz, C., Malan, G. R., & Jahanian, F. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.731185 · Cited by 359
Wide-area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190338 · Cited by 281
Self-citationAdaptive web caching: towards a new global caching architecture
Michel, S., Nguyen, K., Rosenstein, A., Zhang, L., Floyd, S., & Jacobson, V. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00246-3 · Cited by 276
Self-citationTrajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
Metadata
- Authors
- Floyd, S., & Jacobson, V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1994-04
- Volume
- 2
- Issue
- 2
- Pages
- 122-136
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2050353731
- Cited by
- 243
- References
- 0
- FWCI
- 15.07
- Type
- journal article
- Language
- en
- Open access
- closed
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.