Admission control and dynamic adaptation for a proportional-delay diffserv-enabled web server

We consider a web server that can provide differentiated services to clients with different QoS requirements. The web server can provide N > 1 classes of service. Rather than using a strict priority policy , which may lead to request starvation, the web server provides a proportional-delay differentiated service (PDDS) to heterogeneous clients. An operator for the web server can specify "fixed" performance spacings between classes, namely, r_i,i+1 > 1, for i = 1,…,N - 1. Requests in class i + 1 are guaranteed to have an average waiting time which is 1/r_i,i+1 of the average waiting time of class i requests. With PDDS, we can provide consistent performance spacings over a wide range of system loadings. In addition, each client can specify a maximum average waiting time requirement to be guaranteed by the web server. We propose two efficient admission control algorithms so that a web server can provide the QoS guarantees and, at the same time, classify each client to its "lowest" admissible class, resulting in lowest usage cost for the client. We also consider how to perform end-point dynamic adaptation such that clients can submit requests at lower class and further reduce their usage cost, without violating their QoS requirements. We propose two dynamic adaptation algorithms: one is server-based and the other is client-based. The client-based adaptation is based on a non-cooperative game technique. We report diverse experimental results to illustrate the effectiveness of these algorithms.