Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An admission control scheme for predictable server response time for web accesses
Proceedings of the 10th international conference on World Wide Web
Adaptive proportional delay differentiated services: characterization and performance evaluation
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach
IEEE Transactions on Parallel and Distributed Systems
Session-Based Admission Control: A Mechanism for Peak Load Management of Commercial Web Sites
IEEE Transactions on Computers
Performance Evaluation of Service Differentiating Internet Servers
IEEE Transactions on Computers
Ensuring Latency Targets in Multiclass Web Servers
IEEE Transactions on Parallel and Distributed Systems
Characterization and performance evaluation for proportional delay differentiated services
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Dynamic Class Selection: From Relative Differentiation to Absolute QoS
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Robust Processing Rate Allocation for Proportional Slowdown Differentiation on Internet Servers
IEEE Transactions on Computers
An Analytical Approach to Providing Controllable Differentiated Quality of Service in Web Servers
IEEE Transactions on Parallel and Distributed Systems
Addressing Sporadic Contention on Shared Computing Clusters
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Resource Allocation for Session-Based Two-Dimensional Service Differentiation on e-Commerce Servers
IEEE Transactions on Parallel and Distributed Systems
Fuzzy control for guaranteeing absolute delays in web servers
International Journal of High Performance Computing and Networking
Resource allocation optimization for quantitative service differentiation on server clusters
Journal of Parallel and Distributed Computing
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Deterministic Processing of WWW Pages by the Web Service
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Quantitative service differentiation: a square-root proportional model
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Class-based latency assurances for web servers
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Enhancing web server relative delay services by an integrated SA-fuzzy logic controller
International Journal of Web Engineering and Technology
Hi-index | 0.00 |
Abstract--We consider a Web server that can provide differentiated services to clients with different quality of service (QoS) requirements. The Web server can provide N \geq 1 classes of proportional-delay differentiated services (PDDS) to heterogeneous clients. An operator can specify fixed performance spacings between classes, namely, r_{i,i+1} 1, for i=1,\ldots,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 loading and this simplifies many pricing issues. In addition, each client can specify a maximum average waiting time requirement to be guaranteed by the PDDS-enabled Web server. We show that, in general, the problem of assigning clients to service classes in order to optimize system efficacy is NP-complete. 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 admitted client. We also consider how to perform end-point dynamic adaptation such that admitted clients can submit requests at a lower class and further reduce their usage costs 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 distributed and is based on a noncooperative game technique. We carry out experiments to illustrate the effectiveness of these algorithms under different utility functions and traffic arrival patterns (e.g., Poisson, MMPP, and Pareto). We report extensive experimental results to illustrate the effectiveness of our proposed algorithms.