Periodic Scheduling of Profiling-Based Floating-Window Bandwidth Reservations for Scientific Collaboration

Document Type

Conference Proceeding

Publication Date

7-2-2017

Abstract

An increasing number of scientific applications carry out big data transfer through dedicated networks for global collaboration, where bandwidth scheduling plays a critical role in improving the utilization of network resources and meeting diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for profiling-based floating-window bandwidth reservations under deadline constraint on a network path, referred to as PFWR-DC. We prove that PFWR-DC is NP-complete, and propose an integrated bandwidth scheduling algorithm based on the product of floating-window size and dynamic transport throughput, referred to as ProductWT-BS. Extensive simulation results shed light on the performance superiority of ProductWT-BS in terms of scheduling success ratio over five heuristic algorithms designed for performance comparison. The proposed scheduling algorithm has great potential to improve the performance of collaborative scientific applications that require the floating-window bandwidth provisioning service for coordinated network-based operations.

Identifier

85047501791 (Scopus)

ISBN

[9781538625880]

Publication Title

Proceedings 2017 IEEE 19th Intl Conference on High Performance Computing and Communications Hpcc 2017 2017 IEEE 15th Intl Conference on Smart City Smartcity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems Dss 2017

External Full Text Location

https://doi.org/10.1109/HPCC-SmartCity-DSS.2017.63

First Page

482

Last Page

489

Volume

2018-January

Grant

61472320

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS