TY - GEN
T1 - Distributed Scheduling for Advance Bandwidth Reservation in High-Performance Networks
AU - Wu, Qishi
AU - Lin, Yunyue
PY - 2012
Y1 - 2012
N2 - High-performance networks are capable of provisioning dedicated channels through circuit/lambda-switching or MPLS/GMPLS techniques to support large-scale data transfer. These dedicated links are typically shared by multiple users through advance resource reservations, resulting in varying bandwidth availability in future time periods. Most previous efforts were focused on centralized bandwidth scheduling to improve the utilization of network resources and meet the transport requirements of application users. These centralized scheduling schemes imply the use of a central control plane, posing significant reliability and scalability challenges as the network size rapidly grows. We propose distributed algorithms for path computation and bandwidth scheduling in response to four basic bandwidth reservation requests: (i) fixed bandwidth in a fixed slot, (ii) highest bandwidth in a fixed slot, (iii) first slot with fixed bandwidth and duration, and (iv) all slots with fixed bandwidth and duration. These algorithms are developed through a rigorous extension of the classical breadth first search and Bellman-Ford algorithms to a completely distributed manner, and their performances are evaluated and analyzed through extensive simulations.
AB - High-performance networks are capable of provisioning dedicated channels through circuit/lambda-switching or MPLS/GMPLS techniques to support large-scale data transfer. These dedicated links are typically shared by multiple users through advance resource reservations, resulting in varying bandwidth availability in future time periods. Most previous efforts were focused on centralized bandwidth scheduling to improve the utilization of network resources and meet the transport requirements of application users. These centralized scheduling schemes imply the use of a central control plane, posing significant reliability and scalability challenges as the network size rapidly grows. We propose distributed algorithms for path computation and bandwidth scheduling in response to four basic bandwidth reservation requests: (i) fixed bandwidth in a fixed slot, (ii) highest bandwidth in a fixed slot, (iii) first slot with fixed bandwidth and duration, and (iv) all slots with fixed bandwidth and duration. These algorithms are developed through a rigorous extension of the classical breadth first search and Bellman-Ford algorithms to a completely distributed manner, and their performances are evaluated and analyzed through extensive simulations.
KW - bandwidth reservation
KW - distributed scheduling
KW - high- performance networks
UR - http://www.scopus.com/inward/record.url?scp=84885011981&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84885011981&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-29222-4_27
DO - 10.1007/978-3-642-29222-4_27
M3 - Conference contribution
AN - SCOPUS:84885011981
SN - 9783642292217
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 375
EP - 391
BT - Quality, Reliability,Security and Robustness in Heterogeneous Networks - 7th Int. Conf. on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010 and DSRC 2010.
T2 - 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range CommunicationsWorkshop, DSRC 2010
Y2 - 17 November 2010 through 19 November 2010
ER -