TY - GEN
T1 - Advance bandwidth scheduling with minimal impact on immediate reservations in high-performance networks
AU - Wu, Qishi
AU - Dharam, Poonam
PY - 2012
Y1 - 2012
N2 - Many network-intensive applications in various science, engineering, and business domains require high bandwidths to support large-scale data transfer over long distances. Such bandwidth requirements give rise to the development and deployment of high-performance networks that are capable of provisioning dedicated channels with reserved bandwidths through circuit/lambda-switching or MPLS/GMPLS techniques. We consider 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 formulate the advance bandwidth scheduling problem to minimize the impact on immediate reservations. Based on rigorous statistical analysis of reservation dynamics, we propose a scheduling solution to route incoming advance reservations such that the number of preempted immediate reservations by the advance reservations is minimized. The performance superiority of the proposed scheduling solution is illustrated by extensive simulations in comparison with existing algorithms.
AB - Many network-intensive applications in various science, engineering, and business domains require high bandwidths to support large-scale data transfer over long distances. Such bandwidth requirements give rise to the development and deployment of high-performance networks that are capable of provisioning dedicated channels with reserved bandwidths through circuit/lambda-switching or MPLS/GMPLS techniques. We consider 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 formulate the advance bandwidth scheduling problem to minimize the impact on immediate reservations. Based on rigorous statistical analysis of reservation dynamics, we propose a scheduling solution to route incoming advance reservations such that the number of preempted immediate reservations by the advance reservations is minimized. The performance superiority of the proposed scheduling solution is illustrated by extensive simulations in comparison with existing algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84864197459&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864197459&partnerID=8YFLogxK
U2 - 10.1109/NOMS.2012.6211985
DO - 10.1109/NOMS.2012.6211985
M3 - Conference contribution
AN - SCOPUS:84864197459
SN - 9781467302685
T3 - Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012
SP - 679
EP - 682
BT - Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012
T2 - 2012 IEEE Network Operations and Management Symposium, NOMS 2012
Y2 - 16 April 2012 through 20 April 2012
ER -