Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks

There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of highperformance applications. We describe algorithms for scheduling and path computations needed for dedicated bandwidth connections for fixed-slot, highest available bandwidth in a given slot, first available slot, and all-available slots computations. These algorithms for bandwidth scheduling are based on extending the classical breadth-first search, Dijkstra, and Bellman-Ford algorithms. We describe a bandwidth management system for UltraScience Net that incorporates implementations of these algorithms.

• Type: Conference
• Year: 2007
• Where: ICN
• Authors: Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath
• Keywords: All-available Slots Computations, Bandwidth Scheduling, Dedicated Bandwidth Connections, ICN 2007