Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks

Aiqin Hou, Chase Wu, Dingyi Fang, Yongqiang Wang, Meng Wang

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

Abstract

Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

Original languageEnglish (US)
Title of host publicationQuality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings
EditorsSangheon Pack, Jong-Hyouk Lee
PublisherSpringer Verlag
Pages86-96
Number of pages11
ISBN (Print)9783319607160
DOIs
StatePublished - Jan 1 2017
Event12th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2016 - Seoul, Korea, Republic of
Duration: Jul 7 2016Jul 8 2016

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume199

Other

Other12th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2016
CountryKorea, Republic of
CitySeoul
Period7/7/167/8/16

Fingerprint

Network performance
Scheduling
Bandwidth
Time varying networks
Complex networks
Data transfer

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Hou, A., Wu, C., Fang, D., Wang, Y., & Wang, M. (2017). Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. In S. Pack, & J-H. Lee (Eds.), Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings (pp. 86-96). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 199). Springer Verlag. https://doi.org/10.1007/978-3-319-60717-7_9
Hou, Aiqin ; Wu, Chase ; Fang, Dingyi ; Wang, Yongqiang ; Wang, Meng. / Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings. editor / Sangheon Pack ; Jong-Hyouk Lee. Springer Verlag, 2017. pp. 86-96 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).
@inproceedings{e80276c453d445c68bb4d4da761bac0d,
title = "Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks",
abstract = "Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.",
author = "Aiqin Hou and Chase Wu and Dingyi Fang and Yongqiang Wang and Meng Wang",
year = "2017",
month = "1",
day = "1",
doi = "https://doi.org/10.1007/978-3-319-60717-7_9",
language = "English (US)",
isbn = "9783319607160",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
publisher = "Springer Verlag",
pages = "86--96",
editor = "Sangheon Pack and Jong-Hyouk Lee",
booktitle = "Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings",
address = "Germany",

}

Hou, A, Wu, C, Fang, D, Wang, Y & Wang, M 2017, Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. in S Pack & J-H Lee (eds), Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 199, Springer Verlag, pp. 86-96, 12th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2016, Seoul, Korea, Republic of, 7/7/16. https://doi.org/10.1007/978-3-319-60717-7_9

Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. / Hou, Aiqin; Wu, Chase; Fang, Dingyi; Wang, Yongqiang; Wang, Meng.

Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings. ed. / Sangheon Pack; Jong-Hyouk Lee. Springer Verlag, 2017. p. 86-96 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 199).

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

TY - GEN

T1 - Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks

AU - Hou, Aiqin

AU - Wu, Chase

AU - Fang, Dingyi

AU - Wang, Yongqiang

AU - Wang, Meng

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

AB - Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

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

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

U2 - https://doi.org/10.1007/978-3-319-60717-7_9

DO - https://doi.org/10.1007/978-3-319-60717-7_9

M3 - Conference contribution

SN - 9783319607160

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 86

EP - 96

BT - Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings

A2 - Pack, Sangheon

A2 - Lee, Jong-Hyouk

PB - Springer Verlag

ER -

Hou A, Wu C, Fang D, Wang Y, Wang M. Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. In Pack S, Lee J-H, editors, Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings. Springer Verlag. 2017. p. 86-96. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). https://doi.org/10.1007/978-3-319-60717-7_9