Bandwidth scheduling for big data transfer using multiple fixed node-disjoint paths

Aiqin Hou, Chase Q. Wu, Dingyi Fang, Yongqiang Wang, Meng Wang

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

Many large-scale applications require the transfer of big data over high-performance networks for remote operations. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in network environments with time-varying bandwidths. We formulate a generic problem of Bandwidth Scheduling with Two Node-Disjoint Paths (BS-2NDP) to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths with fixed bandwidth (2FPFB), and (ii) two fixed paths with variable bandwidth (2FPVB). We prove that both 2FPFB and 2FPVB are NP-complete, and design a heuristic approach for each of them. We implement and evaluate these scheduling algorithms in both simulated and real-life networks. Extensive results show that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

Original languageEnglish (US)
Pages (from-to)47-55
Number of pages9
JournalJournal of Network and Computer Applications
Volume85
DOIs
StatePublished - May 1 2017

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications

Keywords

  • Bandwidth scheduling
  • Big data
  • High-performance networks
  • Node-disjoint paths

Fingerprint

Dive into the research topics of 'Bandwidth scheduling for big data transfer using multiple fixed node-disjoint paths'. Together they form a unique fingerprint.

Cite this