Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Abstract
Providing up-to-date information to users is an important data management problem for a heterogeneous networking environment, where each data storage location and intermediate machine may have specific data available, storage limitations, and communication links available. Sites in the network request data items and each request has an associated deadline and priority. This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. Three multiple-source shortest-path algorithm based heuristics for finding a near-optimal schedule of the communication steps for staging the data are presented. Each heuristic can be used with each of four cost criteria developed. Thus, twelve implementations are examined. The performance of the proposed heuristics are evaluated and compared by simulations. Many of the proposed heuristics perform very well with respect to a loose upper bound metric.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1998
- Accession Number
- ADA355458
Entities
People
- H. J. Siegel
- Michael Jurczyk
- Min Tan
- Mitchell D. Theys
- Noah B. Beck
Organizations
- Purdue University