摘要 |
A telecommunications system includes a source node. The system includes a plurality of destination nodes. The system includes a network having links and end stations. The system includes a plurality of switches that create paths along links between the source nodes and the destination nodes where there is 100% efficiency along the paths with the paths traversing any link only once to the corresponding destination node from the source node, and the path being a shortest path between the source node and the destination node, where each switch has a Dijkstra computation complexity of O(N) in regard to forming the shortest paths. A method for telecommunications includes the steps of creating paths with a plurality of switches along links of a network between a source node and a plurality of destination nodes where there is 100% efficiency along the paths with the paths traversing any link only once to the corresponding destination node from the source node, and each path being a shortest path between the source node and the destination node, where each switch has a Dijkstra computation complexity of O(N) in regard to forming the shortest paths. There is the step of delivering with the switches frames from the source node to the destination nodes along the shortest paths.
|