Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

Liudong Zuo, Michelle Zhu, Chase Qishi Wu

Research output: Contribution to journalArticleResearchpeer-review

11 Citations (Scopus)

Abstract

Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users’ bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.

Original languageEnglish
Pages (from-to)420-444
Number of pages25
JournalJournal of Network and Systems Management
Volume23
Issue number3
DOIs
StatePublished - 17 Jul 2015

Fingerprint

Bandwidth
Data transfer
Time varying networks
Network performance
Reservation
Network dynamics
Provisioning
Scheduling algorithms
Throughput
Resource utilization
Deadline

Keywords

  • Bandwidth scheduling
  • Dedicated network
  • High-performance networks

Cite this

@article{83f50142197847ee83d9fe408c69bc92,
title = "Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning",
abstract = "Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users’ bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.",
keywords = "Bandwidth scheduling, Dedicated network, High-performance networks",
author = "Liudong Zuo and Michelle Zhu and Wu, {Chase Qishi}",
year = "2015",
month = "7",
day = "17",
doi = "10.1007/s10922-013-9294-0",
language = "English",
volume = "23",
pages = "420--444",
journal = "Journal of Network and Systems Management",
issn = "1064-7570",
publisher = "Springer New York",
number = "3",

}

Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning. / Zuo, Liudong; Zhu, Michelle; Wu, Chase Qishi.

In: Journal of Network and Systems Management, Vol. 23, No. 3, 17.07.2015, p. 420-444.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

AU - Zuo, Liudong

AU - Zhu, Michelle

AU - Wu, Chase Qishi

PY - 2015/7/17

Y1 - 2015/7/17

N2 - Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users’ bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.

AB - Large-scale collaborative e-science requires fast and reliable data transfer with guaranteed performance, which is made possible by reserving bandwidth as needed in advance in high-performance networks. In scientific applications, users typically know the data size, the data available time, and the deadline to finish the data transfer, and they always wish to achieve the earliest possible finish time or the minimum time duration for the data transfer. On the other hand, the network service provider wishes to serve as many users’ bandwidth reservation requests (BRRs) as possible to maximize the network resource utilization without compromising their deadlines. Such multi-objective requirements and high system throughput call for a fast and efficient bandwidth reservation strategy that can quickly discover various reservation options in a time-varying network environment. We propose two bandwidth reservation algorithms with rigorous optimality proofs to compute the reservation options with the earliest completion time and with the shortest duration for a local BRR. Our algorithms aim to achieve the balanced resource utilization for the network system. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of execution time, success ratio, success ratio of BRRs with different priorities and searched complexity of BRRs in comparison with similar scheduling algorithms.

KW - Bandwidth scheduling

KW - Dedicated network

KW - High-performance networks

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

U2 - 10.1007/s10922-013-9294-0

DO - 10.1007/s10922-013-9294-0

M3 - Article

VL - 23

SP - 420

EP - 444

JO - Journal of Network and Systems Management

JF - Journal of Network and Systems Management

SN - 1064-7570

IS - 3

ER -