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.
['Eun-Sung Jung', 'Yan Li', 'Sanjay Ranka', 'Sartaj Sahni']
An Evaluation of In-Advance Bandwidth Scheduling Algorithms for Connection-Oriented Networks