Advance bandwidth scheduling algorithms in dedicated networks

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

Research output: Contribution to conferencePaperResearchpeer-review

Abstract

An increasing number of high-performance research network testbeds and production networks have the capability of provisioning dedicated channels for high-speed data transfer in support of large-scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared in both time and bandwidth through in-advance reservation among multiple applications. Efficiently allocating the available bandwidth of each component link across future time slots in response to an instant data transfer request is critical to maximizing network resource utilization and meeting diverse end-to-end transport performance requirements. Based on different path and bandwidth constraints, we formulate and investigate five bandwidth scheduling problems that aim to minimize the transfer end time for a given data size. For each of these scheduling problems, we design an optimal algorithm with polynomial-or pseudo-polynomial-time complexity with respect to the network size and total number of time slots in a bandwidth reservation table.

Original languageEnglish
StatePublished - 1 Jan 2008
EventInternational Symposium on Advances in Computer and Sensor Networks and Systems, 2008 - Zhengzhou, China
Duration: 7 Apr 200811 Apr 2008

Other

OtherInternational Symposium on Advances in Computer and Sensor Networks and Systems, 2008
CountryChina
CityZhengzhou
Period7/04/0811/04/08

Fingerprint

Scheduling algorithms
Bandwidth
Data transfer
Telecommunication links
Scheduling
Polynomials
Testbeds

Keywords

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

Cite this

Lin, Y., Wu, Q., Rao, N. S. V., & Zhu, M. (2008). Advance bandwidth scheduling algorithms in dedicated networks. Paper presented at International Symposium on Advances in Computer and Sensor Networks and Systems, 2008, Zhengzhou, China.
Lin, Yunyue ; Wu, Qishi ; Rao, Nageswara S.V. ; Zhu, Michelle. / Advance bandwidth scheduling algorithms in dedicated networks. Paper presented at International Symposium on Advances in Computer and Sensor Networks and Systems, 2008, Zhengzhou, China.
@conference{f7c0271bb44e4295b6db18279a6b2ddc,
title = "Advance bandwidth scheduling algorithms in dedicated networks",
abstract = "An increasing number of high-performance research network testbeds and production networks have the capability of provisioning dedicated channels for high-speed data transfer in support of large-scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared in both time and bandwidth through in-advance reservation among multiple applications. Efficiently allocating the available bandwidth of each component link across future time slots in response to an instant data transfer request is critical to maximizing network resource utilization and meeting diverse end-to-end transport performance requirements. Based on different path and bandwidth constraints, we formulate and investigate five bandwidth scheduling problems that aim to minimize the transfer end time for a given data size. For each of these scheduling problems, we design an optimal algorithm with polynomial-or pseudo-polynomial-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 = "1",
day = "1",
language = "English",
note = "null ; Conference date: 07-04-2008 Through 11-04-2008",

}

Lin, Y, Wu, Q, Rao, NSV & Zhu, M 2008, 'Advance bandwidth scheduling algorithms in dedicated networks' Paper presented at International Symposium on Advances in Computer and Sensor Networks and Systems, 2008, Zhengzhou, China, 7/04/08 - 11/04/08, .

Advance bandwidth scheduling algorithms in dedicated networks. / Lin, Yunyue; Wu, Qishi; Rao, Nageswara S.V.; Zhu, Michelle.

2008. Paper presented at International Symposium on Advances in Computer and Sensor Networks and Systems, 2008, Zhengzhou, China.

Research output: Contribution to conferencePaperResearchpeer-review

TY - CONF

T1 - Advance bandwidth scheduling algorithms in dedicated networks

AU - Lin, Yunyue

AU - Wu, Qishi

AU - Rao, Nageswara S.V.

AU - Zhu, Michelle

PY - 2008/1/1

Y1 - 2008/1/1

N2 - An increasing number of high-performance research network testbeds and production networks have the capability of provisioning dedicated channels for high-speed data transfer in support of large-scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared in both time and bandwidth through in-advance reservation among multiple applications. Efficiently allocating the available bandwidth of each component link across future time slots in response to an instant data transfer request is critical to maximizing network resource utilization and meeting diverse end-to-end transport performance requirements. Based on different path and bandwidth constraints, we formulate and investigate five bandwidth scheduling problems that aim to minimize the transfer end time for a given data size. For each of these scheduling problems, we design an optimal algorithm with polynomial-or pseudo-polynomial-time complexity with respect to the network size and total number of time slots in a bandwidth reservation table.

AB - An increasing number of high-performance research network testbeds and production networks have the capability of provisioning dedicated channels for high-speed data transfer in support of large-scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared in both time and bandwidth through in-advance reservation among multiple applications. Efficiently allocating the available bandwidth of each component link across future time slots in response to an instant data transfer request is critical to maximizing network resource utilization and meeting diverse end-to-end transport performance requirements. Based on different path and bandwidth constraints, we formulate and investigate five bandwidth scheduling problems that aim to minimize the transfer end time for a given data size. For each of these scheduling problems, we design an optimal algorithm with polynomial-or pseudo-polynomial-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=84899148217&partnerID=8YFLogxK

M3 - Paper

ER -

Lin Y, Wu Q, Rao NSV, Zhu M. Advance bandwidth scheduling algorithms in dedicated networks. 2008. Paper presented at International Symposium on Advances in Computer and Sensor Networks and Systems, 2008, Zhengzhou, China.