Abstract-As the amount of transferred data increases worldwide, network data transfers may exhibit poor performance due to resource usage conflicts, even when enough resources are available (at a different place or at another time). Thus, efficient resource management and intelligent scheduling of the data transfers are required. These problems are, however, quite difficult to solve, both from a theoretical and a practical perspective. In this paper we propose several novel algorithmic techniques for the real-time scheduling of data transfers when the network has a tree topology. Some of these techniques can be later implemented in a (re)configurable data transfer scheduling framework.
In REF , the authors present a range of algorithmic techniques for scheduling data transfers in networks with tree topologies.
Towards a Real-Time Scheduling Framework for Data Transfers in Tree Networks
2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Computer Science