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 proceedingConference contributionpeer-review

14 Scopus citations


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
StatePublished - 2008
Event2008 IEEE INFOCOM Workshops - Phoenix, AZ, United States
Duration: 13 Apr 200818 Apr 2008

Publication series

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


Other2008 IEEE INFOCOM Workshops
Country/TerritoryUnited States
CityPhoenix, AZ


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


Dive into the research topics of 'On design of scheduling algorithms for advance bandwidth reservation in dedicated networks'. Together they form a unique fingerprint.

Cite this