Abstract
Sheer volumes of data are being generated in extreme-scale distributed scientific applications, and need to be transferred remotely in fast, predictable and reliable way for data storage and analysis purpose. Reserving bandwidth along selected paths in high-performance networks (HPNs) has proved to be an effective way to satisfy the high-demanding performance requirements of such data transfer. However, node and link failures within the HPNs potentially degrade the quality of data transfer. In this paper, we focus on the scheduling of two generic types of bandwidth reservation requests concerning data transfer reliability: (i) to achieve the highest data transfer reliability under a given data transfer deadline, and (ii) to achieve the earliest data transfer completion time while satisfying a given data transfer reliability requirement. Poisson distribution is used to model the node and failures within the HPNs, and two periodic bandwidth reservation algorithms with rigorous optimality proofs are proposed.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 |
| Editors | Ronay Ak, George Karypis, Yinglong Xia, Xiaohua Tony Hu, Philip S. Yu, James Joshi, Lyle Ungar, Ling Liu, Aki-Hiro Sato, Toyotaro Suzumura, Sudarsan Rachuri, Rama Govindaraju, Weijia Xu |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 3069-3078 |
| Number of pages | 10 |
| ISBN (Electronic) | 9781467390040 |
| DOIs | |
| State | Published - 1 Jan 2016 |
| Event | 4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States Duration: 5 Dec 2016 → 8 Dec 2016 |
Publication series
| Name | Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 |
|---|
Other
| Other | 4th IEEE International Conference on Big Data, Big Data 2016 |
|---|---|
| Country | United States |
| City | Washington |
| Period | 5/12/16 → 8/12/16 |
Fingerprint
Keywords
- Bandwidth reservation
- bandwidth scheduling
- fault tolerance
- high-performance networks
Cite this
}
Bandwidth provision strategies for reliable data movements in dedicated networks. / Zuo, Liudong; Zhu, Michelle Mengxia.
Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. ed. / Ronay Ak; George Karypis; Yinglong Xia; Xiaohua Tony Hu; Philip S. Yu; James Joshi; Lyle Ungar; Ling Liu; Aki-Hiro Sato; Toyotaro Suzumura; Sudarsan Rachuri; Rama Govindaraju; Weijia Xu. Institute of Electrical and Electronics Engineers Inc., 2016. p. 3069-3078 7840961 (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Bandwidth provision strategies for reliable data movements in dedicated networks
AU - Zuo, Liudong
AU - Zhu, Michelle Mengxia
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Sheer volumes of data are being generated in extreme-scale distributed scientific applications, and need to be transferred remotely in fast, predictable and reliable way for data storage and analysis purpose. Reserving bandwidth along selected paths in high-performance networks (HPNs) has proved to be an effective way to satisfy the high-demanding performance requirements of such data transfer. However, node and link failures within the HPNs potentially degrade the quality of data transfer. In this paper, we focus on the scheduling of two generic types of bandwidth reservation requests concerning data transfer reliability: (i) to achieve the highest data transfer reliability under a given data transfer deadline, and (ii) to achieve the earliest data transfer completion time while satisfying a given data transfer reliability requirement. Poisson distribution is used to model the node and failures within the HPNs, and two periodic bandwidth reservation algorithms with rigorous optimality proofs are proposed.
AB - Sheer volumes of data are being generated in extreme-scale distributed scientific applications, and need to be transferred remotely in fast, predictable and reliable way for data storage and analysis purpose. Reserving bandwidth along selected paths in high-performance networks (HPNs) has proved to be an effective way to satisfy the high-demanding performance requirements of such data transfer. However, node and link failures within the HPNs potentially degrade the quality of data transfer. In this paper, we focus on the scheduling of two generic types of bandwidth reservation requests concerning data transfer reliability: (i) to achieve the highest data transfer reliability under a given data transfer deadline, and (ii) to achieve the earliest data transfer completion time while satisfying a given data transfer reliability requirement. Poisson distribution is used to model the node and failures within the HPNs, and two periodic bandwidth reservation algorithms with rigorous optimality proofs are proposed.
KW - Bandwidth reservation
KW - bandwidth scheduling
KW - fault tolerance
KW - high-performance networks
UR - http://www.scopus.com/inward/record.url?scp=85015224050&partnerID=8YFLogxK
U2 - 10.1109/BigData.2016.7840961
DO - 10.1109/BigData.2016.7840961
M3 - Conference contribution
AN - SCOPUS:85015224050
T3 - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
SP - 3069
EP - 3078
BT - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
A2 - Ak, Ronay
A2 - Karypis, George
A2 - Xia, Yinglong
A2 - Hu, Xiaohua Tony
A2 - Yu, Philip S.
A2 - Joshi, James
A2 - Ungar, Lyle
A2 - Liu, Ling
A2 - Sato, Aki-Hiro
A2 - Suzumura, Toyotaro
A2 - Rachuri, Sudarsan
A2 - Govindaraju, Rama
A2 - Xu, Weijia
PB - Institute of Electrical and Electronics Engineers Inc.
ER -