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 proceedingConference 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 languageEnglish (US)
Title of host publication2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009
DOIs
StatePublished - Sep 25 2009
Externally publishedYes
Event2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009 - Farmingdale, NY, United States
Duration: May 1 2009May 1 2009

Publication series

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

Other

Other2009 IEEE Long Island Systems, Applications and Technology Conference, LISAT 2009
CountryUnited States
CityFarmingdale, NY
Period5/1/095/1/09

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Capacity reservation
  • File transfer
  • MPLS
  • Virtual path

Fingerprint Dive into the research topics of 'Resource scheduling heuristics for data intensive networks'. Together they form a unique fingerprint.

Cite this