Extended partial path heuristic for real-time staging in oversubscribed networks

Abstract

In this paper we propose the use of the PPH as a base for an offline schedule method to detect unsatisfiable requests in a staging system. This property allows a reduction in the overhead of transferring data-items with deadlines in a real-time environment, through paths rearrangement. The EPP heuristic allows early detection of eventually, non-satisfied, requests based on their urgencies. Early detection and dropping of these requests also reduces the latencies of the satisfied requests. We show analytically and experimentally that the performance of the EPP heuristic is at least equivalent to the previous PPH proposed for data-staging problem in real-time environments.