Method for Complex Coloring Based Parallel Scheduling for Switching Network

1. A method for complex coloring based parallel scheduling for a switching network, comprising: providing a N×N switching network having N input ports and N output ports, each of the N input ports being provided with an input buffer queue and sending at most one data cell in a timeslot, and each of the N output ports receiving at most one data cell in the timeslot at the same time, and a period of the timeslot f is a frame, mapping the N×N switching network to a bipartite graph G k =(V ∪U, E) based on data cells of a kth frame having a vertex v i ϵV representing one of the input ports i, a vertex u j ϵU representing one of the output ports j, and an edge e m (v i , u j ) ϵE representing an mth data cell going from the input port i to the output port j, mapping timeslots for scheduling to a color set C={c 1 , c 2 , . . . , c Δ }, i, j=1, 2,. . . , N, while Δ being the maximum vertex degree of all the vertexes, splitting each of all the edges e m (v i , u j ) ϵE of the bipartite graph to a pair of links, and coloring each of the links by the vertex connected thereto to ensure that the links connected to the same vertex are colored differently, which is called a consistent coloring of the bipartite graph, performing color exchange operations on the vertexes to obtain a proper coloring scheme where the color of the two links belonging to the same edge are identically colored and all the edges connected to the same vertex are differently colored, and successively setting up communication connections with corresponding input ports and output ports and sending corresponding data packets for data cell transmission after the proper coloring of the bipartite graph is obtained, where the connection pattern of the switch in the timeslot is determined by a set of edges with the color corresponding to the current timeslot.

2. The method for complex coloring based parallel scheduling for the switching network of claim 1 , wherein rules for coloring the links and for the color exchange are: if the link is in G k as well as G k-1 , coloring it with the corresponding color of that in the proper coloring of G k-1 ; otherwise, coloring it with the first available color in the color set of the end vertex; continuing to assign colors to the links until each of the edges is assigned a pair of color to the pair of the links, named as a complex coloring, a constant being the two links corresponding to the same edge having the same color and a variable being the two links corresponding to the same edge having different colors, arbitrarily exchanging the colors of the two links connected to the same vertex, so that the variables walk on the corresponding two-colored path such that they hit each other and are eliminated eventually, and if the vertex has no corresponding link to exchange the color with the variable, assigning the variable with a required color and a bipartite graph is obtained when all the variables are eliminated; if a few variables are not eliminated within a setting maximum time limit, leave the variables to the next frame for rescheduling.