June 25, 2007 to June 27, 2007
Sabyasachi Roy , Purdue University, West Lafayette, IN
Himabindu Pucha , Purdue University, West Lafayette, IN
Zheng Zhang , Purdue University, West Lafayette, IN
Y. Charlie Hu , Purdue University, West Lafayette, IN
Lili Qiu , University of Texas at Austin, Austin, TX
Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under the constraints of deployment costs in terms of hardware, network connectivity and human effort, it is critical to carefully place infrastructure overlay nodes to balance the trade-off between performance and resource constraints. In this paper, we investigate approaches to perform intelligent placement of overlay nodes to facilitate (i) resilient routing and (ii) TCP performance improvement.We formulate objective functions to accurately capture application behavior: reliability and TCP performance, and develop several placement algorithms, which offer a wide range of trade-offs in complexity and required knowledge of the clientserver location and traffic load. Using simulations on synthetic and real Internet topologies, and PlanetLab experiments, we demonstrate the effectiveness of the placement algorithms and objective functions developed, respectively. We conclude that an approach, hybrid of random and greedy approaches, provides the best tradeoff between computational efficiency and accuracy. We also uncover the fundamental challenge in simultaneously optimizing for reliability and TCP performance, and propose a simple unified algorithm to achieve the same.
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. Charlie Hu, Lili Qiu, "Overlay Node Placement: Analysis, Algorithms and Impact on Applications", ICDCS, 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07), 27th International Conference on Distributed Computing Systems (ICDCS '07) 2007, pp. 53, doi:10.1109/ICDCS.2007.127