High multiplicity scheduling of file transfers with divisible sizes on multiple classes of paths

Abstract

Distributed applications and services requiring the transfer of large amounts of data have been developed and deployed world wide. The best effort model of the Internet cannot provide these applications with the so much needed quality of service guarantees, making necessary the development of file transfer scheduling techniques, which optimize the usage of network resources. In this paper we consider the high multiplicity scheduling of file transfers over multiple classes of paths with the objective of minimizing the makespan, when the files have divisible sizes. We also consider another objective, that of maximizing the total profit, in the context of some special types of mutual exclusion constraints (tree and clique constraint graphs).

Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

“…Then, we can use the block partitioning framework introduced in [9]. For the first bandwidth model, an update operation will consists of a range set operation (setting all the time slots in a range to the same value) and a query operation will consists of a range maximum sum segment query.…”

“…With the framework in [9], we obtain a time complexity of O(k+m/k) for each query and update (i.e. O(sqrt(m)) for k=sqrt(m)).…”

“…We also use a multiplication operator mop, which estimates the effects of an update on a range of cells. With this framework we can support many types of pairs of updates and queries, like all those mentioned in [9] and [10] (e.g. uFunc(x,y)=qFunc(x,y)=(x+y) or uFunc(x,y)=qFunc(x,y)=((x+y) modulo M)).…”

“…The update and query functions, as well as the multiplication operator, are shown below. All of these (range update, range query) combinations are also supported by the block partitioning framework in [9] (although not explicitly stated in the paper). With the extended segment tree framework, we can support every update and query operation on a range of time slots in O(log(m)) time.…”

Constrained Content Distribution and Communication Scheduling for Several Restricted Classes of Graphs

“…Efficient algorithms for the maximum reliability k-hop multicast strategy in directed trees, as well as exact, exponential algorithms for minimum time multicast in directed graphs have been presented in [4]. File transfer scheduling problems considering tree and clique mutual exclusion graphs were studied in [5].…”