QoS for internet services: done right

In this paper we argue that the best approach to providing Quality of Service (QoS) guarantees to current Internet services is to use admission control and traffic shaping techniques at the entrance points of Internet hosting sites. We propose a black-box approach that does not require knowledge, instrumentation, or modification of the system (hardware and software) that implements the services provided by the site.We maintain that such a non-intrusive QoS solution achieves better resource utilization, has lower cost, and is more flexible than the current approaches of physical partitioning and hardware over-provisioning. Furthermore, we contend that our solution is easier to deploy, less complex to implement, and easier to maintain than more intrusive approaches which embed the QoS logic into the operating system, distributed middleware, or application code. We demonstrate empirically that despite being decoupled from the internal mechanisms implementing the site, a black-box approach provides effective response times and capacity guarantees.

[1]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[2]  Chenyang Lu,et al.  ControlWare: a middleware architecture for feedback control of software performance , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[3]  Erich M. Nahum,et al.  A method for transparent admission control and request scheduling in e-commerce web sites , 2004, WWW '04.

[4]  David E. Culler,et al.  SEDA: an architecture for well-conditioned, scalable internet services , 2001, SOSP.

[5]  Willy Zwaenepoel,et al.  Cluster reserves: a mechanism for resource management in cluster-based network servers , 2000, SIGMETRICS '00.

[6]  Tao Yang,et al.  Demand-driven service differentiation in cluster-based network servers , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Nina Bhatti,et al.  Web server support for tiered services , 1999, IEEE Netw..

[8]  Banu Özden,et al.  Fair queuing for aggregated multiple links , 2001, SIGCOMM.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[12]  Abraham Silberschatz,et al.  Resource Management for QoS in Eclipse/BSD , 1999 .

[13]  Douglas M. Freimuth,et al.  Kernel Mechanisms for Service Differentiation in Overloaded Web Servers , 2001, USENIX Annual Technical Conference, General Track.

[14]  Peter Druschel,et al.  Resource containers: a new facility for resource management in server systems , 1999, OSDI '99.

[15]  Tao Yang,et al.  Integrated resource management for cluster-based Internet services , 2002, OSDI.