A Two-way Switch Scheduling Method

Abstract

The invention discloses a co-direction switching scheduling method suitable for a multi-level multi-plane structure network. In a fully configured service matrix with a degree of 2, each element is traversed line by line, and the element with a non-zero value of 1 found for the first time is As a starting point, search for a non-zero value 1 in the row direction and column direction of the element. Among the two non-zero value 1s found, search for the column direction of the non-zero value 1 in the same row and the row direction of the non-zero value 1 in the same column. Non-zero value 1, among the two non-zero value 1s found this time, find a non-zero value 1 in the row direction of the non-zero value 1 in the same column, and in the column direction of the non-zero value 1 in the same row, and so on. Each time a non-zero value element is found, the corresponding element in the business matrix of the connection matrix is ​​updated until all non-zero value elements in the business matrix are processed. In the present invention, two service allocation results can be returned in each step after the starting point is determined, thereby shortening the allocation time of the service matrix to about half of the existing one-way ring algorithm.

Description

technical field [0001] The invention belongs to the technical field of network switching scheduling, and more specifically relates to a bidirectional switching scheduling method based on a ring algorithm. Background technique [0002] A multi-level multi-plane (Multi-Plane and Multi-Stage, MPMS) structure network is currently a commonly used switching network structure. figure 1 It is a schematic diagram of MPMS structure network. Such as figure 1 As shown, the MPMS structure network includes an input module, a switching plane and an output module, and the switching plane is an intermediate module between the input module and the output module. In the exchange scheduling of MPMS structure network, the ring algorithm is a commonly used exchange scheduling algorithm. [0003] In order to better explain the ring algorithm, first define several noun concepts: [0004] Definition 1: The degree of the matrix: The maximum value m of the sum of the elements of each row and the s...

AI Technical Summary

Problems solved by technology

[0018] From the above analysis, it can be seen that in the existing ring algorithm, the algorithm processing direction is unidirectional, and each search can only return one business allocation result, and due to the randomness of the business matrix, the allocation of each business must be completed sequentially , when the business matrix degree is large or the number of intermediate modules is large, the existing ring algorithm takes a long time to obtain the connection matrix and complete the distribution of the business matrix

Images