Abstract
Because of the solid performance of providing quality of service for various applications for decades, bandwidth reservation has been increasingly used in recent years for large amounts of data transfer to achieve guaranteed performance. However, effective scheduling strategy to achieve the trade-off between data transfer cost and data transfer performance still remains to be investigated. In this paper, we focus on the trade-off between cost and the most common performance parameter, i.e., completion time, of data transfers using bandwidth reservation in dedicated networks. We consider the scheduling of two types of bandwidth reservation requests regarding such trade-off: (1) to achieve the minimum data transfer cost given the data transfer deadline, and (2) to achieve the earliest data transfer completion time given the maximum data transfer cost. We propose two bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of these two types of bandwidth reservation requests. We then compare the proposed algorithms with two scheduling algorithms originating from one widely used scheduling algorithm in production networks, and the efficacy of the proposed optimal algorithms is verified through extensive simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 166-187 |
| Number of pages | 22 |
| Journal | Journal of Network and Systems Management |
| Volume | 27 |
| Issue number | 1 |
| DOIs | |
| State | Published - 15 Jan 2019 |
Fingerprint
Keywords
- Bandwidth reservation/scheduling
- Dynamic provisioning
- High-performance networks
- QoS
Cite this
}
Optimizing Trade-Off Between Cost and Performance of Data Transfers Using Bandwidth Reservation in Dedicated Networks. / Zuo, Liudong; Zhu, Michelle; Chang, Chia Han.
In: Journal of Network and Systems Management, Vol. 27, No. 1, 15.01.2019, p. 166-187.Research output: Contribution to journal › Article
TY - JOUR
T1 - Optimizing Trade-Off Between Cost and Performance of Data Transfers Using Bandwidth Reservation in Dedicated Networks
AU - Zuo, Liudong
AU - Zhu, Michelle
AU - Chang, Chia Han
PY - 2019/1/15
Y1 - 2019/1/15
N2 - Because of the solid performance of providing quality of service for various applications for decades, bandwidth reservation has been increasingly used in recent years for large amounts of data transfer to achieve guaranteed performance. However, effective scheduling strategy to achieve the trade-off between data transfer cost and data transfer performance still remains to be investigated. In this paper, we focus on the trade-off between cost and the most common performance parameter, i.e., completion time, of data transfers using bandwidth reservation in dedicated networks. We consider the scheduling of two types of bandwidth reservation requests regarding such trade-off: (1) to achieve the minimum data transfer cost given the data transfer deadline, and (2) to achieve the earliest data transfer completion time given the maximum data transfer cost. We propose two bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of these two types of bandwidth reservation requests. We then compare the proposed algorithms with two scheduling algorithms originating from one widely used scheduling algorithm in production networks, and the efficacy of the proposed optimal algorithms is verified through extensive simulations.
AB - Because of the solid performance of providing quality of service for various applications for decades, bandwidth reservation has been increasingly used in recent years for large amounts of data transfer to achieve guaranteed performance. However, effective scheduling strategy to achieve the trade-off between data transfer cost and data transfer performance still remains to be investigated. In this paper, we focus on the trade-off between cost and the most common performance parameter, i.e., completion time, of data transfers using bandwidth reservation in dedicated networks. We consider the scheduling of two types of bandwidth reservation requests regarding such trade-off: (1) to achieve the minimum data transfer cost given the data transfer deadline, and (2) to achieve the earliest data transfer completion time given the maximum data transfer cost. We propose two bandwidth reservation algorithms with rigorous optimality proofs to optimize the scheduling of these two types of bandwidth reservation requests. We then compare the proposed algorithms with two scheduling algorithms originating from one widely used scheduling algorithm in production networks, and the efficacy of the proposed optimal algorithms is verified through extensive simulations.
KW - Bandwidth reservation/scheduling
KW - Dynamic provisioning
KW - High-performance networks
KW - QoS
UR - http://www.scopus.com/inward/record.url?scp=85049601823&partnerID=8YFLogxK
U2 - 10.1007/s10922-018-9463-2
DO - 10.1007/s10922-018-9463-2
M3 - Article
AN - SCOPUS:85049601823
VL - 27
SP - 166
EP - 187
JO - Journal of Network and Systems Management
JF - Journal of Network and Systems Management
SN - 1064-7570
IS - 1
ER -