Autonomic network management: some pragmatic considerations
Proceedings of the 2006 SIGCOMM workshop on Internet network management
NIRA: a new inter-domain routing architecture
IEEE/ACM Transactions on Networking (TON)
Race conditions in coexisting overlay networks
IEEE/ACM Transactions on Networking (TON)
Steps toward self-aware networks
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
A survey on the design, applications, and enhancements of application-layer overlay networks
ACM Computing Surveys (CSUR)
Overlay networks and graph theoretic concepts
Network performance engineering
| Hi-index | 0.00 |
By allowing end hosts to make 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 making independent routing decisions could experience race conditions, resulting in oscillations in both route selection and network load. We pinpoint the causes for synchronization in terms of partially overlapping routes and periodic path probing processes 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 validate our model through simulations that are designed to capture the transient routing behavior of both the IP- and overlaylayers. 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 overlay networks and the choice of their path probing parameters.