Providing quality of service guarantees have become a critical issue during the rapid expansion of the e-Commerce area. We consider the problem of finding the optimal capacity allocation in a clusteredWeb system environment so as to minimize the cost while providing the end-to-end performance guarantees. In particular, we consider constraints on both the average and the tail distribution of the end-to-end response times. We formulate the problem as a nonlinear program to minimize a convex separable function of the capacity assignment vector. We show that under the mean response time guarantees alone, the solution has a nice geometric interpretation. Various methods to solve the problem are presented in detail. For the problem with tail distribution guarantees, we develop an approximation method to solve the problem.We also derive bounds and show that the solution is asymptotically optimal when the service requirement becomes stringent. Numerical results are presented to further demonstrate the robustness of our solutions under data uncertainty.
By: Wuqin Lin; Zhen Liu; Cathy H. Xia; Li Zhang
Published in: RC23664 in 2005
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .