Concurrent bandwidth scheduling for big data transfer over a dedicated channel

Liudong Zuo, Michelle Zhu, Chase Q. Wu

Research output: Contribution to journalArticleResearchpeer-review

10 Citations (Scopus)

Abstract

Many applications in various domains are producing colossal amounts of data, now frequently termed as 'big data', which must be transferred over long distances for remote operations. Such data transfer requires dedicated channels with high and stable bandwidth provisioned by high-performance networks (HPNs) through bandwidth reservation. For a data transfer task, from an application user's perspective, a common goal is to achieve the earliest completion time (ECT), while from a network operator's perspective, a common goal is to achieve the shortest duration (SD). In this paper, we investigate the problem of scheduling as many concurrent bandwidth reservation requests (BRRs) as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs. We show that both problems are NP-hard, and propose a heuristic algorithm for each. The performance superiority of the proposed algorithms is illustrated by extensive simulations in comparison with three other algorithms in terms of multiple performance metrics.

Original languageEnglish
Pages (from-to)169-190
Number of pages22
JournalInternational Journal of Communication Networks and Distributed Systems
Volume15
Issue number2-3
DOIs
StatePublished - 1 Jan 2015

Fingerprint

Data transfer
Scheduling
Bandwidth
Network performance
Heuristic algorithms
Computational complexity
Big data

Keywords

  • Bandwidth reservation
  • Bandwidth scheduling
  • Big data
  • High-performance networks
  • HPNs
  • QoS
  • Quality of service

Cite this

@article{d5703369e4e449539d11f728d8f6067e,
title = "Concurrent bandwidth scheduling for big data transfer over a dedicated channel",
abstract = "Many applications in various domains are producing colossal amounts of data, now frequently termed as 'big data', which must be transferred over long distances for remote operations. Such data transfer requires dedicated channels with high and stable bandwidth provisioned by high-performance networks (HPNs) through bandwidth reservation. For a data transfer task, from an application user's perspective, a common goal is to achieve the earliest completion time (ECT), while from a network operator's perspective, a common goal is to achieve the shortest duration (SD). In this paper, we investigate the problem of scheduling as many concurrent bandwidth reservation requests (BRRs) as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs. We show that both problems are NP-hard, and propose a heuristic algorithm for each. The performance superiority of the proposed algorithms is illustrated by extensive simulations in comparison with three other algorithms in terms of multiple performance metrics.",
keywords = "Bandwidth reservation, Bandwidth scheduling, Big data, High-performance networks, HPNs, QoS, Quality of service",
author = "Liudong Zuo and Michelle Zhu and Wu, {Chase Q.}",
year = "2015",
month = "1",
day = "1",
doi = "10.1504/IJCNDS.2015.070970",
language = "English",
volume = "15",
pages = "169--190",
journal = "International Journal of Communication Networks and Distributed Systems",
issn = "1754-3916",
publisher = "Inderscience Publishers",
number = "2-3",

}

Concurrent bandwidth scheduling for big data transfer over a dedicated channel. / Zuo, Liudong; Zhu, Michelle; Wu, Chase Q.

In: International Journal of Communication Networks and Distributed Systems, Vol. 15, No. 2-3, 01.01.2015, p. 169-190.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Concurrent bandwidth scheduling for big data transfer over a dedicated channel

AU - Zuo, Liudong

AU - Zhu, Michelle

AU - Wu, Chase Q.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - Many applications in various domains are producing colossal amounts of data, now frequently termed as 'big data', which must be transferred over long distances for remote operations. Such data transfer requires dedicated channels with high and stable bandwidth provisioned by high-performance networks (HPNs) through bandwidth reservation. For a data transfer task, from an application user's perspective, a common goal is to achieve the earliest completion time (ECT), while from a network operator's perspective, a common goal is to achieve the shortest duration (SD). In this paper, we investigate the problem of scheduling as many concurrent bandwidth reservation requests (BRRs) as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs. We show that both problems are NP-hard, and propose a heuristic algorithm for each. The performance superiority of the proposed algorithms is illustrated by extensive simulations in comparison with three other algorithms in terms of multiple performance metrics.

AB - Many applications in various domains are producing colossal amounts of data, now frequently termed as 'big data', which must be transferred over long distances for remote operations. Such data transfer requires dedicated channels with high and stable bandwidth provisioned by high-performance networks (HPNs) through bandwidth reservation. For a data transfer task, from an application user's perspective, a common goal is to achieve the earliest completion time (ECT), while from a network operator's perspective, a common goal is to achieve the shortest duration (SD). In this paper, we investigate the problem of scheduling as many concurrent bandwidth reservation requests (BRRs) as possible over one dedicated channel in an HPN while achieving the average ECT and the average SD of scheduled BRRs. We show that both problems are NP-hard, and propose a heuristic algorithm for each. The performance superiority of the proposed algorithms is illustrated by extensive simulations in comparison with three other algorithms in terms of multiple performance metrics.

KW - Bandwidth reservation

KW - Bandwidth scheduling

KW - Big data

KW - High-performance networks

KW - HPNs

KW - QoS

KW - Quality of service

UR - http://www.scopus.com/inward/record.url?scp=84945198367&partnerID=8YFLogxK

U2 - 10.1504/IJCNDS.2015.070970

DO - 10.1504/IJCNDS.2015.070970

M3 - Article

VL - 15

SP - 169

EP - 190

JO - International Journal of Communication Networks and Distributed Systems

JF - International Journal of Communication Networks and Distributed Systems

SN - 1754-3916

IS - 2-3

ER -