By Topic

Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

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

2 Author(s)
Andreica, M.I. ; Comput. Sci. Dept., Politeh. Univ. of Bucharest, Bucharest ; Tapus, N.

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.

Published in:

Parallel and Distributed Computing, 2008. ISPDC '08. International Symposium on

Date of Conference:

1-5 July 2008