Routing and resource optimization in service overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Wireless Communications
Evaluation of QoS-compliant overlays under denial of service attacks
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
CoMaP: a cooperative overlay-based mashup platform
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
A node placement heuristic to encourage resource sharing in mobile computing
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
The K-observer problem in computer networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Journal of Parallel and Distributed Computing
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Sharing hardware resources in heterogeneous computer-supported collaboration scenarios
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
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.