TY - GEN
T1 - On bandwidth reservation for optimal resource utilization in high-performance networks
AU - Dharam, Poonam
AU - Wu, Qishi
AU - Zhu, Mengxia
PY - 2012
Y1 - 2012
N2 - Many high-performance networks support both advance and immediate bandwidth reservations, the former reserving bandwidth ahead of time in a future time slot to provide guaranteed bandwidth, while the latter allocating bandwidth upon availability in the next immediate time slot. As a result, an ongoing data transfer task based on an immediate reservation may be preempted by the activation of an advance reservation due to the lack of bandwidth. We propose a bandwidth reservation solution to optimize network resource utilization by exploring the interactions between advance and immediate reservations. This solution integrates two major interrelated components: (i) We design a scheduling algorithm based on rigorous statistical analysis of reservation dynamics to route incoming advance reservations with minimal impact on immediate reservations. (ii) We design a preemption scheme to minimize the actual number of immediate reservations that must be preempted at runtime due to insufficient bandwidth. The performance superiority of the proposed bandwidth reservation solution is illustrated by extensive simulations in comparison with existing methods.
AB - Many high-performance networks support both advance and immediate bandwidth reservations, the former reserving bandwidth ahead of time in a future time slot to provide guaranteed bandwidth, while the latter allocating bandwidth upon availability in the next immediate time slot. As a result, an ongoing data transfer task based on an immediate reservation may be preempted by the activation of an advance reservation due to the lack of bandwidth. We propose a bandwidth reservation solution to optimize network resource utilization by exploring the interactions between advance and immediate reservations. This solution integrates two major interrelated components: (i) We design a scheduling algorithm based on rigorous statistical analysis of reservation dynamics to route incoming advance reservations with minimal impact on immediate reservations. (ii) We design a preemption scheme to minimize the actual number of immediate reservations that must be preempted at runtime due to insufficient bandwidth. The performance superiority of the proposed bandwidth reservation solution is illustrated by extensive simulations in comparison with existing methods.
KW - High-performance networks
KW - bandwidth scheduling
KW - reservation preemption
UR - http://www.scopus.com/inward/record.url?scp=84874332622&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84874332622&partnerID=8YFLogxK
U2 - 10.1109/LCN.2012.6423592
DO - 10.1109/LCN.2012.6423592
M3 - Conference contribution
AN - SCOPUS:84874332622
SN - 9781467315647
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 144
EP - 147
BT - Proceedings of the 37th Annual IEEE Conference on Local Computer Networks, LCN 2012
T2 - 37th Annual IEEE Conference on Local Computer Networks, LCN 2012
Y2 - 22 October 2012 through 25 October 2012
ER -