The synchronization of periodic routing messages
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Dynamic Routing in Telecommunications Networks
Dynamic Routing in Telecommunications Networks
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A routing underlay for overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An analysis of live streaming workloads on the internet
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Can coexisting overlays inadvertently step on each other?
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
DaVinci: dynamically adaptive virtual networks for a customized internet
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Interactions of intelligent route control with TCP congestion control
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Hi-index | 0.00 |
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multiple similar or dissimilar overlay networks could experience race conditions, resulting in oscillations (in both route selection and network load) and cascading reactions. We pinpoint the causes for synchronization and derive an analytic formulation for the synchronization probability of two overlays. Our model indicates that the probability of synchronization is non-negligible across a wide range of parameter settings, thus implying that the ill effects of synchronization should not be ignored. Using the analytical model, we find an upper bound on the duration of traffic oscillations. We also show that the model can be easily extended to include a large number of co-existing overlays. We validate our model through simulations that are designed to capture the transient routing behavior of both the IP- and overlay-layers. We use our model to study the effects of factors such as path diversity (measured in round trip times) and probing aggressiveness on these race conditions. Finally, we discuss the implications of our study on the design of path probing process in overlay networks and examine strategies to reduce the impact of race conditions.