Same-way exchange scheduling method

Abstract

The invention discloses a same-way exchange scheduling method applied to a multi-plane and multi-stage structural network. In a fully-distributed service matrix with the degree as two, line-by-line traversal is performed on elements, the elements of two nonzero values as one which are found at the first time and are arranged on the same line are taken as the starting point, the nonzero values as one are searched for respectively in the corresponding column direction, the nonzero values as one are searched for respectively in the corresponding line direction of the two found nonzero values as one, and analogizing is sequentially performed. When the nonzero value elements are found each time, corresponding elements in a service matrix connected with the matrix are updated until all nonzero value elements in the service matrix are processed. According to the method, two service distribution results can be returned in each step, and therefore the distributing time of the service matrix is shortened to be half of that of that of an existing single-way ring algorithm.

Description

technical field [0001] The invention belongs to the technical field of network switching scheduling, and more specifically relates to a ring algorithm-based co-directional switching scheduling method. 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 sum o...

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