Skip to main content
Log in

QoS and Contention-Aware Multi-Resource Reservation

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile, techniques have been available for the reservation and enforcement of various types of resources. Therefore, there is a need to create an integrated framework for coordinated multi-resource reservation. One challenge in creating such a framework is the complex relation between the end-to-end application-level QoS and the corresponding end-to-end resource requirement. Furthermore, the goals of (1) providing the best end-to-end QoS for each distributed service session and (2) increasing the overall reservation success rate of all service sessions are in conflict with each other. In this paper, we present a QoS and contention-aware framework of end-to-end multi-resource reservation for distributed services. The framework assumes a reservation-enabled environment, where each type of resource can be reserved. The framework consists of (1) a component-based QoS-Resource Model, (2) a runtime system architecture for coordinated reservation, and (3) a runtime algorithm for the computation of end-to-end multi-resource reservation plans. The algorithm provides a solution to alleviating the conflict between the QoS of an individual service session and the success rate of all service sessions. More specifically, for each service session, the algorithm computes an end-to-end reservation plan, such that it guarantees the highest possible end-to-end QoS level under the current end-to-end resource availability, and requires the lowest percentage of bottleneck resource(s) among all feasible reservation plans. Our simulation results show excellent performance of this algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Chu and K. Nahrstedt, CPU service classes for multimedia applications, in: Proc. IEEE Int. Conf. on Multimedia Computing and Systems (ICMCS’ 99) (1999).

  2. P. Goyal, X. Guo and H. Vin, A hierarchical CPU scheduler for multimedia operating systems, in: Proc. USENIX Operating System Design and Implementation (OSDI’ 96) (1996) pp. 107–122.

  3. L. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala, RSV: a resource reservation protocol, IEEE Network (September 1993).

  4. J. Bennett and H. Zhang, Hierarchical packet fair queuing algorithms, IEEE/ACM Transactions on Networking 5(5) (1997) 675–689.

    Google Scholar 

  5. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queuing algorithm, Journal of Internetworking Research and Experience 1(1) (1990) 3–26.

    Google Scholar 

  6. P. Shenoy and H. Vin, Cello: A disk scheduling framework for next generation operating systems, in: Proc. ACM SIGMETRICS’ 98 (1998) pp. 44–55.

  7. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, 1990).

  8. I. Foster and C. Kesselman, Globus: A metacomputing infrastructure toolkit, Journal of Supercomputing Applications 11(2) (1997) 115–128.

    Google Scholar 

  9. M. Litzkow, M. Livny and M. Mutka, Condor - a hunter of idle workstations, in: Proc. IEEE Int. Conf. on Distributed Computing Systems (ICDCS’ 88) (1988) pp. 104–111.

  10. A. Grimshaw, A. Ferrari, F. Knabe and M. Humphrey, Legion: An operating system for wide-area computing, IEEE Computer 32(5) (1999) 29–37.

    Google Scholar 

  11. K. Czajkowski, I. Foster and C. Kesselman, Resource co-allocation in Computational Grids, in: Proc. 8th IEEE Int. Symposium on High Performance Distributed Computing (HPDC’ 99) (1999).

  12. I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt and A. Roy, A distributed resource management architecture that supports advance reservation and co-allocation, in: Proc. IEEE/IFIP Int. Workshop on QoS (IWQoS’ 99) (1999).

  13. C. Lee, J. Lehoczky, D. Siewiorek, R. Rajkumar and J. Hansen, A scalable solution to the multi-resource QoS problem, in: Proc. IEEE Real-Time Systems Symposium (RTSS’ 99) (1999).

  14. C. Lee, J. Lehoczky, R. Rajkumar and D. Siewiorek, On quality of service optimization with discrete QoS options, in: Proc. IEEE Real-Time Technology and Applications Symposium (RTAS’ 99) (1999).

  15. D. Hull, M. Shankar, K. Nahrstedt and J. Liu, An end-to-end QoS model and management architecture, in: Proc. IEEE Workshop on Middleware for Distributed Real-Time Systems and Services (1997) pp. 82–89.

  16. M. Shankar, M. DeMiguel and J. Liu, An end-to-end QoS management architecture, in: Proc. IEEE Real-Time Technology and Applications Symposium (RTAS’ 99) (1999).

  17. P. Chandra, A. Fisher, C. Kosak, T. Ng, P. Steenkiste, E. Takahashi and H. Zhang, Darwin: customizable resource management for valueadded network services, in: Proc. IEEE Int. Conf. on Network Protocols (ICNP’ 98) (1998).

  18. P. Chandra, A. Fisher and P. Steenkiste, A signaling protocol for structured resource allocation, in: Proc. IEEE INFOCOM’ 99 (1999).

  19. K. Nahrstedt, H. Chu and S. Narayan, QoS-aware resource management for distributed multimedia applications, Journal of High Speed Networks (Special Issue on Multimedia Networking) 8(3–4) (1998) 227–255.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, D., Nahrstedt, K. & Wichadakul, D. QoS and Contention-Aware Multi-Resource Reservation. Cluster Computing 4, 95–107 (2001). https://doi.org/10.1023/A:1011408729750

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011408729750

Navigation