Design of a web site for guaranteed delay and blocking probability bounds

摘要

A new mathematical programming model is proposed for minimizing the cost of design of a Web site by optimally determining the number of servers and buffers when a performance guarantee in terms of the average waiting time and loss probability is to be provided to users. The Web site is modeled as an M/G/c/N queuing system where requests for connections represent arriving customers and the browsing of Web sites represents service received by customers. Numerical experiments are conducted with different choices of problem parameters and the optimal design cost, and optimal number of servers and buffers are obtained for these cases.