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

Document Type

Article

Publication Date

5-1-2017

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.

Identifier

85009412736 (Scopus)

Publication Title

Journal of Network and Computer Applications

External Full Text Location

https://doi.org/10.1016/j.jnca.2016.12.011

e-ISSN

10958592

ISSN

10848045

First Page

47

Last Page

55

Volume

85

This document is currently not available here.

Share

COinS