Authors: Liudong Zuo; Michelle M. Zhu; Chase Q. Wu
Addresses: Department of Computer Science, Southern Illinois University, Carbondale, IL, USA ' Department of Computer Science, Southern Illinois University, Carbondale, IL, USA ' Department of Computer Science, University of Memphis, Memphis, TN, USA
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 requests; bandwidth scheduling; high-performance networks; HPNs; quality of service; QoS; concurrent scheduling; big data transfer; dedicated channels; simulation.
International Journal of Communication Networks and Distributed Systems, 2015 Vol.15 No.2/3, pp.169 - 190
Received: 21 Jul 2014
Accepted: 26 Dec 2014
Published online: 02 Aug 2015 *