Resource scheduling heuristics for data intensive networks

K. Choi; K. Shroff; D. Katramatos; D. Yu; T. G. Robertazzi

doi:10.1109/LISAT.2009.5031558

Resource scheduling heuristics for data intensive networks

K. Choi, K. Shroff, D. Katramatos, D. Yu, T. G. Robertazzi

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

Abstract

In this work, we consider the adaptive capacity utilization problem for real-time heterogeneous data intensive MPLS (Multiprotocol Label Switching) networks consisting of multiple source and destination nodes. We account for a file transfer scenario taking into account node capacity, file size, file transfer start time, and the deadline of files when determining the explicit capacity of Virtual Paths (VPs) across the backbone. We propose two heuristic algorithms referred to as the Most Conservative (MC) algorithm and the Load Balancing (LB) algorithm using a newly introduced parameter, capacity utilization. These heuristic algorithms are designed to react to file transfers according to the temporal capacity of VPs for multiple source and destination networks.

Original language	English (US)
Title of host publication	2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009
DOIs	https://doi.org/10.1109/LISAT.2009.5031558
State	Published - 2009
Externally published	Yes
Event	2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009 - Farmingdale, NY, United States Duration: May 1 2009 → May 1 2009

Publication series

Name	2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009

Other

Other	2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009
Country/Territory	United States
City	Farmingdale, NY
Period	5/1/09 → 5/1/09

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Electrical and Electronic Engineering

Keywords

Capacity reservation
File transfer
MPLS
Virtual path

Access to Document

10.1109/LISAT.2009.5031558

Cite this

@inproceedings{de3f45f4ad2741b19669b7ac2ec28962,

title = "Resource scheduling heuristics for data intensive networks",

abstract = "In this work, we consider the adaptive capacity utilization problem for real-time heterogeneous data intensive MPLS (Multiprotocol Label Switching) networks consisting of multiple source and destination nodes. We account for a file transfer scenario taking into account node capacity, file size, file transfer start time, and the deadline of files when determining the explicit capacity of Virtual Paths (VPs) across the backbone. We propose two heuristic algorithms referred to as the Most Conservative (MC) algorithm and the Load Balancing (LB) algorithm using a newly introduced parameter, capacity utilization. These heuristic algorithms are designed to react to file transfers according to the temporal capacity of VPs for multiple source and destination networks.",

keywords = "Capacity reservation, File transfer, MPLS, Virtual path",

author = "K. Choi and K. Shroff and D. Katramatos and D. Yu and Robertazzi, {T. G.}",

year = "2009",

doi = "10.1109/LISAT.2009.5031558",

language = "English (US)",

isbn = "9781424423484",

series = "2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009",

booktitle = "2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009",

note = "2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009 ; Conference date: 01-05-2009 Through 01-05-2009",

}

Choi, K, Shroff, K, Katramatos, D, Yu, D & Robertazzi, TG 2009, Resource scheduling heuristics for data intensive networks. in 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009., 5031558, 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009, 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009, Farmingdale, NY, United States, 5/1/09. https://doi.org/10.1109/LISAT.2009.5031558

Resource scheduling heuristics for data intensive networks. / Choi, K.; Shroff, K.; Katramatos, D. et al.
2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009. 2009. 5031558 (2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009).

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

TY - GEN

T1 - Resource scheduling heuristics for data intensive networks

AU - Choi, K.

AU - Shroff, K.

AU - Katramatos, D.

AU - Yu, D.

AU - Robertazzi, T. G.

PY - 2009

Y1 - 2009

N2 - In this work, we consider the adaptive capacity utilization problem for real-time heterogeneous data intensive MPLS (Multiprotocol Label Switching) networks consisting of multiple source and destination nodes. We account for a file transfer scenario taking into account node capacity, file size, file transfer start time, and the deadline of files when determining the explicit capacity of Virtual Paths (VPs) across the backbone. We propose two heuristic algorithms referred to as the Most Conservative (MC) algorithm and the Load Balancing (LB) algorithm using a newly introduced parameter, capacity utilization. These heuristic algorithms are designed to react to file transfers according to the temporal capacity of VPs for multiple source and destination networks.

AB - In this work, we consider the adaptive capacity utilization problem for real-time heterogeneous data intensive MPLS (Multiprotocol Label Switching) networks consisting of multiple source and destination nodes. We account for a file transfer scenario taking into account node capacity, file size, file transfer start time, and the deadline of files when determining the explicit capacity of Virtual Paths (VPs) across the backbone. We propose two heuristic algorithms referred to as the Most Conservative (MC) algorithm and the Load Balancing (LB) algorithm using a newly introduced parameter, capacity utilization. These heuristic algorithms are designed to react to file transfers according to the temporal capacity of VPs for multiple source and destination networks.

KW - Capacity reservation

KW - File transfer

KW - MPLS

KW - Virtual path

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

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

U2 - 10.1109/LISAT.2009.5031558

DO - 10.1109/LISAT.2009.5031558

M3 - Conference contribution

AN - SCOPUS:70349283614

SN - 9781424423484

T3 - 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009

BT - 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009

T2 - 2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009

Y2 - 1 May 2009 through 1 May 2009

ER -

Resource scheduling heuristics for data intensive networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this