By Topic

QoS and contention-aware multi-resource reservation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dongyan Xu ; Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA ; Nahrstedt, K. ; Viswanathan, A. ; Wichadakul, D.

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

Published in:

High-Performance Distributed Computing, 2000. Proceedings. The Ninth International Symposium on

Date of Conference: