The Community for Technology Leaders
Green Image
With increasing richness in features such as personalization of content, web applications are becoming increasingly complex and hence compute intensive. Traditional approaches for improving performance of static content web sites have been based on the assumption that static content such as images are network intensive. However, these methods are not applicable to the dynamic content applications which are more compute intensive than static content. This paper proposes a suite of algorithms which jointly optimize the performance of dynamic content applications by reducing the client access times while also minimizing the resource utilization. A server migration algorithm allocates servers on-demand within a cluster such that the client access times are not affected even under sudden overload conditions. Further, a server selection mechanism enables statistical multiplexing of resources across clusters by redirecting requests away from overloaded clusters. We also propose a cluster decision algorithm which decides whether to migrate in additional servers at the local cluster or redirect requests remotely under different workload conditions. Through a combination of analytical modeling, trace-driven simulation over traces from large e-commerce sites and testbed implementation, we explore the performance savings achieved by the proposed algorithms.
Distributed Systems, Client/server, Client/server and multitier systems, Electronic commerce
Edward Knightly, Supranamaya Ranjan, "High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters", IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1186-1200, September 2008, doi:10.1109/TPDS.2007.70810
78 ms
(Ver 3.3 (11022016))