Research on Weighted Scheduling Algorithm for Clos Networks with Cache at Input and Output Levels

The weighted scheduling algorithm of existing Clos networks with MSM structure provides high throughput performance, but also has high algorithm complexity and high inter-level communication overhead. To solve this problem, a distributed weighted matching scheduling algorithm (DWMD) is proposed in this paper, which can achieve 100% throughput with relatively low algorithm complexity and minimal inter-stage communication overhead. In the distributed weighted matching scheduling algorithm, each input module distributes the request token evenly to all intermediate level modules. The virtual token counter set in the intermediate level module counts requests, and executes the weight-based matching algorithm independently and distributed based on the locally maintained request counter values. The input module sends the cell according to the feedback matching result. In this paper, we consider the two cases using the heuristic weighted matching algorithm (iLQF) and the stochastic weighted matching algorithm (SERENA) in CM.