Abstract:

Admission control algorithm is the core of resource advance reservation mechanisms for distributed computing environments. This paper summarizes the existing flexible reservation admission control algorithms and proposes a novel algorithmadmission control algorithm with transferable reservation in advance. The algorithm can transfer the scalable requests that have been reserved to reserve enough resources for fixed requests, increasing the acceptance probability of fixed requests. Data structure that stores the reservation information acts as an important role in resource reservation. Reasonable data structure can significantly improve the overall performance of admission control. Therefore, this paper further summarizes the existing data structure, including the slot array, the slot segment tree, the tree of resources and the binary search tree. The comparison experiments with three kinds of transferable reservation admission control algorithm show that the transferable reservation in advance algorithm can improve the acceptance rate of fixed requests and the total request accepted rate.

Key words: distributed computing;reservation in advance;admission control algorithm;transferable reservation in advance;scalable reservation