Path computation with variable bandwidth for bulk data transfer in high-performance networks

Yunyue Lin, Qishi Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

There are an increasing number of highperformance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support bulk data transfer in large-scale science or ecommerce applications. These dedicated links are typically shared by multiple users through advance reservations, resulting in varying bandwidth availability in future time periods. Therefore, efficient advance bandwidth reservation algorithms are needed to improve the utilization of network resources and meet the transport requirements of application users. We investigate the bandwidth-oriented path computation problem for two types of data transfer: (i) fixed path with variable bandwidth and (ii) variable path with variable bandwidth to minimize the transfer end time of a given data size. We prove that both problems are NP-complete and propose a heuristic algorithm for each of them. Extensive simulation results illustrate the performance superiority of the proposed heuristics over methods based on greedy strategies.

Original languageEnglish (US)
Title of host publicationIEEE INFOCOM Workshops 2009
DOIs
StatePublished - 2009
Externally publishedYes
EventIEEE INFOCOM Workshops 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM Workshops 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Keywords

  • Data transfer
  • Highperformance networks
  • Path computation

Fingerprint Dive into the research topics of 'Path computation with variable bandwidth for bulk data transfer in high-performance networks'. Together they form a unique fingerprint.

Cite this