Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning

Liudong Zuo, Michelle Mengxia Zhu, Chase Qishi Wu

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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
Issue number3
StatePublished - 17 Jul 2015


  • Bandwidth scheduling
  • Dedicated network
  • High-performance networks


Dive into the research topics of 'Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning'. Together they form a unique fingerprint.

Cite this