Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Performance measurement and prediction in packet-switched networks: techniques and applications
Performance measurement and prediction in packet-switched networks: techniques and applications
RaDaR: a scalable architecture for a global Web hosting service
WWW '99 Proceedings of the eighth international conference on World Wide Web
Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
Dynamically Selecting Optimal Distribution Strategies for Web Documents
IEEE Transactions on Computers
Globally Distributed Content Delivery
IEEE Internet Computing
The case for geographical push-caching
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Geographic Load Balancing for Scalable Distributed Web Systems
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Web++: a system for fast and reliable web service
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Multicast server selection: problems, complexity, and solutions
IEEE Journal on Selected Areas in Communications
Soft real-time task response time prediction in dynamic embedded systems
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Hi-index | 0.00 |
Our proposition, presented in this paper, consists in the definition of a function estimating the response time and a method for applying it to different application workloads. The function combines the application demands for various resources (such as the CPU, the disk I/O and the network bandwidth) with the resource capabilities and availabilities on the replica servers. The main benefits of our approach include: the simplicity and the transparency, from the perspective of the clients, who don’t have to specify themselves the resource requirements, the estimation accuracy, by considering the application real needs and the current degree of resource usage, determined by concurrent applications and the flexibility, with respect to the precision with which the resource-concerned parameters are specified. The experiments we conducted show two positive results. Firstly, our estimator provides a good approximation of the real response time obtained by measurements. Secondly, the ordering of the servers according to our estimation function values, matches with high accuracy the ordering determined by the real response times.