Dummynet: a simple approach to the evaluation of network protocols
ACM SIGCOMM Computer Communication Review
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Predicting the Performance of Wide Area Data Transfers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Reliable Blast UDP: Predictable High Performance Bulk Data Transfer
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Checkpointing and Its Applications
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Experiences in Design and Implementation of a High Performance Transport Protocol
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
GTP: group transport protocol for lambda-Grids
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
RAPID: an end-system aware protocol for intelligent data transfer over lambda grids
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Ultrascience net: network testbed for large-scale science applications
IEEE Communications Magazine
Online job provisioning for large scale science experiments over an optical grid infrastructure
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Provisioning of deadline-driven requests with flexible transmission rates in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Joint computing and network resource scheduling in a lambda grid network
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
In-advance path reservation for file transfers in e-science applications
The Journal of Supercomputing
Modeling throughput sampling size for a cloud-hosted data scheduling and optimization service
Future Generation Computer Systems
| Hi-index | 0.00 |
In many e-science applications, there exists an important need to aggregate information from data repositories distributed around the world. In an effort to better link these resources in a unified manner, many lambda-grid networks, which provide end-to-end dedicated optical circuit-switched connections, have been investigated. In this context, we consider the problem of aggregating files from distributed databases at a (grid) computing node over a lambda grid. The challenge is (i) to identify routes (i.e., circuits) in the lambda-grid network along which files should be transmitted and (ii) to schedule the transfers of these files over their respective circuits. To address this challenge, we propose a hybrid approach that combines off-line and on-line scheduling. We define the Time-Path Scheduling Problem (TPSP) for off-line scheduling. We prove that TPSP is NP-complete, develop a Mixed Integer Linear Program (MILP) formulation for TPSP, and then propose a greedy approach to solve TPSP because the MILP does not scale well. We compare the erformance of the greedy approach on a few representative lambda-grid network topologies. One key input to the off-line schedule is the file transfer time. Due to dynamics at the receiving end host which is hard to model precisely, the actual file transfer time may vary. We first propose a model for the estimating the file transfer time. Then, we propose on-line reconfiguration algorithms, so that, as files are transferred, the off-line schedule may be modified on-line depending on the amount of time that it actually took to transfer the file. This helps to reduce the total time to transfer all the files, which is an important metric. To demonstrate the effectiveness of our approach, we present results on an emulated lambda-grid network testbed.