%0 Journal Article
%A GAO Ya
%A LI Jun
%A QIU Zhi-liang
%A ZHANG Mao-sen
%T Randomized Weight Matching Dispatching Scheme for Clos-Network Switches
%D 2013
%R 10.13190/jbupt.201304.91.gaoy
%J Journal of Beijing University of Posts and Telecommunications
%P 90-94
%V 36
%N 4
%X <p>The current dispatching schemes for memory-space-memory (MSM) Clos-network switches provide 100% throughput under admissible traffics but with higher algorithm complexity. A low-complexity and distributed scheduling algorithm, called randomized weight matching dispatching scheme (RWMD), is proposed. Under this approach, each input module balances requests among central modules, and each central module can carry out scheduling algorithm concurrently and independently, where the memory and the randomness of the arrival process are used for matching. With single iteration and less information exchange between stages, RWMD reduces the communication overhead greatly. Simulation shows that RWMD can achieve 100% throughput under uniform and non-uniform traffics.</p>
%U https://journal.bupt.edu.cn/EN/10.13190/jbupt.201304.91.gaoy