Skip to main content
Article thumbnail
Location of Repository

A Scalable Solution to the Multi-Resource QoS Problem

By Chen Lee, John Lehoczky, Dan Siewiorek, Ragunathan Rajkumar and Jeff Hansen

Abstract

The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple QoS dimensions was studied in [6]. In this paper, we consider the more complex problem of apportioning multiple finite resources to satisfy the QoS needs of multiple applications along multiple QoS dimensions. In other words, each application, such as video-conferencing, needs multiple resources to satisfy its QoS requirements. We evaluate and compare three strategies to solve this provably NP-hard problem. We show that dynamic programming and mixed integer programming compute optimal solutions to this problem but exhibits very high running times. We then adapt the mixed integer programming problem to yield near-optimal results with smaller running times. Finally, we present an approximation algorithm based on a local search technique that is less than 5 % away from the optimal solution but which is more than two orders of magnitude faster. Perhaps more significantly, the local search technique turns out to be very scalable and robust as the number of resources required by each application increases

Topics: QoS management and optimization, QoS index and utility model, QoS tradeoff, resource tradeoff, QoS based resource allocation, multi-media, scalability
Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.1968
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-2.cs.cmu.edu/~hanse... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.