Dynamic Overlay Routing Based on Available Bandwidth Estimation: A Simulation Study

Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, transient outages, or suboptimal paths, by forwarding traffic through one or more intermediate overlay nodes. In this paper, we perform an extensive simulation study to investigate the performance of dynamic overlay routing. In particular, we leverage recent work on available bandwidth (avail-bw) estimation, and focus on overlay routing that selects paths based on avail-bw measurements between adjacent overlay nodes. First, we compare two overlay routing algorithms, reactive and proactive, with shortest-path native routing. We show that reactive routing has significant benefits in terms of throughput and path stability, while proactive routing is better in providing flows with a larger safety margin (“headroom”), and propose a hybrid routing scheme that combines the best features of the previous two algorithms. We then examine the effect of several factors, including network load, traffic variability, link-state staleness, number of overlay hops, measurement errors, and native sharing effects. Some of our results are rather ∗ This work was supported by the NSF CAREER award ANIR-0347374, and by a Georgia Tech Broadband Institute (GTBI) grant. surprising. For instance, we show that a significant measurement error, even up to 100 % of the actual avail-bw value, has a negligible impact on the efficiency of overlay routing.