Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

In-Advance Bandwidth Scheduling In E-Science Networks

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31.0 $31.0
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, books, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

In reality, on-demand scheduling is a special case of in-advance bandwidth scheduling; the future time for each scheduling request is separated from the time at which the request is made by a time interval of zero. Hence, this chapter considers only the in-advance scheduling mode. The development is naturally adapted to the on-demand mode. Much of the research on bandwidth scheduling has focused on reserving a single path for a specified bandwidth request. For on-demand scheduling, this is typically supported by Multiple Protocol Label Switching (MPLS) at layer three and by Generalized MPLS (GMPLS) at layers one and two. The chapter describes temporal network model. In-advance scheduling problems are defined and corresponding algorithms are proposed and evaluated. A multiple path scheduling problem Earliest Finish Time File Transfer Problem (EFTFTP) is proposed and solved by both optimal solutions and heuristics.