skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Bandwidth preemption for high-priority data transfer on dedicated channels

Abstract

Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.

Authors:
ORCiD logo [1];  [2];  [3];  [4];  [2]
  1. ORNL
  2. California State University, Dominguez Hills
  3. New Jersey Institute of Technology
  4. Northwest University, China
Publication Date:
Research Org.:
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
OSTI Identifier:
1468102
DOE Contract Number:  
AC05-00OR22725
Resource Type:
Conference
Resource Relation:
Conference: 27th International Conference on Computer Communications and Networks (ICCCN 2018), - Hangzhou, , China - 7/30/2018 8:00:00 AM-8/2/2018 8:00:00 AM
Country of Publication:
United States
Language:
English

Citation Formats

Rao, Nageswara S., Zuo, Liudong, Wu, Chase Qishi, Hou, Aiqin, and Han chang, Chia. Bandwidth preemption for high-priority data transfer on dedicated channels. United States: N. p., 2018. Web.
Rao, Nageswara S., Zuo, Liudong, Wu, Chase Qishi, Hou, Aiqin, & Han chang, Chia. Bandwidth preemption for high-priority data transfer on dedicated channels. United States.
Rao, Nageswara S., Zuo, Liudong, Wu, Chase Qishi, Hou, Aiqin, and Han chang, Chia. Sun . "Bandwidth preemption for high-priority data transfer on dedicated channels". United States. https://www.osti.gov/servlets/purl/1468102.
@article{osti_1468102,
title = {Bandwidth preemption for high-priority data transfer on dedicated channels},
author = {Rao, Nageswara S. and Zuo, Liudong and Wu, Chase Qishi and Hou, Aiqin and Han chang, Chia},
abstractNote = {Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {7}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: