Enabling the co-allocation of grid data transfers

Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly replicated environments, a particular dataset can reside at multiple locations and can thus be downloaded from any one of them. Since datasets of interest are significantly large...

Full description

Saved in:
Bibliographic Details
Main Author: Sudharshan Vazhkudai
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Distributed computing
Fluctuations
Internet
Load management
Network servers
Peer to peer computing
Protocols
Testing
Web server
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly replicated environments, a particular dataset can reside at multiple locations and can thus be downloaded from any one of them. Since datasets of interest are significantly large in size, improving download speeds either by server selection or by co-allocation can offer substantial benefits. We present an architecture for co-allocating grid data transfers across multiple connections, enabling the parallel download of datasets from multiple servers. We have developed several co-allocation strategies comprising of simple brute-force, history-based and dynamic load balancing techniques as a means both to exploit rate differences among the various client-server links and to address dynamic rate fluctuations. We evaluate our approaches using the GridFTP data movement protocol in a wide-area testbed and present our results.
DOI:10.1109/GRID.2003.1261697