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

Yunyue Lin; Qishi Wu; Nageswara S.V. Rao; Mengxia Zhu

doi:10.1109/INFOCOM.2008.4544577

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

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

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 language	English
Title of host publication	2008 IEEE INFOCOM Workshops
DOIs	https://doi.org/10.1109/INFOCOM.2008.4544577
State	Published - 2008
Event	2008 IEEE INFOCOM Workshops - Phoenix, AZ, United States Duration: Apr 13 2008 → Apr 18 2008

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Conference

Conference	2008 IEEE INFOCOM Workshops
Country/Territory	United States
City	Phoenix, AZ
Period	04/13/08 → 04/18/08

Keywords

Bandwidth scheduling
Control plane
Dedicated network
Time slot

Access to Document

10.1109/INFOCOM.2008.4544577

Cite this

@inproceedings{972e30e8484e46b89113b898ac4785af,

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 Mengxia Zhu",

year = "2008",

doi = "10.1109/INFOCOM.2008.4544577",

language = "English",

isbn = "9781424422197",

series = "Proceedings - IEEE INFOCOM",

booktitle = "2008 IEEE INFOCOM Workshops",

note = "2008 IEEE INFOCOM Workshops ; Conference date: 13-04-2008 Through 18-04-2008",

}

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 - https://www.scopus.com/pages/publications/51049090627

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 -

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this