Efficiently Managing Advance Reservations Using Lists of Free Blocks

Abstract

Advance reservation was identified as a key technology to enable guaranteed Quality of Service and co-allocation in the Grid. Nonetheless, most Grid and local resource management systems still use the queuing approach because of the additional complexity introduced by advance reservation. A planning based resource management system has to keep track of the reservations in the future and needs a good overview on the available capacity during the negotiation of incoming reservations. For advance reservation, the resource management problem becomes a two dimensional problem. In this paper different data structures are investigated and discussed in order to fit to planning based resource management. As a result the benefits of using lists of resource allocation or free blocks are exposed. This general idea widely used to manage continuous resources is extended to cover not only the resource dimension but also the time dimension. The list of blocks approach is evaluated in a Grid level and a resource level resource management system. The extensive simulations showed a better runtime and higher reservation success rate compared with the currently favored approach of a slotted time.

An Advance Reservation System to Improve Network Resource Utilization in Software-Defined Networks

“…Nonetheless, although the utilization of dynamic time slots may solve the aforementioned problems, it results in more complex data structures. Schneider et al report this issue in [26] and propose using a list of free blocks to support dynamic time slots. Using hierarchical data structures presents some benefits.…”