CPC H04L 45/121 (2013.01) [H04L 45/123 (2013.01); H04L 45/3065 (2013.01); H04L 45/42 (2013.01); H04L 45/64 (2013.01)] | 25 Claims |
1. A method of determining the shortest path from a talker device to a listener device through a time-sensitive software defined network (TsSDN), comprising:
in a TsSDN comprising a TsSDN controller and plurality of network devices, the TsSDN having one or more paths through which traffic from a talker device can be routed to a listener device, assigning to each link between adjacent devices in the one or more paths a cost;
determining, based on the cost of links, a first path that is the shortest path for routing traffic from the talker device to the listener device, wherein the shortest path has the lowest cost;
detecting a change in one or more parameters associated with at least one link in the one or more paths, wherein the one or more parameters includes load;
dynamically recalculating the cost of links in response to detecting the change; and
determining from the recalculated cost of links a second path as the shortest path for routing the traffic from the talker device to the listener device;
the method further comprising determining the traffic from the talker device to be time-sensitive or non-time-sensitive, wherein the shortest path from the talker device to the listener device is through only the time-sensitive network devices when the traffic from the talker device is determined to be time-sensitive, and wherein the shortest path from the talker device to the listener device is through only the non-time-sensitive network devices when the traffic from the talker device is determined to be non-time-sensitive.
|