• Please send your full manuscript to: jocm@vip.163.com

Matching Algorithm for Real-time Switches to Improve the Schedulable Ratio

J. Zhang, B. Y. Chen, Z. Y. Chen, L. Y. Li, and X. Y. Zhang
School of Science, Hubei University of Technology, Wuhan 430068, P. R. China
Abstract—Commercial Input Queue switch faces many difficulties in real-time industrial communication, so a frame-based matching algorithm is proposed. Unlike other frame-based algorithms, this one does not need to extract and analyze too many characteristics of the matching demand matrix. Moreover, this algorithm schedules in column of the demand matrix and its time complexity of configuration is O(N2M). When applying this algorithm to 10M switch with 8/16/32 ports and 100M switch with 8/16 ports in simulation, compared with other frame-based algorithms, this algorithm can achieve a higher schedulable ratio with the same time complexity. At last, a preliminary discussion is made on solving this problem by genetic algorithm.

Index Terms—Real-time switch; schedulable ratio; frame-based scheduling algorithm; matching algorithm

Cite: J. Zhang, B. Y. Chen, Z. Y. Chen, L. Y. Li, and X. Y. Zhang, "Matching Algorithm for Real-time Switches to Improve the Schedulable Ratio," Journal of Communications, vol. 14, no. 8, pp. 662-668, 2019. Doi: 10.12720/jcm.14.8.662-668
Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com