Method and systems for bandwidth scheduling and path computation for connection-oriented networks
View Patent ↗A connection-oriented network includes a control server. The control server receives requests to establish and utilize dedicated channels in the network. The control server utilizes various scheduling methods and algorithms to determine channels based on the request's requirements and resources of the network. For example, the control server may determine a channel based on: (i) a specified bandwidth in a specified time slot, (ii) highest available bandwidth in a specified time slot, (iii) earliest available time with a specified bandwidth and duration, and (iv) all available time slots with a specified bandwidth and duration.
1. A system for controlling access to a network, comprising:
an interface configured to receive a request to establish a dedicated channel in a network, the request comprising a source endpoint and a destination endpoint, and a start time for the channel or a duration for the channel;
a bandwidth scheduler coupled to the interface and configured to determine a feasible path for the dedicated channel across the network based on the request and resources of the network; and
a signaling daemon configured to generate a control signal based on the determined feasible path.
2. The system of claim 1 , wherein the interface comprises a network interface configured to receive requests for the dedicated channel in the network and for sending the generated control signal to the network.
3. The system of claim 2 , wherein the interface is further configured to authenticate the identity of an entity transmitting the request.
4. The system of claim 1 , further comprising:
a memory coupled to the bandwidth scheduler, signaling daemon, and interface configured to store the determined time continuous path and the control signals.
5. The system of claim 1 , wherein the bandwidth scheduler is configured to:
determine a maximum bandwidth available for the channel having the requested endpoints at the requested start time for the requested duration in the network; and
select a feasible unique time continuous path with the maximum bandwidth as the path of the channel.
6. The system of claim 1 , wherein the bandwidth scheduler is configured to:
generate an earliest start time for an available channel with a bandwidth for the requested duration;
perform an extended breadth first search to determine at least one feasible path between the requested endpoints with the requested bandwidth for the requested duration beginning at the generated earliest start time; and
select the at least one feasible path as the path of the channel.
7. The system of claim 1 , wherein the bandwidth scheduler is configured to:
generate, using an extended Bellman-Ford algorithm, a list of start times of available paths between the requested endpoints for the channel in the network with a bandwidth for the requested duration;
and perform an extended breadth first search to determine at least one feasible path between the requested end points with the bandwidth for the requested duration beginning at a user selected start time from the generated list of start times; and
select the at least one feasible unique time continuous path as the path of the channel.
8. The system of claim 1 , wherein the bandwidth scheduler is configured to:
generate using an extended Floyd algorithm, a list of start times of paths between all locations in the network with a bandwidth for the requested duration and generate at least one feasible path between a set of user selected endpoints and a user selected generated start time with the bandwidth for the desired duration; and
select the at least one feasible path as the path of the channel.
9. The system of claim 1 , wherein the system comprises at least one computer including at least one interface, at least one bandwidth scheduler, and at least one signaling daemon.
10. The system of claim 1 , wherein the system comprises multiple computers, each computer including at least one bandwidth scheduler configured to cooperatively control access to the network.
11. A method for transferring data, comprising:
receiving a request to establish a dedicated channel in a network, the request comprising a source endpoint and a start time for the channel or a duration of the channel;
determining a feasible path for the dedicated channel across the network based on the request and resources of the network by a processor; and
scheduling the channel based on the determination.
12. The method of claim 11 , wherein the request to establish the channel comprises a request for immediate establishment of the channel across the network.
13. The method of claim 11 , wherein the request to establish the channel comprises a request for establishment of the channel across the network at a later time.
14. The method of claim 11 , wherein scheduling the channel comprises:
storing information about the determined feasible path and channel; and
transmitting information about the determined feasible path and channel to components of the network.
15. The method of claim 11 , wherein receiving the request includes receiving authenticated information about an entity requesting the channel.
16. The method of claim 11 , further comprising:
determining a maximum bandwidth available for the channel having the requested endpoints; and
selecting at least one feasible path with the maximum bandwidth as the path of the channel.
17. The method of claim 11 , further comprising:
generating the earliest start time at which a channel with the user provided end points and the requested duration;
performing an extended breadth first search to determine at least one feasible path between the end points of the requested channel and having a bandwidth for the requested duration beginning at the generated earliest start time; and
selecting the at least one feasible path as the path of the channel.
18. The method of claim 11 , further comprising:
generating, using an extended Bellman-Ford algorithm, a list of start times of available paths between the requested endpoints for the channel in the network with a bandwidth for the requested duration;
performing an extended breadth first search to determine at least one feasible path between the requested end points with the bandwidth for the requested duration; and
selecting the at least one feasible path as the path of the channel.
19. The method of claim 11 , further comprising:
generating, using an extended Floyd algorithm, a list of start times of paths between all locations in the network with a bandwidth for the requested duration;
generating at least one feasible path between a set of user selected endpoints and a user selected generated start time with the bandwidth for the requested duration; and
selecting the at least one feasible unique time continuous paths as the path of the channel.
20. A non-transitory computer readable storage medium encoded thereon computer-readable instructions when executed causing a processor to perform the method of claim 11 .
21. A computer, comprising:
a processor;
an interface coupled to the processor configured to receive a request to establish a dedicated channel in a network, the request comprising a source endpoint and a destination endpoint, and a start time for the channel or a duration of the channel; and
a memory coupled to the processor and interface, the memory containing instructions for causing the processor to determine a feasible path of the dedicated channel across the network based on the request and resources of the network, and to schedule the channel based on the determination.