Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths

Details Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths

2008-06-24

arxiv.org/abs/0806.3827v1

Proceedings of the IEEE Romania International Conference "Communications", 2008., Bucharest : Roumanie (2008)

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, I present a novel, heuristic, algorithm for scheduling files with divisible sizes on multiple disjoint paths, in order to maximize the total profit (the problem is equivalent to the multiple knapsack problem with divisible item sizes). I then consider a cost optimization problem for transferring a sequence of identical files, subject to time constraints imposed by the data transfer providers. For the online case I propose an algorithmic framework based on the block partitioning method, which can speed up the process of resource allocation and reservation.

Affiliated with

Also associated with

No associations

Rating

Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97294