Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

Distributed applications and services requiring the transfer of large amounts of data have been developed and deployed all around the world. The best effort behavior of the Internet cannot offer to these applications the necessary quality of service (QoS) guarantees, making the development of data transfer scheduling techniques a necessity. In this paper we propose novel methods of efficiently using some well-known data structures (e.g. the segment tree and the block partition), which can be implemented in a resource manager (e.g. grid job scheduler, bandwidth broker) in order to serve quickly large numbers of advance resource reservation and allocation requests.