Two fast implementations of the “minimal standard” random number generator
Communications of the ACM
Experimental assessment of end-to-end behavior on internet
Experimental assessment of end-to-end behavior on internet
ACM SIGCOMM Computer Communication Review
An adaptive congestion control scheme for real-time packet video transport
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
Empirically derived analytic models of wide-area TCP connections
IEEE/ACM Transactions on Networking (TON)
Wide-area traffic: the failure of Poisson modeling
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An adaptive congestion control scheme for real time packet video transport
IEEE/ACM Transactions on Networking (TON)
Packet network simulation: speedup and accuracy versus timing granularity
IEEE/ACM Transactions on Networking (TON)
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
ACM SIGCOMM Computer Communication Review
Scalable hierarchical coarse-grained timers
ACM SIGOPS Operating Systems Review
Scalable Multimedia Communication Using IP Multicast and Lightweight Sessions
IEEE Internet Computing
Cluster Load Balancing for Fine-Grain Network Services
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Emergent (mis)behavior vs. complex software systems
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
System issues in implementing high speed distributed parallel storage systems
HSNS'94 Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium
Race conditions in coexisting overlay networks
IEEE/ACM Transactions on Networking (TON)
Congestion-only charging: a novel pricing mechanism for use in differentiated services networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Advanced quality-of-service signaling for IP multicast
Proceedings of the Nineteenth International Workshop on Quality of Service
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
An integrated approach for the validation of emergence in component-based simulation models
Proceedings of the Winter Simulation Conference
Post-mortem analysis of emergent behavior in complex simulation models
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Hi-index | 0.00 |
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, we study the synchronization of periodic routing messages. We give examples of the harmful effect of these synchronized updates on other network traffic, and offer guidelines on how to avoid inadvertent synchronization. Using simulations and analysis, we 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. We show that synchronization can be avoided by the addition of randomization to the traffic sources and quantify how much randomization is necessary. In addition, we argue that the inadvertent synchronization of periodic processes is likely to become an increasing problem in computer networks.