By Topic

Resource scheduling heuristics for data intensive networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Choi, K. ; Electr. & Comput. Eng. Dept., Stony Brook Univ., Stony Brook, NY ; Shroff, K. ; Katramatos, D. ; Yu, D.
more authors

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.

Published in:

Systems, Applications and Technology Conference, 2009. LISAT '09. IEEE Long Island

Date of Conference:

1-1 May 2009