On periodic scheduling of fixed-slot bandwidth reservations for big data transfer

Yongqiang Wang; Chase Q. Wu; Aiqin Hou; Wenyu Peng; Shuting Xu; Meng Shi

doi:10.1109/LCN.2015.7366374

On periodic scheduling of fixed-slot bandwidth reservations for big data transfer

Yongqiang Wang, Chase Q. Wu, Aiqin Hou, Wenyu Peng, Shuting Xu, Meng Shi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

The efficiency of bandwidth scheduling in high-performance networks (HPNs) is critical to the utilization of network resources and the satisfaction of user requests. We consider a periodic bandwidth scheduling problem to maximize the number of satisfied fixed-slot bandwidth reservation requests, referred to as multiple fixed-slot bandwidth scheduling (MFSBS), which is shown to be NP-complete. We first design a minimum resource occupation algorithm for a special type of M-FSBS with identical slots, referred to as MinRO-IS, and further propose a generalized version of MinRO for M-FSBS with arbitrary slots. We also design four greedy algorithms for performance comparison. Extensive simulation results illustrate that both MinRO-IS and MinRO have a superior performance over the existing algorithms in the literature and the other four greedy algorithms in comparison. Considering the popularity of the FSBS-based service model and the rapid expansion of HPNs in both speed and scope, the proposed scheduling algorithms have great potential to improve the network performance of big-data applications that require the FSBS service in HPNs.

Original language	English (US)
Title of host publication	Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015
Editors	Salil Kanhere, Jens Tolle, Soumaya Cherkaoui
Publisher	IEEE Computer Society
Pages	587-594
Number of pages	8
ISBN (Electronic)	9781467367707
DOIs	https://doi.org/10.1109/LCN.2015.7366374
State	Published - Dec 24 2015
Event	2015 IEEE 40th Conference on Local Computer Networks, LCN 2015 - Clearwater Beach, United States Duration: Oct 26 2015 → Oct 29 2015

Publication series

Name	Proceedings - Conference on Local Computer Networks, LCN
Volume	26-29-October-2015

Other

Other	2015 IEEE 40th Conference on Local Computer Networks, LCN 2015
Country/Territory	United States
City	Clearwater Beach
Period	10/26/15 → 10/29/15

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Hardware and Architecture

Keywords

High-performance networks
bandwidth scheduling
big data
resource utilization

Access to Document

10.1109/LCN.2015.7366374

Cite this

Wang, Y., Wu, C. Q., Hou, A., Peng, W., Xu, S., & Shi, M. (2015). On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. In S. Kanhere, J. Tolle, & S. Cherkaoui (Eds.), Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015 (pp. 587-594). Article 7366374 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 26-29-October-2015). IEEE Computer Society. https://doi.org/10.1109/LCN.2015.7366374

Wang, Yongqiang ; Wu, Chase Q. ; Hou, Aiqin et al. / On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015. editor / Salil Kanhere ; Jens Tolle ; Soumaya Cherkaoui. IEEE Computer Society, 2015. pp. 587-594 (Proceedings - Conference on Local Computer Networks, LCN).

@inproceedings{003fd82ca89648deaaad2b8ff9a6acdf,

title = "On periodic scheduling of fixed-slot bandwidth reservations for big data transfer",

abstract = "The efficiency of bandwidth scheduling in high-performance networks (HPNs) is critical to the utilization of network resources and the satisfaction of user requests. We consider a periodic bandwidth scheduling problem to maximize the number of satisfied fixed-slot bandwidth reservation requests, referred to as multiple fixed-slot bandwidth scheduling (MFSBS), which is shown to be NP-complete. We first design a minimum resource occupation algorithm for a special type of M-FSBS with identical slots, referred to as MinRO-IS, and further propose a generalized version of MinRO for M-FSBS with arbitrary slots. We also design four greedy algorithms for performance comparison. Extensive simulation results illustrate that both MinRO-IS and MinRO have a superior performance over the existing algorithms in the literature and the other four greedy algorithms in comparison. Considering the popularity of the FSBS-based service model and the rapid expansion of HPNs in both speed and scope, the proposed scheduling algorithms have great potential to improve the network performance of big-data applications that require the FSBS service in HPNs.",

keywords = "High-performance networks, bandwidth scheduling, big data, resource utilization",

author = "Yongqiang Wang and Wu, {Chase Q.} and Aiqin Hou and Wenyu Peng and Shuting Xu and Meng Shi",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE 40th Conference on Local Computer Networks, LCN 2015 ; Conference date: 26-10-2015 Through 29-10-2015",

year = "2015",

month = dec,

day = "24",

doi = "10.1109/LCN.2015.7366374",

language = "English (US)",

series = "Proceedings - Conference on Local Computer Networks, LCN",

publisher = "IEEE Computer Society",

pages = "587--594",

editor = "Salil Kanhere and Jens Tolle and Soumaya Cherkaoui",

booktitle = "Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015",

address = "United States",

}

Wang, Y, Wu, CQ, Hou, A, Peng, W, Xu, S & Shi, M 2015, On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. in S Kanhere, J Tolle & S Cherkaoui (eds), Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015., 7366374, Proceedings - Conference on Local Computer Networks, LCN, vol. 26-29-October-2015, IEEE Computer Society, pp. 587-594, 2015 IEEE 40th Conference on Local Computer Networks, LCN 2015, Clearwater Beach, United States, 10/26/15. https://doi.org/10.1109/LCN.2015.7366374

On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. / Wang, Yongqiang; Wu, Chase Q.; Hou, Aiqin et al.
Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015. ed. / Salil Kanhere; Jens Tolle; Soumaya Cherkaoui. IEEE Computer Society, 2015. p. 587-594 7366374 (Proceedings - Conference on Local Computer Networks, LCN; Vol. 26-29-October-2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On periodic scheduling of fixed-slot bandwidth reservations for big data transfer

AU - Wang, Yongqiang

AU - Wu, Chase Q.

AU - Hou, Aiqin

AU - Peng, Wenyu

AU - Xu, Shuting

AU - Shi, Meng

PY - 2015/12/24

Y1 - 2015/12/24

N2 - The efficiency of bandwidth scheduling in high-performance networks (HPNs) is critical to the utilization of network resources and the satisfaction of user requests. We consider a periodic bandwidth scheduling problem to maximize the number of satisfied fixed-slot bandwidth reservation requests, referred to as multiple fixed-slot bandwidth scheduling (MFSBS), which is shown to be NP-complete. We first design a minimum resource occupation algorithm for a special type of M-FSBS with identical slots, referred to as MinRO-IS, and further propose a generalized version of MinRO for M-FSBS with arbitrary slots. We also design four greedy algorithms for performance comparison. Extensive simulation results illustrate that both MinRO-IS and MinRO have a superior performance over the existing algorithms in the literature and the other four greedy algorithms in comparison. Considering the popularity of the FSBS-based service model and the rapid expansion of HPNs in both speed and scope, the proposed scheduling algorithms have great potential to improve the network performance of big-data applications that require the FSBS service in HPNs.

AB - The efficiency of bandwidth scheduling in high-performance networks (HPNs) is critical to the utilization of network resources and the satisfaction of user requests. We consider a periodic bandwidth scheduling problem to maximize the number of satisfied fixed-slot bandwidth reservation requests, referred to as multiple fixed-slot bandwidth scheduling (MFSBS), which is shown to be NP-complete. We first design a minimum resource occupation algorithm for a special type of M-FSBS with identical slots, referred to as MinRO-IS, and further propose a generalized version of MinRO for M-FSBS with arbitrary slots. We also design four greedy algorithms for performance comparison. Extensive simulation results illustrate that both MinRO-IS and MinRO have a superior performance over the existing algorithms in the literature and the other four greedy algorithms in comparison. Considering the popularity of the FSBS-based service model and the rapid expansion of HPNs in both speed and scope, the proposed scheduling algorithms have great potential to improve the network performance of big-data applications that require the FSBS service in HPNs.

KW - High-performance networks

KW - bandwidth scheduling

KW - big data

KW - resource utilization

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

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

U2 - 10.1109/LCN.2015.7366374

DO - 10.1109/LCN.2015.7366374

M3 - Conference contribution

AN - SCOPUS:84973902369

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 587

EP - 594

BT - Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015

A2 - Kanhere, Salil

A2 - Tolle, Jens

A2 - Cherkaoui, Soumaya

PB - IEEE Computer Society

T2 - 2015 IEEE 40th Conference on Local Computer Networks, LCN 2015

Y2 - 26 October 2015 through 29 October 2015

ER -

Wang Y, Wu CQ, Hou A, Peng W, Xu S, Shi M. On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. In Kanhere S, Tolle J, Cherkaoui S, editors, Proceedings of the 40th Annual IEEE Conference on Local Computer Networks, LCN 2015. IEEE Computer Society. 2015. p. 587-594. 7366374. (Proceedings - Conference on Local Computer Networks, LCN). doi: 10.1109/LCN.2015.7366374

On periodic scheduling of fixed-slot bandwidth reservations for big data transfer

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this