Toward flexible and fast routing strategies for dynamic network provisioning

Liudong Zuo, Michelle Zhu

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

Reserving bandwidth as needed in high-performance networks makes the fast and reliable data transfer with guaranteed performance possible in large-scale collaborative e-science. Besides the notification of acceptance or rejection for a particular reservation request, users normally want to know the earliest possible finish time or the minimum total transfer duration for the data transfer. Several routing algorithms have been proposed to achieve such desired goals given the data size, the data available time, and the deadline to finish the data transfer. Instead of directly processing the bandwidth reservation request (BRR) from users, our approach analyses various parameters to strategically narrow down the solution search space for fast system response. Adapted from some previous works, two algorithms are proposed to compute the reservation options with the earliest completion time (ECT) and with the shortest duration (SD) for multiple BRRs accumulated during a certain period. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of reduced execution time and improved success ratio of BRRs in comparison with existing scheduling algorithms.

Original languageEnglish
Pages2222-2225
Number of pages4
DOIs
StatePublished - 1 Jan 2013
Event2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013 - Boston, MA, United States
Duration: 20 May 201324 May 2013

Other

Other2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
CountryUnited States
CityBoston, MA
Period20/05/1324/05/13

Fingerprint

Reservation
Dynamic Networks
Data Transfer
Data transfer
Routing
Bandwidth
E-Science
Completion Time
Deadline
Routing algorithms
Routing Algorithm
Network performance
Scheduling algorithms
Rejection
Scheduling Algorithm
Search Space
Execution Time
High Performance
Processing
Demonstrate

Keywords

  • bandwidth reservation
  • dynamic provisioning
  • high-performance networks

Cite this

Zuo, L., & Zhu, M. (2013). Toward flexible and fast routing strategies for dynamic network provisioning. 2222-2225. Paper presented at 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, Boston, MA, United States. https://doi.org/10.1109/IPDPSW.2013.50
Zuo, Liudong ; Zhu, Michelle. / Toward flexible and fast routing strategies for dynamic network provisioning. Paper presented at 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, Boston, MA, United States.4 p.
@conference{dea524af286f410f97ac3714c7a7444d,
title = "Toward flexible and fast routing strategies for dynamic network provisioning",
abstract = "Reserving bandwidth as needed in high-performance networks makes the fast and reliable data transfer with guaranteed performance possible in large-scale collaborative e-science. Besides the notification of acceptance or rejection for a particular reservation request, users normally want to know the earliest possible finish time or the minimum total transfer duration for the data transfer. Several routing algorithms have been proposed to achieve such desired goals given the data size, the data available time, and the deadline to finish the data transfer. Instead of directly processing the bandwidth reservation request (BRR) from users, our approach analyses various parameters to strategically narrow down the solution search space for fast system response. Adapted from some previous works, two algorithms are proposed to compute the reservation options with the earliest completion time (ECT) and with the shortest duration (SD) for multiple BRRs accumulated during a certain period. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of reduced execution time and improved success ratio of BRRs in comparison with existing scheduling algorithms.",
keywords = "bandwidth reservation, dynamic provisioning, high-performance networks",
author = "Liudong Zuo and Michelle Zhu",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/IPDPSW.2013.50",
language = "English",
pages = "2222--2225",
note = "null ; Conference date: 20-05-2013 Through 24-05-2013",

}

Zuo, L & Zhu, M 2013, 'Toward flexible and fast routing strategies for dynamic network provisioning' Paper presented at 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, Boston, MA, United States, 20/05/13 - 24/05/13, pp. 2222-2225. https://doi.org/10.1109/IPDPSW.2013.50

Toward flexible and fast routing strategies for dynamic network provisioning. / Zuo, Liudong; Zhu, Michelle.

2013. 2222-2225 Paper presented at 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, Boston, MA, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Toward flexible and fast routing strategies for dynamic network provisioning

AU - Zuo, Liudong

AU - Zhu, Michelle

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Reserving bandwidth as needed in high-performance networks makes the fast and reliable data transfer with guaranteed performance possible in large-scale collaborative e-science. Besides the notification of acceptance or rejection for a particular reservation request, users normally want to know the earliest possible finish time or the minimum total transfer duration for the data transfer. Several routing algorithms have been proposed to achieve such desired goals given the data size, the data available time, and the deadline to finish the data transfer. Instead of directly processing the bandwidth reservation request (BRR) from users, our approach analyses various parameters to strategically narrow down the solution search space for fast system response. Adapted from some previous works, two algorithms are proposed to compute the reservation options with the earliest completion time (ECT) and with the shortest duration (SD) for multiple BRRs accumulated during a certain period. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of reduced execution time and improved success ratio of BRRs in comparison with existing scheduling algorithms.

AB - Reserving bandwidth as needed in high-performance networks makes the fast and reliable data transfer with guaranteed performance possible in large-scale collaborative e-science. Besides the notification of acceptance or rejection for a particular reservation request, users normally want to know the earliest possible finish time or the minimum total transfer duration for the data transfer. Several routing algorithms have been proposed to achieve such desired goals given the data size, the data available time, and the deadline to finish the data transfer. Instead of directly processing the bandwidth reservation request (BRR) from users, our approach analyses various parameters to strategically narrow down the solution search space for fast system response. Adapted from some previous works, two algorithms are proposed to compute the reservation options with the earliest completion time (ECT) and with the shortest duration (SD) for multiple BRRs accumulated during a certain period. Extensive simulation results demonstrate the superiority of the proposed algorithms in terms of reduced execution time and improved success ratio of BRRs in comparison with existing scheduling algorithms.

KW - bandwidth reservation

KW - dynamic provisioning

KW - high-performance networks

UR - http://www.scopus.com/inward/record.url?scp=84899741142&partnerID=8YFLogxK

U2 - 10.1109/IPDPSW.2013.50

DO - 10.1109/IPDPSW.2013.50

M3 - Paper

AN - SCOPUS:84899741142

SP - 2222

EP - 2225

ER -

Zuo L, Zhu M. Toward flexible and fast routing strategies for dynamic network provisioning. 2013. Paper presented at 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, Boston, MA, United States. https://doi.org/10.1109/IPDPSW.2013.50