Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ardaiz, O., Freitag, F., Navarro, L.: Improving the Service Time of Clients using Server Redirection (2001)
Cisco Distributed Director, Cisco Content Routing Protocols, white paper (2000)
Cardellini, V., Colajanni, M., Yu, P.S.: Geographic Load Balancing for Scalable Distributed Web Systems. In: Proc. of 8th MASCOTS (2000)
Carter, R.: Performance Measurement and Prediction in Packet-Switched Networks: Techniques and Applications, Ph.D. thesis (1997)
Chen, M., Mao, W.: Anycast By DNS Over Pure IPv6 Network, Department of Electrical Engineering and Computer Science, University of California, Berkeley (2001)
Crovella, M., Carter, R.: Dynamic Server Selection Using Bandwidth Probing in Wide-Area Networks. In: Proceedings of IEEE INFOCOM (1997)
Dilley, J., Maggs, B.: Globally Distributed Content Delivery. IEEE Internet Computing 6(5) (2002)
Fei, Z., Ammar, M., Zegura, E.: Multicast Server Selection: Problems, Complexity and Solutions. IEEE Journal on Selected Areas in Communication, Special Issue on Internet Proxy Servers 20(7), 1399–1413 (2002)
Guyton, J., Schwartz, M.: Locating nearby copies of replicated internet servers. In: Proceeding of ACM SIGCOMM 1995 (1995)
Gwertzman, J., Seltzer, M.: The case for geographical push cashing. In: Proceeding of the 5th Workshop on Hot ZTopic in Operating Systems (1995)
Pierre, G., van Steen, M., Tannenbaum, A.S.: Dynamically selecting optimal distribution strategies for Web documents. IEEE Transactions on Computers 6(51), 637–651 (2002)
Mathworld, http://mathworld.wolfram.com/LeastSquaresFitting.html
Rabinovich, M., Aggarwal, A.: Radar: A Salable Architecture for a Global Web Hosting Service. WWW8/Computer Networks 31(11-16), 1545–1561 (1999)
Sayal, M., Breitbart, Y., Scheuermann, P., Vingralek, R.: Selection algorithms for replicated web servers. In: Proceeding of the Workshop on Internet Server Performance (1998)
Radware, Web Server Director, white paper (2002)
Vingralek, R., et al.: Web++: A System For Fast and Reliable Web Service. In: Proceedings of the USENIX Annual Technical Conference, Sydney, Australia, June 1999, pp. 171–184 (1999)
Zegura, E., Ammar, M., Fei, Z., Bhattacharjee, S.: Application-layer anycasting: a server selection architecture and use in a replicated web service. IEEE/ACM Transactions on Networking 8(4), 455–466 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferdean, C., Makpangou, M. (2005). Exploiting Application Workload Characteristics to Accurately Estimate Replica Server Response Time. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575771_50
Download citation
DOI: https://doi.org/10.1007/11575771_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29736-9
Online ISBN: 978-3-540-32116-3
eBook Packages: Computer ScienceComputer Science (R0)