TY - GEN
T1 - On design of scheduling algorithms for advance bandwidth reservation in dedicated networks
AU - Lin, Yunyue
AU - Wu, Qishi
AU - Rao, Nageswara S.V.
AU - Zhu, Mengxia
PY - 2008
Y1 - 2008
N2 - There are an increasing number of high-performance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support largescale data transfer. The available bandwidths on these dedicated links vary over time and therefore efficient bandwidth scheduling algorithms are needed to improve the utilization of network resources and satisfy diverse user requirements. Based on different path and bandwidth constraints, we formulate four instant scheduling problems for a data transfer request: (i) variable path with variable bandwidth (VPVB), (ii) fixed path with variable bandwidth (FPVB), (iii) variable path with fixed bandwidth (VPFB), and (iv) fixed path with fixed bandwidth (FPFB), with the common objective to minimize transfer end time for a given data size. We design an optimal algorithm for each of these scheduling problems with polynomial- or pseudopolynomial-time complexity with respect to the network size and total number of time slots in a bandwidth reservation table.
AB - There are an increasing number of high-performance networks that provision dedicated channels through circuit-switching or MPLS/GMPLS techniques to support largescale data transfer. The available bandwidths on these dedicated links vary over time and therefore efficient bandwidth scheduling algorithms are needed to improve the utilization of network resources and satisfy diverse user requirements. Based on different path and bandwidth constraints, we formulate four instant scheduling problems for a data transfer request: (i) variable path with variable bandwidth (VPVB), (ii) fixed path with variable bandwidth (FPVB), (iii) variable path with fixed bandwidth (VPFB), and (iv) fixed path with fixed bandwidth (FPFB), with the common objective to minimize transfer end time for a given data size. We design an optimal algorithm for each of these scheduling problems with polynomial- or pseudopolynomial-time complexity with respect to the network size and total number of time slots in a bandwidth reservation table.
KW - Bandwidth scheduling
KW - Control plane
KW - Dedicated network
KW - Time slot
UR - http://www.scopus.com/inward/record.url?scp=51049090627&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2008.4544577
DO - 10.1109/INFOCOM.2008.4544577
M3 - Conference contribution
AN - SCOPUS:51049090627
SN - 9781424422197
T3 - Proceedings - IEEE INFOCOM
BT - 2008 IEEE INFOCOM Workshops
T2 - 2008 IEEE INFOCOM Workshops
Y2 - 13 April 2008 through 18 April 2008
ER -