On fixed-path variable-bandwidth scheduling in high-performance networks

Liudong Zuo, Mustafa Khaleel, Michelle Zhu, Chase Qishi Wu

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

3 Citations (Scopus)

Abstract

Many extreme-scale scientific applications are distributed in nature and oftentimes need to move vast amounts of data between multiple locations for various remote operations. Such applications require fast and reliable data transfer services with guaranteed finish time, which can be realized by making bandwidth reservation for dedicated channel provisioning in high-performance networks. From an individual perspective, a user always wishes to achieve the earliest finish time for a given data transfer request that typically specifies the maximum Local Area Network (LAN) bandwidth constraint, the data size, data available time, and the deadline. From a global perspective, the network service provider would attempt to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the overall network resource utilization and throughput. As for the high-performance network consuming vast amounts energy and network resources, the network service provider would also want to process BRRs efficiently to save energy, network resource and the network maintenance cost. These goals are potentially conflictive and require a careful design of the bandwidth reservation and scheduling algorithm. In this paper, we focus on one particular type of scheduling problem under the constraint of fixed path and varying bandwidth (FPVB), which has been proven to be NP-complete in the literature. We develop two heuristic algorithms, namely Least Available Bandwidth of Edge (LABE) and Largest Available Bandwidth of Path (LABP), to solve this problem and conduct simulation-based performance evaluation. The extensive simulation results illustrate the superiority of these proposed algorithms in terms of execution time, success ratio, and average data transfer completion time of BRRs in comparison with two existing scheduling algorithms.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013
Pages23-30
Number of pages8
DOIs
StatePublished - 1 Dec 2013
Event2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013 - Beijing, China
Duration: 20 Aug 201323 Aug 2013

Publication series

NameProceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

Other

Other2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013
CountryChina
CityBeijing
Period20/08/1323/08/13

Fingerprint

Network performance
Scheduling
Bandwidth
Data transfer
Scheduling algorithms
Heuristic algorithms
Local area networks
Throughput

Cite this

Zuo, L., Khaleel, M., Zhu, M., & Wu, C. Q. (2013). On fixed-path variable-bandwidth scheduling in high-performance networks. In Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013 (pp. 23-30). [6682044] (Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013). https://doi.org/10.1109/GreenCom-iThings-CPSCom.2013.30
Zuo, Liudong ; Khaleel, Mustafa ; Zhu, Michelle ; Wu, Chase Qishi. / On fixed-path variable-bandwidth scheduling in high-performance networks. Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013. 2013. pp. 23-30 (Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013).
@inproceedings{db71f3532d0743f59ce9603491c43658,
title = "On fixed-path variable-bandwidth scheduling in high-performance networks",
abstract = "Many extreme-scale scientific applications are distributed in nature and oftentimes need to move vast amounts of data between multiple locations for various remote operations. Such applications require fast and reliable data transfer services with guaranteed finish time, which can be realized by making bandwidth reservation for dedicated channel provisioning in high-performance networks. From an individual perspective, a user always wishes to achieve the earliest finish time for a given data transfer request that typically specifies the maximum Local Area Network (LAN) bandwidth constraint, the data size, data available time, and the deadline. From a global perspective, the network service provider would attempt to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the overall network resource utilization and throughput. As for the high-performance network consuming vast amounts energy and network resources, the network service provider would also want to process BRRs efficiently to save energy, network resource and the network maintenance cost. These goals are potentially conflictive and require a careful design of the bandwidth reservation and scheduling algorithm. In this paper, we focus on one particular type of scheduling problem under the constraint of fixed path and varying bandwidth (FPVB), which has been proven to be NP-complete in the literature. We develop two heuristic algorithms, namely Least Available Bandwidth of Edge (LABE) and Largest Available Bandwidth of Path (LABP), to solve this problem and conduct simulation-based performance evaluation. The extensive simulation results illustrate the superiority of these proposed algorithms in terms of execution time, success ratio, and average data transfer completion time of BRRs in comparison with two existing scheduling algorithms.",
author = "Liudong Zuo and Mustafa Khaleel and Michelle Zhu and Wu, {Chase Qishi}",
year = "2013",
month = "12",
day = "1",
doi = "10.1109/GreenCom-iThings-CPSCom.2013.30",
language = "English",
isbn = "9780769550466",
series = "Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013",
pages = "23--30",
booktitle = "Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013",

}

Zuo, L, Khaleel, M, Zhu, M & Wu, CQ 2013, On fixed-path variable-bandwidth scheduling in high-performance networks. in Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013., 6682044, Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013, pp. 23-30, 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013, Beijing, China, 20/08/13. https://doi.org/10.1109/GreenCom-iThings-CPSCom.2013.30

On fixed-path variable-bandwidth scheduling in high-performance networks. / Zuo, Liudong; Khaleel, Mustafa; Zhu, Michelle; Wu, Chase Qishi.

Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013. 2013. p. 23-30 6682044 (Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013).

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

TY - GEN

T1 - On fixed-path variable-bandwidth scheduling in high-performance networks

AU - Zuo, Liudong

AU - Khaleel, Mustafa

AU - Zhu, Michelle

AU - Wu, Chase Qishi

PY - 2013/12/1

Y1 - 2013/12/1

N2 - Many extreme-scale scientific applications are distributed in nature and oftentimes need to move vast amounts of data between multiple locations for various remote operations. Such applications require fast and reliable data transfer services with guaranteed finish time, which can be realized by making bandwidth reservation for dedicated channel provisioning in high-performance networks. From an individual perspective, a user always wishes to achieve the earliest finish time for a given data transfer request that typically specifies the maximum Local Area Network (LAN) bandwidth constraint, the data size, data available time, and the deadline. From a global perspective, the network service provider would attempt to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the overall network resource utilization and throughput. As for the high-performance network consuming vast amounts energy and network resources, the network service provider would also want to process BRRs efficiently to save energy, network resource and the network maintenance cost. These goals are potentially conflictive and require a careful design of the bandwidth reservation and scheduling algorithm. In this paper, we focus on one particular type of scheduling problem under the constraint of fixed path and varying bandwidth (FPVB), which has been proven to be NP-complete in the literature. We develop two heuristic algorithms, namely Least Available Bandwidth of Edge (LABE) and Largest Available Bandwidth of Path (LABP), to solve this problem and conduct simulation-based performance evaluation. The extensive simulation results illustrate the superiority of these proposed algorithms in terms of execution time, success ratio, and average data transfer completion time of BRRs in comparison with two existing scheduling algorithms.

AB - Many extreme-scale scientific applications are distributed in nature and oftentimes need to move vast amounts of data between multiple locations for various remote operations. Such applications require fast and reliable data transfer services with guaranteed finish time, which can be realized by making bandwidth reservation for dedicated channel provisioning in high-performance networks. From an individual perspective, a user always wishes to achieve the earliest finish time for a given data transfer request that typically specifies the maximum Local Area Network (LAN) bandwidth constraint, the data size, data available time, and the deadline. From a global perspective, the network service provider would attempt to serve as many users' bandwidth reservation requests (BRRs) as possible to maximize the overall network resource utilization and throughput. As for the high-performance network consuming vast amounts energy and network resources, the network service provider would also want to process BRRs efficiently to save energy, network resource and the network maintenance cost. These goals are potentially conflictive and require a careful design of the bandwidth reservation and scheduling algorithm. In this paper, we focus on one particular type of scheduling problem under the constraint of fixed path and varying bandwidth (FPVB), which has been proven to be NP-complete in the literature. We develop two heuristic algorithms, namely Least Available Bandwidth of Edge (LABE) and Largest Available Bandwidth of Path (LABP), to solve this problem and conduct simulation-based performance evaluation. The extensive simulation results illustrate the superiority of these proposed algorithms in terms of execution time, success ratio, and average data transfer completion time of BRRs in comparison with two existing scheduling algorithms.

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

U2 - 10.1109/GreenCom-iThings-CPSCom.2013.30

DO - 10.1109/GreenCom-iThings-CPSCom.2013.30

M3 - Conference contribution

AN - SCOPUS:84893460016

SN - 9780769550466

T3 - Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

SP - 23

EP - 30

BT - Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

ER -

Zuo L, Khaleel M, Zhu M, Wu CQ. On fixed-path variable-bandwidth scheduling in high-performance networks. In Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013. 2013. p. 23-30. 6682044. (Proceedings - 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013). https://doi.org/10.1109/GreenCom-iThings-CPSCom.2013.30