Bounded-Latency Content Distribution: Feasibility and Evaluation
IEEE Transactions on Computers
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
On the Complexity of Optimal Hotlink Assignment
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Self-organized service placement in ambient intelligence environments
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Constant factor approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Placement of web proxy servers is an important avenueto save network bandwidth, alleviate server load, and reducelatency experienced by users. The general problem ofweb proxy placement is to compute the optimal locationsfor placing k web proxies in a network such that the objectiveconcerned is minimized or maximized. In this paper, weaddress this problem for tree networks and propose a novelmathematical model for it. In our model, we consider maximizingthe overall access gain as our objective and formulatethis problem as an optimization problem. The optimalplacement is obtained using a computationally efficient dynamicprogramming-based algorithm. Applying our mathematicalmodel, we also present a solution to web proxyplacement for autonomous systems (ASes), as a natural extensionof the solution for tree networks. Our algorithmshave been implemented. The simulation results show thatour model significantly outperforms the random placementmodel.