Bandwidth preemption for high-priority data transfer on dedicated channels

Liudong Zuo, Chase Wu, Nageswara S.V. Rao, Aiqin Hou, Chia Han Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish (US)
Title of host publicationICCCN 2018 - 27th International Conference on Computer Communications and Networks
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538651568
DOIs
StatePublished - Oct 9 2018
Event27th International Conference on Computer Communications and Networks, ICCCN 2018 - Hangzhou City, Zhejiang Province, China
Duration: Jul 30 2018Aug 2 2018

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2018-July

Other

Other27th International Conference on Computer Communications and Networks, ICCCN 2018
CountryChina
CityHangzhou City, Zhejiang Province
Period7/30/188/2/18

Fingerprint

Data transfer
Bandwidth
Heuristic algorithms
Scheduling
Quality of service

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Keywords

  • Bandwidth reservation
  • bandwidth preemption
  • data transfer
  • dynamic provisioning

Cite this

Zuo, L., Wu, C., Rao, N. S. V., Hou, A., & Chang, C. H. (2018). Bandwidth preemption for high-priority data transfer on dedicated channels. In ICCCN 2018 - 27th International Conference on Computer Communications and Networks [8487395] (Proceedings - International Conference on Computer Communications and Networks, ICCCN; Vol. 2018-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCN.2018.8487395
Zuo, Liudong ; Wu, Chase ; Rao, Nageswara S.V. ; Hou, Aiqin ; Chang, Chia Han. / Bandwidth preemption for high-priority data transfer on dedicated channels. ICCCN 2018 - 27th International Conference on Computer Communications and Networks. Institute of Electrical and Electronics Engineers Inc., 2018. (Proceedings - International Conference on Computer Communications and Networks, ICCCN).
@inproceedings{f4f338852d604470a18b197dec5b0e1b,
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.",
keywords = "Bandwidth reservation, bandwidth preemption, data transfer, dynamic provisioning",
author = "Liudong Zuo and Chase Wu and Rao, {Nageswara S.V.} and Aiqin Hou and Chang, {Chia Han}",
year = "2018",
month = "10",
day = "9",
doi = "https://doi.org/10.1109/ICCCN.2018.8487395",
language = "English (US)",
series = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "ICCCN 2018 - 27th International Conference on Computer Communications and Networks",
address = "United States",

}

Zuo, L, Wu, C, Rao, NSV, Hou, A & Chang, CH 2018, Bandwidth preemption for high-priority data transfer on dedicated channels. in ICCCN 2018 - 27th International Conference on Computer Communications and Networks., 8487395, Proceedings - International Conference on Computer Communications and Networks, ICCCN, vol. 2018-July, Institute of Electrical and Electronics Engineers Inc., 27th International Conference on Computer Communications and Networks, ICCCN 2018, Hangzhou City, Zhejiang Province, China, 7/30/18. https://doi.org/10.1109/ICCCN.2018.8487395

Bandwidth preemption for high-priority data transfer on dedicated channels. / Zuo, Liudong; Wu, Chase; Rao, Nageswara S.V.; Hou, Aiqin; Chang, Chia Han.

ICCCN 2018 - 27th International Conference on Computer Communications and Networks. Institute of Electrical and Electronics Engineers Inc., 2018. 8487395 (Proceedings - International Conference on Computer Communications and Networks, ICCCN; Vol. 2018-July).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Bandwidth preemption for high-priority data transfer on dedicated channels

AU - Zuo, Liudong

AU - Wu, Chase

AU - Rao, Nageswara S.V.

AU - Hou, Aiqin

AU - Chang, Chia Han

PY - 2018/10/9

Y1 - 2018/10/9

N2 - 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.

AB - 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.

KW - Bandwidth reservation

KW - bandwidth preemption

KW - data transfer

KW - dynamic provisioning

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

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

U2 - https://doi.org/10.1109/ICCCN.2018.8487395

DO - https://doi.org/10.1109/ICCCN.2018.8487395

M3 - Conference contribution

T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN

BT - ICCCN 2018 - 27th International Conference on Computer Communications and Networks

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Zuo L, Wu C, Rao NSV, Hou A, Chang CH. Bandwidth preemption for high-priority data transfer on dedicated channels. In ICCCN 2018 - 27th International Conference on Computer Communications and Networks. Institute of Electrical and Electronics Engineers Inc. 2018. 8487395. (Proceedings - International Conference on Computer Communications and Networks, ICCCN). https://doi.org/10.1109/ICCCN.2018.8487395