On design of scheduling algorithms for advance bandwidth reservation in dedicated networks

Yunyue Lin, Qishi Wu, Nageswara S.V. Rao, Michelle Zhu

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2008 IEEE INFOCOM Workshops
DOIs
StatePublished - 10 Sep 2008
Event2008 IEEE INFOCOM Workshops - Phoenix, AZ, United States
Duration: 13 Apr 200818 Apr 2008

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

Other2008 IEEE INFOCOM Workshops
CountryUnited States
CityPhoenix, AZ
Period13/04/0818/04/08

Fingerprint

Scheduling algorithms
Bandwidth
Data transfer
Scheduling
Switching circuits
Network performance
Telecommunication links
Polynomials

Keywords

  • Bandwidth scheduling
  • Control plane
  • Dedicated network
  • Time slot

Cite this

Lin, Y., Wu, Q., Rao, N. S. V., & Zhu, M. (2008). On design of scheduling algorithms for advance bandwidth reservation in dedicated networks. In 2008 IEEE INFOCOM Workshops [4544577] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2008.4544577
Lin, Yunyue ; Wu, Qishi ; Rao, Nageswara S.V. ; Zhu, Michelle. / On design of scheduling algorithms for advance bandwidth reservation in dedicated networks. 2008 IEEE INFOCOM Workshops. 2008. (Proceedings - IEEE INFOCOM).
@inproceedings{4c7db08e23d14231b596193a58868737,
title = "On design of scheduling algorithms for advance bandwidth reservation in dedicated networks",
abstract = "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.",
keywords = "Bandwidth scheduling, Control plane, Dedicated network, Time slot",
author = "Yunyue Lin and Qishi Wu and Rao, {Nageswara S.V.} and Michelle Zhu",
year = "2008",
month = "9",
day = "10",
doi = "10.1109/INFOCOM.2008.4544577",
language = "English",
isbn = "9781424422197",
series = "Proceedings - IEEE INFOCOM",
booktitle = "2008 IEEE INFOCOM Workshops",

}

Lin, Y, Wu, Q, Rao, NSV & Zhu, M 2008, On design of scheduling algorithms for advance bandwidth reservation in dedicated networks. in 2008 IEEE INFOCOM Workshops., 4544577, Proceedings - IEEE INFOCOM, 2008 IEEE INFOCOM Workshops, Phoenix, AZ, United States, 13/04/08. https://doi.org/10.1109/INFOCOM.2008.4544577

On design of scheduling algorithms for advance bandwidth reservation in dedicated networks. / Lin, Yunyue; Wu, Qishi; Rao, Nageswara S.V.; Zhu, Michelle.

2008 IEEE INFOCOM Workshops. 2008. 4544577 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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, Michelle

PY - 2008/9/10

Y1 - 2008/9/10

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

SN - 9781424422197

T3 - Proceedings - IEEE INFOCOM

BT - 2008 IEEE INFOCOM Workshops

ER -

Lin Y, Wu Q, Rao NSV, Zhu M. On design of scheduling algorithms for advance bandwidth reservation in dedicated networks. In 2008 IEEE INFOCOM Workshops. 2008. 4544577. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2008.4544577