On Periodic Scheduling of Bandwidth Reservations with Deadline Constraint for Big Data Transfer

Document Type

Conference Proceeding

Publication Date

12-22-2016

Abstract

The efficiency of bandwidth scheduling in high-performance networks is critical to the utilization of network resources and the satisfaction of user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for bandwidth reservation with deadline constraint on a fixed network path, referred to as multiple deadline-constrained bandwidth scheduling (M-DCBS). We show the NP-completeness of this problem and propose a Maximum User Number Resource Reservation Algorithm (MUNRRA). Extensive simulation results show that MUNRRA exhibits a superior performance over existing algorithms in terms of scheduling success ratio and execution time. Considering the popularity of the DCBS-based service model and the rapid expansion of high-performance networks in both speed and scope, the proposed scheduling algorithm has great potential to improve the network performance of big data applications that require the DCBS service for data transfer.

Identifier

85010076707 (Scopus)

ISBN

[9781509020546]

Publication Title

Proceedings Conference on Local Computer Networks LCN

External Full Text Location

https://doi.org/10.1109/LCN.2016.48

First Page

224

Last Page

227

Grant

61472320

Fund Ref

U.S. Department of Energy

This document is currently not available here.

Share

COinS