## Abstract

Efficient transfer of bulk data requires routing that minimizes the net transfer time instead of providing flow level bandwidth guarantees. In this work, we consider a realistic scenario where available bandwidth for each link in a given network is time varying. In such a network and for a given file size, we provide an optimal algorithm that minimizes the total time required to transfer the file from source to destination. We further consider the problem where path shifting is allowed to increase the net throughput for bulk data transfer. For this problem, we provide a dynamic programming based optimal algorithm that minimizes the number of path shifts required to transfer the file in the specified time. Solution to the above problems addresses both the performance and scalability issues that arise in large bulk data transfer for long duration of time.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Conference on Communications |

Pages | 1182-1186 |

Number of pages | 5 |

Volume | 2 |

State | Published - 2004 |

Event | 2004 IEEE International Conference on Communications - Paris, France Duration: Jun 20 2004 → Jun 24 2004 |

### Other

Other | 2004 IEEE International Conference on Communications |
---|---|

Country/Territory | France |

City | Paris |

Period | 6/20/04 → 6/24/04 |

## ASJC Scopus subject areas

- Media Technology