ACM Home Page
Please provide us with feedback. Feedback
QDSL: a queuing model for systems with differential service levels
Full text PdfPdf (490 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
Annapolis, MD, USA
SESSION: Systems table of contents
Pages 289-300  
Year of Publication: 2008
ISBN:978-1-60558-005-0
Also published in ...
Authors
Shiva Chaitanya  Pennsylvania State University, University Park, PA, USA
Bhuvan Urgaonkar  Pennsylvania State University, University Park, PA, USA
Anand Sivasubramaniam  Pennsylvania State University, University Park, PA, USA
Sponsors
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 118,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1375457.1375490
What is a DOI?

ABSTRACT

A feature exhibited by many modern computing systems is their ability to improve the quality of output they generate for a given input by spending more computing resources on processing it. Often this improvement comes at the price of degraded performance in the form of reduced throughput or increased response time. We formulate QDSL, a class of constrained optimization problems defined in the context of a queueing server equipped with multiple levels of service. Solutions to QDSL provide rules for dynamically varying the service level to achieve desired trade-offs between output quality and performance. Our approach involves reducing restricted versions of such systems to Markov Decision Processes. We find two variants of such systems worth studying: (i) VarSL, in which a single request may be serviced using a combination of multiple levels during its lifetime and (ii) FixSL in which the service level may not change during the lifetime of a request. Our modeling indicates that optimal service level selection policies in these systems correspond to very simple rules that can be implemented very efficiently in realistic, online systems. We find our policies to be useful in two response-time-sensitive real-world systems: (i) qSecStore, an iSCSI-based secure storage system that has access to multiple encryption functions, and (ii) qPowServer, a server with DVFS-capable processor. As a representative result, in an instance of qSecStore serving disk requests derived from the well-regarded TPC-H traces, we are able to improve the fraction of requests using more reliable encryption functions by 40-60%, while meeting performance targets. In a simulation of qPowServer employing realistic DVFS parameters, we are able to improve response times significantly while only violating specified server-wide power budgets by less than 5W.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Keshav A. Demers and S. Shenker. Analysis and simulation of a fair queuing algorithm. In Journal of Internetworking Research and Experience, 1990.
 
2
F. Bellosa. Process cruise control: Throttling memory access in a soft real-time environment. In Technical Report TR-14-97-02, Univ of Erlangen-Nuernberg, IMMD IV, 1997.
 
3
N. Bhatti and R. Friedrich. Web Server Support for Tiered Services. In IEEE Network, 1999.
 
4
5
 
6
D. Chen and P. K. Varshney. QoS support in wireless sensor networks: A survey. In Proceedings of the International Conference on Wireless
 
7
J. Chuang and M. Sirbu. Distributed Network Storage with Quality-Of-Service Gaurantees. In Journal of Network and Computer Applications, 2000.
 
8
Thomas B. Crabill. Optimal Control of a Service Facility with Variable Exponential Service Times and Constant Arrival Rate. In Management Science, May 1972.
 
9
CSIM. http://www.mesquite.com/.
 
10
 
11
Ejasent. Utility Computing White Paper. November 2001.
 
12
D. McNamee et al. Control challenges in multi-level adaptive video streaming. In Proceedings of 39th IEEE Conference on Decision and Control, 2000.
13
 
14
Y. Bernet et al. A Framework for differentiated services. In Internet draft: draft-ietf-diffserv-framework-02.txt, 1999.
 
15
 
16
E.A Feinberg. Optimal control of average reward constrained continuous-time finite markov decision processes. In Proceedings of the 41st IEEE Conference on Decision and Control, 2002.
 
17
 
18
 
19
R A Howard. Dynamic probabilistic systems. vol. ii: Semi-markov and decision processes. In Series in Decision and Control, 1971.
 
20
 
21
F. P. Kelly. Charging and Rate Control for Elastic Traffic. In European Transactions on Telecommunications, 1997.
 
22
L. Kleinrock. Queueing Systems, Volume 1: Theory. 1975.
 
23
 
24
K. Li and S. Jamin. A Measurement-based Admission Controlled Web Server. In Proceedings of IEEE INFOCOM, 2000.
25
 
26
 
27
E. Elnozahy T. Keller M. Kistler C. Lefurgy R. Rajamony F. Rawson P. Bohrer, D. Cohn and E. Hensbergen. Energy conservation for servers. In Proceedings of the IEEE Workshop on Power Management for Real-Time and Embedded Systems, 2001.
 
28
29
 
30
 
31
O. Rose. Estimation of the hurst parameter of long-range dependent time series. 1996.
 
32
V. Rykov and D. Efrosinin. Numerical Analysis of Optimal Control Policies for Queueing Systems with Heterogeneous Servers. In Kalashnikov Memorial Seminar, 2002.
33
 
34
Linn I. Sennott. Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs. In Operations Research, volume 37, 1989.
 
35
W. Smith. Tpc-w: Benchmarking an ecommerce solution.
 
36
Sychron. Sychron Enterprise Manager. 2001.
 
37
TPC-H. http://www.tpc.org/tpch.
 
38
 
39
C. Wang and W. A. Wulf. Towards a framework for security measurement. In Proceedings of the National Information Systems Security Conference, 1997.
 
40
Richard Weber and Shaler Stidham. Optimal Control of Service Rates in Networks of Queues. In Advances in Applied Probability, volume 19, 1987.
 
41
Charles P. Wright, Michael C. Martino, and Erez Zadok. Ncryptfs: A secure and convenient cryptographic file system. In Proceedings of the USENIX 2003 Annual Technical Conference, 2003.
 
42
 
43
Shlomo Zilberstein. Using anytime algorithms in intelligent systems. In American Association for Artificial Intelligence, 1996.


Collaborative Colleagues:
Shiva Chaitanya: colleagues
Bhuvan Urgaonkar: colleagues
Anand Sivasubramaniam: colleagues