Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies

Routing Algorithms for Packet/Circuit Switching in Optical Multi-log2N Networks

“…The eight routing algorithms and their main strategies are summarized in the Table 1. 3.1 Traditional Routing Algorithms (i) Random (R). For a request, the R algorithm [2], [3] selects a plane randomly among all the available planes for this request, if any. One possible routing result is as follows:…”

“…The routing algorithm is important for the operation and efficiency of a switch, since it directly affects the overall switch hardware cost and also the switching speed. By now, several routing algorithms have been proposed for multi-log 2 N networks, such as random routing [2]- [4], packing [2], save the unused [2], etc. It is notable that the available results on routing algorithms of multi-log 2 N networks mainly focus on the nonblocking condition analysis when a specified routing algorithm is applied [1], [2], [5]- [8].…”

“…By now, several routing algorithms have been proposed for multi-log 2 N networks, such as random routing [2]- [4], packing [2], save the unused [2], etc. It is notable that the available results on routing algorithms of multi-log 2 N networks mainly focus on the nonblocking condition analysis when a specified routing algorithm is applied [1], [2], [5]- [8]. The recent results in [2] indicate that although some routing algorithms are apparently very different, such as save the unused, packing, minimum index, etc., they actually require a same number of planes to guarantee the nonblocking property of multilog 2 N networks.…”

“…It is notable that the available results on routing algorithms of multi-log 2 N networks mainly focus on the nonblocking condition analysis when a specified routing algorithm is applied [1], [2], [5]- [8]. The recent results in [2] indicate that although some routing algorithms are apparently very different, such as save the unused, packing, minimum index, etc., they actually require a same number of planes to guarantee the nonblocking property of multilog 2 N networks. The results in [2] also imply that a very high hardware cost (in terms of number of planes) is required to guarantee the nonblocking property, which makes the nonblocking design of multi-log 2 N networks impractical for real applications.…”

“…The recent results in [2] indicate that although some routing algorithms are apparently very different, such as save the unused, packing, minimum index, etc., they actually require a same number of planes to guarantee the nonblocking property of multilog 2 N networks. The results in [2] also imply that a very high hardware cost (in terms of number of planes) is required to guarantee the nonblocking property, which makes the nonblocking design of multi-log 2 N networks impractical for real applications. The blocking design of multi-log 2 N networks is a promising approach to significantly reducing the hardware cost [4].…”