Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks

Liudong Zuo, Michelle Zhu, Chase Q. Wu

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

Abstract

Bandwidth reservation has been increasingly used in high-performance networks to provide quality of service for various applications ranging from real-time multimedia communication in early years to big data transfer more recently. In this paper, we consider multiple bandwidth reservation requests in a batch awaiting to be scheduled in a dedicated network, and formulate two scheduling maximization problems: 1) maximize the amount of data to be transferred and 2) maximize the number of requests to be scheduled. We prove both problems are NP-complete and very difficult to approximate. We then design two heuristic algorithms and evaluate their performance against a scheduling algorithm widely used in real production networks through extensive simulation-based experiments. The experimental results show that the proposed heuristic algorithms achieve significantly better overall scheduling performance than the existing algorithm.

Original languageEnglish
Pages (from-to)544-554
Number of pages11
JournalIEEE Transactions on Network and Service Management
Volume15
Issue number2
DOIs
StatePublished - 1 Jun 2018

Fingerprint

Heuristic algorithms
Scheduling
Bandwidth
Data transfer
Network performance
Scheduling algorithms
Computational complexity
Quality of service
Communication
Experiments
Big data

Keywords

  • Bandwidth reservation/scheduling
  • QoS
  • dynamic provisioning

Cite this

@article{924e759313564b22b0b85f83e568b041,
title = "Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks",
abstract = "Bandwidth reservation has been increasingly used in high-performance networks to provide quality of service for various applications ranging from real-time multimedia communication in early years to big data transfer more recently. In this paper, we consider multiple bandwidth reservation requests in a batch awaiting to be scheduled in a dedicated network, and formulate two scheduling maximization problems: 1) maximize the amount of data to be transferred and 2) maximize the number of requests to be scheduled. We prove both problems are NP-complete and very difficult to approximate. We then design two heuristic algorithms and evaluate their performance against a scheduling algorithm widely used in real production networks through extensive simulation-based experiments. The experimental results show that the proposed heuristic algorithms achieve significantly better overall scheduling performance than the existing algorithm.",
keywords = "Bandwidth reservation/scheduling, QoS, dynamic provisioning",
author = "Liudong Zuo and Michelle Zhu and Wu, {Chase Q.}",
year = "2018",
month = "6",
day = "1",
doi = "10.1109/TNSM.2018.2794300",
language = "English",
volume = "15",
pages = "544--554",
journal = "IEEE Transactions on Network and Service Management",
issn = "1932-4537",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks. / Zuo, Liudong; Zhu, Michelle; Wu, Chase Q.

In: IEEE Transactions on Network and Service Management, Vol. 15, No. 2, 01.06.2018, p. 544-554.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Bandwidth Reservation Strategies for Scheduling Maximization in Dedicated Networks

AU - Zuo, Liudong

AU - Zhu, Michelle

AU - Wu, Chase Q.

PY - 2018/6/1

Y1 - 2018/6/1

N2 - Bandwidth reservation has been increasingly used in high-performance networks to provide quality of service for various applications ranging from real-time multimedia communication in early years to big data transfer more recently. In this paper, we consider multiple bandwidth reservation requests in a batch awaiting to be scheduled in a dedicated network, and formulate two scheduling maximization problems: 1) maximize the amount of data to be transferred and 2) maximize the number of requests to be scheduled. We prove both problems are NP-complete and very difficult to approximate. We then design two heuristic algorithms and evaluate their performance against a scheduling algorithm widely used in real production networks through extensive simulation-based experiments. The experimental results show that the proposed heuristic algorithms achieve significantly better overall scheduling performance than the existing algorithm.

AB - Bandwidth reservation has been increasingly used in high-performance networks to provide quality of service for various applications ranging from real-time multimedia communication in early years to big data transfer more recently. In this paper, we consider multiple bandwidth reservation requests in a batch awaiting to be scheduled in a dedicated network, and formulate two scheduling maximization problems: 1) maximize the amount of data to be transferred and 2) maximize the number of requests to be scheduled. We prove both problems are NP-complete and very difficult to approximate. We then design two heuristic algorithms and evaluate their performance against a scheduling algorithm widely used in real production networks through extensive simulation-based experiments. The experimental results show that the proposed heuristic algorithms achieve significantly better overall scheduling performance than the existing algorithm.

KW - Bandwidth reservation/scheduling

KW - QoS

KW - dynamic provisioning

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

U2 - 10.1109/TNSM.2018.2794300

DO - 10.1109/TNSM.2018.2794300

M3 - Article

VL - 15

SP - 544

EP - 554

JO - IEEE Transactions on Network and Service Management

JF - IEEE Transactions on Network and Service Management

SN - 1932-4537

IS - 2

ER -