Periodic Scheduling of Deadline-Constrained Bandwidth Reservations for Scientific Collaboration

Document Type

Conference Proceeding

Publication Date

1-20-2017

Abstract

As Software-Defined Networking (SDN) continues to mature and proliferate, many large computing and storage facilities are now connected by high-speed links to support global scientific collaboration. In such dedicated network environments, 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 fixed-bandwidth floating-slot reservation under deadline constraint on a network path, referred to as FBFS-DC. We prove that FBFS-DC is NP-complete, and propose a bandwidth scheduling algorithm based on product of bandwidth and slot, referred to as Product-BS. Extensive simulation-based scheduling experiments show that Product-BS has a superior performance in terms of scheduling success ratio over three heuristic algorithms designed for performance comparison. The proposed scheduling algorithm has great potential to improve the performance of collaborative scientific applications that require the FBFS service for coordinated network-based operations.

Identifier

85013653873 (Scopus)

ISBN

[9781509042968]

Publication Title

Proceedings 18th IEEE International Conference on High Performance Computing and Communications 14th IEEE International Conference on Smart City and 2nd IEEE International Conference on Data Science and Systems Hpcc Smartcity Dss 2016

External Full Text Location

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

First Page

150

Last Page

157

This document is currently not available here.

Share

COinS