By Topic

An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented 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
$33 $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

4 Author(s)
Eun-Sung Jung ; Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL ; Yan Li ; Sanjay Ranka ; Sartaj Sahni

Several bandwidth management systems have been developed to reserve, in advance, dedicated connections for high-performance applications. We describe the in-advance reservation capabilities of these systems as well as the bandwidth scheduling and path computation algorithms used. An analytical and experimental evaluation of these algorithms also is provided. Our experiments indicate that for the fixed-slot problem, the minimum-hop feasible path algorithm proposed by us in [8] maximizes network utilization for large networks while the dynamic adaptive feasible path algorithm proposed in this paper does this for small networks.

Published in:

2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

Date of Conference:

7-9 May 2008