A linked-list data structure for advance reservation admission control

Abstract

With the development of multimedia and grid technologies, more and more distributed applications require guaranteed quality of service and maintain minimum network resource during their running sessions. Thus advance reservation is necessary because it provides a solution for the need of reserving network resources for future use. Many kinds of data structures were proposed to perform fast and efficient admission control. Most of them are based on the time-slotted method, which needs to make an appropriate tradeoff between the efficiency and the granularity of the time slots. In this paper, a linked-list data structure is proposed to perform the admission control for advance reservation. Compared with the existing bandwidth tree and time-slotted array, the proposed linked list shows better performance. © Springer-Verlag Berlin Heidelberg 2005.