QoS and contention-aware multi-resource reservation

Abstract

Presents a QoS and contention-aware multi-resource reservation algorithm to provide end-to-end QoS guarantees for distributed and component-based services. We study a reservation-enabled environment, where each type of resource can be reserved. However, the goals of: (1) achieving the best end-to-end QoS for each client, and (2) increasing the overall success rate of resource reservations for different service requests, are in conflict with each other. Our algorithm provides a solution to alleviate this conflict. For each service request, the algorithm computes an end-to-end multi-resource reservation plan which (1) achieves the highest level of end-to-end QoS under the constraint of current resource availability, and (2) tends to incur low bottleneck resource contention among all feasible reservation plans for this service request. Our initial simulation results show the excellent performance of this algorithm.