CN101309222B - Method, apparatus and system for regulating network routing - Google Patents

Abstract

The invention discloses a network route adjusting method, which includes that the situation that if at least two route paths with the same second level exchange units and the third level exchange units exist is detected; if the route paths exist, a route path is searched out; wherein, the searched route path has the same first level exchange unit, a different second level exchange unit and a different third level exchange unit with that of one of the at least two route paths; the third level exchange unit of the route path in the at least two route paths is exchanged with the third level exchange unit of the searched route path; the invention also provides a device and a system which adjust the network route; the method, the device and the system which adjust the network route can avoid the route congestion in the network which has at least a three-level symmetry structure and ensure the network exchange purpose that any one of the input ports can be connected with any one of the output ports; not only the number of the switch node is saved, but also the performance of the device is guaranteed effectively.

Description

A kind of method, Apparatus and system of adjusting the network route

Technical field

The present invention relates to network communications technology field, be specifically related to a kind of method, Apparatus and system of adjusting the network route.

Background technology

The CLOS network is proposed in nineteen fifty-three by Charles Clos, and typical C LOS network is three grades of symmetrical networks, and is as shown in Figure 1.Three grades: stage1, stage2, stage3, symmetry: lambda line number=outlet number, total inbound port number and total outbound port number average are N.Marked direction among Fig. 1, do not had direction, only represented annexation but be actually.

N representes the input port quantity of Stage1, also is the output port quantity of Stage3; M representes the output port quantity of Stage1, also is the input port quantity of Stage3; R representes input, the output port quantity of Stage2.It is thus clear that Stage1 has the crosspoint of r n*m, Stage2 has the crosspoint of m r*r, and Stage3 has the crosspoint of r m*n, and total input, output port are counted N=n*r.

The principle of CLOS network is: any unit, all there is and has only a connection all unit to next stage or previous stage.If two or the routed path more than two are arranged, have the crosspoint of two identical adjacent levels, then these two routed paths block.

In the CLOS network, not unique from the routed path that is input to output, different according to the selection of intergrade, can select different paths.Intergrade is many more, and selectable path is just many more, and the probability of obstruction is just more little.When satisfying m >=2n-1, this CLOS network configuration satisfies strictly non-blocking.When satisfying n≤m＜2n-1, this CLOS network satisfies rearrangeable choke free condition.When satisfying m＜n, this CLOS network is that blocking network is arranged.

When the CLOS network satisfies condition n≤m＜2n-1, be rearrangeable clog-free CLOS network.With respect to strictly non-blocking CLOS network; Rearrangeable clog-free CLOS network can use less switching node quantity; Reach the purpose that any input port is connected to any output port exchange equally, but this is not to refer to that this complete network does not have internal competition yet.In rearrangeable clog-free CLOS network,, be the problem that needs solution if how cause clogging makes network not block through readjusting route.

Summary of the invention

In view of this, the embodiment of the invention provides a kind of method, Apparatus and system of adjusting the network route, when the network cause clogging, through readjusting route the CLOS network is not blocked.

The embodiment of the invention provides a kind of method of adjusting the network route; The symmetrical network that is used for one at least three grades carries out the route adjustment; This symmetrical network of at least three grades comprises first order crosspoint, second level crosspoint, third level crosspoint; The routed path that this symmetrical network of at least three grades provides is by first order crosspoint, second level crosspoint and third level crosspoint sign, and this method comprises:

Detect and whether have at least two routed paths with identical second level crosspoint and third level crosspoint; If exist; Find out the 3rd routed path; The 3rd routed path that wherein finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in above-mentioned at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint;

The third level crosspoint of third level crosspoint in article one path in above-mentioned at least two routed paths and above-mentioned the 3rd routed path that finds out is exchanged.

The embodiment of the invention also provides a kind of device of adjusting the network route; The symmetrical network that is used for one at least three grades carries out the route adjustment; This symmetrical network of at least three grades comprises first order crosspoint, second level crosspoint, third level crosspoint; The routed path that this symmetrical network of at least three grades provides is by first order crosspoint, second level crosspoint and third level crosspoint sign, and this device comprises:

Memory cell is used to store above-mentioned routed path; Detecting unit is used for the routed path that the detection of stored unit is stored, and whether has at least two routed paths with identical second level crosspoint and third level crosspoint;

Search the unit; Be used for when detection when having above-mentioned at least two routed paths; Find out the 3rd routed path; The 3rd routed path that wherein finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in above-mentioned at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint;

Route control unit is used for the third level crosspoint of third level crosspoint in article one path of above-mentioned at least two routed paths and above-mentioned the 3rd routed path that finds out is exchanged, the routed path of updated stored unit storage.

The embodiment of the invention also provides a kind of system that adjusts the network route; Comprise first device and second device; Second device comprises first order crosspoint, second level crosspoint, third level crosspoint at least; The routed path that second device provides is by first order crosspoint, second level crosspoint and third level crosspoint sign, wherein:

First device is used for detecting second device, whether has at least two routed paths with identical second level crosspoint and third level crosspoint; If exist; Find out the 3rd routed path; The 3rd routed path that wherein finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in above-mentioned at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint; Control second device exchanges the third level crosspoint of third level crosspoint in article one path in above-mentioned at least two routed paths and above-mentioned the 3rd routed path that finds out;

Second device is used for the control according to first device, and the third level crosspoint of third level crosspoint in article one path in above-mentioned at least two routed paths and above-mentioned the 3rd routed path that finds out is exchanged.

The technical scheme that the embodiment of the invention provides; Whether there are at least two routed paths in the symmetrical network through at least three grades of detections with identical second level crosspoint and third level crosspoint; If exist; Search a routed path that has identical first order crosspoint, different second level crosspoint and different third level crosspoints with one of at least two routed paths; The third level crosspoint of exchange one of at least two routed paths and the routed path of searching, thus realize that route resets, can make that the route at least three grades the symmetrical network is clog-free.Method, Apparatus and system according to adjustment network route provided by the invention; Carrying out rearrangeable clog-free route calculates; Can guarantee that network exchange reaches the purpose that any input port is connected to any output port; Both can practice thrift the quantity of switching node, and can effectively guarantee the performance of equipment again.

Description of drawings

Fig. 1 is the configuration diagram of the CLOS network of three grades of symmetries in the prior art;

The method flow diagram of the adjustment network route that Fig. 2 provides for the embodiment of the invention one;

Fig. 3 is the sketch map of crosspoint in the embodiment of the invention one;

The flow chart of the method for the adjustment network route that Fig. 4 provides for the embodiment of the invention two;

Fig. 5 is the configuration diagram of the CLOS network before the adjustment in the embodiment of the invention three;

Fig. 6 is the configuration diagram of adjusted CLOS network in the embodiment of the invention three;

The system architecture sketch map of the adjustment network route that Fig. 7 provides for the embodiment of the invention four.

Embodiment

The embodiment of the invention provides a kind of method, Apparatus and system of adjusting the network route, when rearrangeable clog-free CLOS network cause clogging, through readjusting route, reach the purpose of not blocking.For making the object of the invention, technical scheme and advantage clearer, the embodiment that develops simultaneously with reference to the accompanying drawings is to further explain of the present invention.As shown in Figure 2; The method flow diagram of the adjustment network route that provides for the embodiment of the invention one; The symmetrical network that is used for one at least three grades carries out the route adjustment; Above-mentioned at least three grades symmetrical network comprises first order crosspoint, second level crosspoint, third level crosspoint, and the routed path that this symmetrical network of at least three grades provides is by first order crosspoint, second level crosspoint and third level crosspoint sign, and said method comprises the steps:

Whether step S201, detection exist at least two routed paths with identical second level crosspoint and third level crosspoint;

If step S202 exists; Find out a routed path (such as; Be called the 3rd routed path); Paths in this that wherein a finds out routed path (i.e. the 3rd routed path) and above-mentioned at least two routed paths (such as, be called article one routed path) have identical first order crosspoint, different second level crosspoint and a different third level crosspoints;

Step S203, the third level crosspoint of third level crosspoint in this paths in above-mentioned at least two routed paths (being article one routed path) and the above-mentioned routed path that finds out (i.e. the 3rd routed path) is exchanged.

Above-mentioned steps S202 specifically comprises:

Judge all routed paths that have different second level crosspoint at least with above-mentioned two routed paths, whether have the third level crosspoint different with above-mentioned at least two routed paths;

If, from above-mentioned all routed paths, select with above-mentioned at least two routed paths in this paths (being article one routed path) have the path that the identical first order exchanges, as the routed path that finds out (i.e. the 3rd routed path).

Said method also comprises:

Routed path in the above-mentioned at least three grades symmetrical network generates according to preset first order crosspoint and third level crosspoint; The routed path that generates has different first order crosspoints or different second level crosspoint.

Above-mentioned steps S201 specifically comprises: select a second level crosspoint; Judge all routed paths, whether have identical third level crosspoint with this second level crosspoint.

Crosspoint in the above-mentioned at least three grades symmetrical network is meant and can realizes that any input port is connected to a kind of device of any output port.Be illustrated in figure 3 as a crosspoint with m input port, n output port, promptly switch arrays through control switch closure wherein, can be realized the connection of any input port to any output port.As long as have idle input port and output port simultaneously, promptly can set up the connection that is input to output, and can not influence original any connection status.Fig. 3 only is a kind of implementation of crosspoint, in fact also has other implementation, and three grades of CLOS networks as shown in Figure 1 also can be thought a kind of crosspoint.

As shown in Figure 4, the method flow diagram of the adjustment network route that provides for the embodiment of the invention two comprises the steps:

Step S401, specify the linker substitution of at least three grades CLOS network to assign P;

Linker substitution is assigned and is meant the connection corresponding relation between one group of input port and the output port, uses following formulate:

$P=\left[\begin{array}{cccc}0& 1& ...& N-1\\ \mathrm{\π}\left(0\right)& \mathrm{\π}\left(1\right)& ...& \mathrm{\π}(N-1)\end{array}\right]$

Wherein P representes a linker substitution appointment, and first row 0 to N-1 is represented the input slogan of routed path, the output slogan that second line display is corresponding.

Step S402, assign, generate the connection description matrix S according to linker substitution;

Under the situation of specifying linker substitution to assign, the situation through all routes of matrix S explanation is shown below:

$S=\left[\begin{array}{cccc}e\left(\mathrm{0,0}\right)& e\left(\mathrm{0,1}\right)& ...& e(0,m-1)\\ e\left(\mathrm{1,0}\right)& e\left(\mathrm{1,1}\right)& ...& e(1,m-1)\\ .& .& & .\\ .& .& ...& .\\ .& .& & .\\ e(r,0)& e(r,1)& ...& e(r,m-1)\end{array}\right]$

This matrix has that r is capable, the m row, routed path of each element representation wherein, and each element comprises three attributes: row number, row number and element value, represent the sequence number of the first order, the second level, third level crosspoint in the CLOS network of correspondence respectively.Like element e _(4,5), represent that the first order crosspoint sequence number at this routed path place is 4, second level crosspoint sequence number is 5, third level crosspoint sequence number is e.

Assign P for specific linker substitution, its input, output port are confirmed, so can calculate the sequence number of the first order, third level crosspoint.Therefore, corresponding to the element among the S, its row number, element value also confirms.The element that at first will know is inserted matrix S in order, and unappropriated route is represented with symbol " 1 ".Element " 1 " expression is empty, unoccupied, therefore, if element is " 1 ", no matter it is individual what are arranged, does not influence completeness.

Step S403, get the row j=0 of matrix S;

Step S404, in matrix S, j row are detected, judge whether the j row complete? If the j row fully, then change step S405 over to; If the j row not exclusively, then change step S407 over to;

In the connection description matrix S, the element value e of a certain row is inequality, claims that then these row have completeness, if each row of S all have completeness then claim that this connection description matrix S has completeness.If S has completeness, claim that then this CLOS network is unblock.Otherwise if S does not have completeness, also there is obstruction in then corresponding CLOS network, need reset, and readjusts route.

According to the definition of front to blocking, cause clogging has two kinds of situation:

1) first order of 2 paths, second level crosspoint sequence number are identical;

2) second level of 2 paths, third level crosspoint sequence number are identical.

According to above-mentioned situation, in the connection description matrix, when the row of 2 elements number, row are number identical; Can cause clogging, but this obviously is impossible, because row number, row are number all identical; This element is confirmed, can only be 1 element, and can not be 2 elements.Therefore, when having only crosspoint sequence number when the second level of 2 routes, the third level all identical (be the row number of 2 elements in the connection description matrix, element value is all identical), just understand cause clogging.Just, two identical elements are arranged in same row, just can cause clogging.

Whether step S405, judgement row j equal m-1, if equal, then the route adjustment finishes; If be not equal to, then change step S406;

Step S406, get j=j+1, change step S404;

Step S407, get the value e=0 of element;

Do you step S408, judge whether e superfluous in the j row? If not superfluous, then change step S409; If superfluous, then change step S411;

E is superfluous: at a certain row, the number of element e is greater than 1, and surplus can cause clogging.

E is not enough: at a certain row, do not have element e, the not enough explanation of e is vacant, also has vacant intergrade to use.

Step S409, judge whether element e equals r-1, if equal, then the j row have completeness, change step S405; If be not equal to, then change step S410;

Step S410, get e=e+1, change step S408;

Step S411, the superfluous element of record are e1, be designated as e1 (i1, j), e1 (i2, j), i1＜i2, i1, i2 are row number;

Step S412, search element e2 (i1, j1), j1 row satisfy the not enough condition of e1;

Because the element in the matrix S, its row number, element value confirm, so in the process of resetting, can only change the row number of this element, just the sequence number of second level crosspoint.Therefore, in the time of rearrangement, each element only allows and other element exchange with delegation.Suppose to find element e1 superfluous, the row at place number be i1, and row number be j, then need find an element e2, and capable number is i1, and the row that belong to do not have element e1, exchanges e1 and e2 then.

Step S413, commutative element e1 (i1, j) with element e2 (i1, position j1), the element after the exchange be respectively e1 (i1, j1), e2 (i1, j);

Step S414, comparison e1 and e2 are if e1＜e2 then changes step S415; If e1＞e2 then changes step S416;

Step S415, make e=e1, change step S408;

Whether step S416, inspection element e2 superfluous in the j row? If superfluous, then change step S417;

If e1＞e2; Because shuffle algorithm of the present invention is according to from small to large in sequence, so before e1 was reset, the e2 littler than e1 was completely; Now after the exchange; E2 just might become not exclusively again again, promptly when the prostatitis becomes two e2 is arranged, and at this moment just exchanges the element e2 of other delegation according to method described above.

Step S417, the record superfluous element be e2 (i1, j), e2 (i3, j);

Step S418, search element e3 (i3, j1), j1 row satisfy the not enough condition of e2;

Step S419, commutative element e2 (i3, j) with element e3 (i3, position j1), the element after the exchange be respectively e2 (i3, j1), e3 (i3, j);

Step S420, comparison e2 and e3 are if e2＜e3 then changes step S421; If e2＞e3 then changes step S422;

Step S421, make e=e2, change step S408;

Step S422, make e2=e3, change step S416.

Through above-mentioned steps all row in the matrix S are detected, adjust, have complete matrix S after obtaining resetting, promptly reset later CLOS network, thereby realize that the route in the above-mentioned at least three grades symmetrical network is clog-free.

For ease of more being expressly understood the present invention, describe through an instantiation three below.

The CLOS network of setting in the present embodiment has the input port (also being the output port of Stage3) of n=3 Stage1, the output port (also being the input port of Stage3) of a m=3 Stage1, input, the output port of a r=5 Stage2.Specify its linker substitution to be assigned as:

The connection description matrix S is:

$S=\left[\begin{array}{ccc}0& 2& 4\\ 1& 3& 2\\ 0& 3& 3\\ 0& 4& 1\\ 2& 1& 4\end{array}\right]$

Fig. 5 is the structural representation of present embodiment three CLOS networks, always has 15 paths, wherein uses the line that encloses sign to represent the path of blocking in the line between the second level, the third level.

According to the shuffle algorithm that embodiment two describes, the rearrangement process that provides in the present embodiment is following: (afterwards wearing the element that * number element representation need exchange)

$S=\left[\begin{array}{ccc}0*& 2*& 4\\ 1& 3& 2\\ 0& 3& 3\\ 0& 4& 1\\ 2& 1& 4\end{array}\right]\stackrel{\mathrm{step}}{\→}\left[\begin{array}{ccc}2& 0& 4\\ 1& 3& 2\\ 0*& 3& 3*\\ 0& 4& 1\\ 2& 1& 4\end{array}\right]\stackrel{\mathrm{step}2}{\→}\left[\begin{array}{ccc}2*& 0*& 4\\ 1& 3& 2\\ 3& 3& 0\\ 0& 4& 1\\ 2& 1& 4\end{array}\right]\stackrel{\mathrm{step}3}{\→}\left[\begin{array}{ccc}0& 2& 4\\ 1& 3& 2\\ 3& 3& 0\\ 0*& 4*& 1\\ 2& 1& 4\end{array}\right]$

$\stackrel{\mathrm{step}4}{\→}\left[\begin{array}{ccc}0& 2& 4\\ 1& 3*& 2*\\ 3& 3& 0\\ 4& 0& 1\\ 2& 1& 4\end{array}\right]\stackrel{\mathrm{step}5}{\→}\left[\begin{array}{ccc}0& 2*& 4*\\ 1& 2& 3\\ 3& 3& 0\\ 4& 0& 1\\ 2& 1& 4\end{array}\right]\stackrel{\mathrm{step}5}{\→}\left[\begin{array}{ccc}0& 4& 2\\ 1& 2& 3\\ 3& 3& 0\\ 4& 0& 1\\ 2& 1& 4\end{array}\right]$

At first, from the 0th row, minimum element 0 begins to search, find the superfluous situation of first e occur in e1 (i1, j)=0 (0,0), and e1 (i2, j)=0 (2,0) find that (row at j1=1 are satisfied in i1, j1)=2 (0,1), and e1=0 is not enough with element e2.The position of commutative element 0 (0,0) and 2 (0,1).Element after the exchange is e1 (i1, j)=0 (0,1) and e2 (i1, j1)=2 (0,0).

If find after the exchange that e1＜e2 sets up (0＜2), make e=e1 because e1=0, so, continue to search 0 whether superfluous, find element e1 (i1, j)=0 (2,0), and e1 (i2, j)=0 (3,0) belong to the situation of surplus.The process of repeating step S01 find e2 (i1, j1)=3 (2,2) satisfy condition at j1=2 row, and e1=0 is not enough, commutative element 0 (2,0) and 3 (2,2), the element after the exchange is: e1 (i1, j)=0 (2,2) and e2 (i1, j1)=3 (2,0).

If find after the exchange that e1＜e2 sets up (0＜3), make e=e1, because e1=0, so; Whether whether continue to search 0 superfluous, find to have only 10, and then search 1 superfluously, the result does not have surplus yet; And then search 2 whether superfluously, find e1 (i1, j)=2 (0; 0) with e1 (i2, j)=2 (4,0) surplus.The process of repeating step S01 finds e2, and (i1, j1)=0 (0,1) satisfy condition at the j1=1 row, and e1=2 is not enough, commutative element 2 (0,0) and 0 (0,1).Exchanging later element is: e1 (i1, j)=2 (0,1) and e2 (i1, j1)=0 (0,0).

Be false (2＜0 are false) if find e1＜e2 after the exchange, check whether e2=0 is superfluous at 0 current row, find e2 (i1, j)=0 (0; 0) with e2 (i3, j)=0 (3,0) surplus is according to exchange principle two; Need find element e3 (i3, j1)=4 (3,1); This element satisfies row number and is i3=3 (the element e2 (i1, row i1 j1) must be inequality) that was exchanged with a last step, and the e2=0 of j1 row is not enough.And commutative element e2 (i3, j)=0 (3,0) and e3 (i3, j1)=4 (3,1).Element after the exchange is: e2 (i3, j)=0 (3,1), e3 (i3, j1)=4 (3,0).

If exchange is satisfied e2＜e3 and is set up (0＜4) later, make e=e2 because e2=0, continue searching 0 whether superfluously when the prostatitis, find that these row have reached completeness, be listed as searching the 1st; Search the situation that whether has e superfluous since 0, find element e1 (i1, j)=3 (1,1), and e1 (i2; J)=3 (2,1) belong to superfluous situation, find e2 (i1, j1)=2 (1,2); Satisfy condition, at the j1=2 row, e1=3 is not enough, commutative element e1 (i1; J)=3 (1,1) and e2 (i1, j1)=2 position of (1,2).Exchange back element is e1 (i1, j)=3 (1,2) and e2 (i1, j1)=2 (1,1).

Be false (3＜2 are false) if find e1＜e2 after the exchange, check whether e2=2 is superfluous at 1 current row, find e2 (i1, j)=2 (1; 1) with e2 (i3, j)=2 (0,1) surplus is according to exchange principle two; Need find element e3 (i3, j1)=4 (0,2); This element satisfies row number and is i3=0 (the element e2 (i1, row i1 j1) must be inequality) that was exchanged with a last step, and the e2=2 of j1 row is not enough.And commutative element e2 (i3, j)=2 (0,1) and e3 (i3, j1)=4 (0,2).Element after the exchange is e2 (i3, j)=2 (0,2) and e3 (i3, j1)=4 (0,1)

Through after the top exchange, continue to detect e2＜e3 and set up (2＜4), make e=e2; Whether because e2=2, continuing to search has e superfluous, and increasing progressively discovery does not all have surplus; It is good to the 2nd row to increase progressively row again; Find also have completeness, explain that whole list item all has completeness, can represent a choke free network.After after going out to reset, having complete list item S, assign P, obtain resetting and accomplish later CLOS network in conjunction with linker substitution according to above-mentioned algorithm computation, as shown in Figure 6.

Assign to calculate the crosspoint sequence number of the first order, the third level according to linker substitution, just row among the list item S number and element value in the row at place, find the position at this element value place then, and residing row number are exactly the sequence number of second level crosspoint.Referring to Fig. 6, like the connection to No. 7 input port to 10 output ports, calculating first order crosspoint sequence number is 2; Third level crosspoint sequence number is 3, and then the 2nd row in list item S is looked for element 3, at this moment; Discovery has 2 elements 3, can select one of them arbitrarily, as select first; Row number are 0, and then the shared intergrade crosspoint sequence number of this route is 0.

Aforementioned algorithm is carried out overall alignment according to capable number order from small to large, finally can not be absorbed in endless loop, and algorithm has convergence, and promptly this algorithm finally can reach certainly and reset successfully.

In this algorithm, the total r of list item S is capable, the m row.The sequence number of the value representation third level crosspoint of element, so: m identical element arranged at most in a connection description list item.(establishing this identical element is e, in the CLOS network, is exactly that third level e crosspoint can be connected to m different intergrade at most.So) can be just like drawing a conclusion:

If in list item S, certain row element e among k1 does not possess completeness, can find the element e more than 2, then must find a row k1, and this element e does not appear in the k1 row, and the element that k1 row and e go together promptly is the element that is used for the e exchange.

As shown in Figure 7; The embodiment of the invention four provides a kind of system that adjusts the network route; Comprise first device, 710 and second device 720; Second device 720 comprises that the routed path that first order crosspoint 721, second level crosspoint 722, third level crosspoint 723, the second devices provide is identified by first order crosspoint 721, second level crosspoint 722 and third level crosspoint 723, wherein:

First device 710 is used for detecting second device 720, whether has at least two routed paths with identical second level crosspoint 722 and third level crosspoint 723; If exist; Find out a routed path (such as; Be called the 3rd routed path); Paths in this that wherein a finds out routed path (i.e. the 3rd routed path) and above-mentioned at least two routed paths (such as, be called article one routed path) have identical first order crosspoint 721, a different second level crosspoint 722 and different third level crosspoints 723; Control second device 720 exchanges the third level crosspoint of third level crosspoint in this paths in above-mentioned at least two routed paths (being article one routed path) and the above-mentioned routed path that finds out (i.e. the 3rd routed path);

Second device 720; Be used for according to 710 the control of first device, the third level crosspoint of third level crosspoint in this paths in above-mentioned at least two routed paths (being article one routed path) and the above-mentioned routed path that finds out (i.e. the 3rd routed path) is exchanged.

As shown in Figure 7, first device 710 comprises:

Memory cell 711 is used to store second and installs 720 routed path;

Detecting unit 712 is used for the routed path that the detection of stored unit is stored, and whether has at least two routed paths with identical second level crosspoint 722 and third level crosspoint 723;

Search unit 713; Be used for when detecting unit 712 detects at least two of existence and has the routed path of identical second level crosspoint 722 and third level crosspoint 723; Find out a routed path (i.e. the 3rd routed path), this that wherein a finds out routed path (i.e. the 3rd routed path) and a paths (being article one routed path) in above-mentioned at least two routed paths have identical first order crosspoint 721, different second level crosspoint 722 and different third level crosspoint 723;

Route control unit 714 is used for the third level crosspoint of third level crosspoint in this paths (being article one routed path) of above-mentioned at least two routed paths and the above-mentioned routed path that finds out (i.e. the 3rd routed path) is exchanged; The routed path of updated stored unit 711 storages.

The above-mentioned unit 713 of searching specifically comprises:

Judging unit is used to judge all routed paths that have different second level crosspoint at least with above-mentioned two routed paths, whether has the third level crosspoint different with above-mentioned at least two routed paths;

Selected cell; Be used for when the judged result of judging unit when being; From above-mentioned all routed paths; Select with above-mentioned at least two routed paths in this paths (being article one routed path) have the path that the identical first order exchanges, as the routed path that finds out (i.e. the 3rd routed path).

First device 710 also comprises:

Command reception unit 715 is used to receive user instruction, and user instruction comprises the first order crosspoint 721 of preset NE 720 and the routing iinformation of third level crosspoint;

Path generation unit 716 is used for generating routed path according to user instruction, and this routed path has different first order crosspoints 721 or different second level crosspoint 722.

Route control unit 714 also is used for the routed path according to 716 generations of path generation unit, the routed path of control second device 720.

Described first device of present embodiment and second device can be integrated in the equipment, also can be separate.

The present invention can be applied to automatic wiring device such as automatic wiring frame (ADF; Automatic Distribute Frame) in; ADF equipment is as a kind of automatic wiring device that is used for communication system, and ADF has user-side port and equipment side port based on the distribution of twisted-pair feeder.Can realize that any user-side port is connected to the function of any apparatus side ports.Promptly realize function of any to any.ADF equipment mainly is divided into two parts, control module and space division switching network module.

Control module is made up of CPU and peripheral interface, accepts user instruction, and can control space division switching network.Control module provides a user interface, is used to be connected to IP network, and the user can pass through this network interface Long-distance Control ADF equipment.Control module provides a control interface, can control the switch arrays in the space division switching network, realizes that route connects.

The space division switching network module is made up of three grades of CLOS networks.Under the control of control module, accomplish the exchange that is input to any output arbitrarily.The space division switching network module provides a user-side port, and the subscribers feeder of accomplishing N road user side inserts.The space division switching network module provides a network side interface, accomplishes N road subscribers feeder and is connected to network equipment.

Among the automatic wiring frame ADF, use the CLOS network theory to set up the space switching net,, get n=m for practicing thrift the quantity of switching node; For 3 grades of CLOS network C of standard (n, m, r); Under the certain situation of total capacity (N=n*r), during n=m, used switching node resource is minimum.

Obviously, it is apparent to those skilled in the art that above-mentioned each unit of the present invention or each step can realize with the general calculation device; They can concentrate on the single calculation element; Perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element; Thereby; Can they be stored in the storage device and carry out, perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of unit in them or step are made into the single integrated circuit module and realize by calculation element.Like this, the present invention is not restricted to any specific hardware and software combination.

In sum; In the technical scheme that the embodiment of the invention provides; Whether there are at least two routed paths in the symmetrical network through at least three grades of detections with identical second level crosspoint and third level crosspoint; If exist, search a routed path that has identical first order crosspoint, different second level crosspoint and different third level crosspoints with one of at least two routed paths, the third level crosspoint of one of at least two routed paths of exchange and the routed path of searching; Thereby realize that route resets, can make that the route at least three grades the symmetrical network is clog-free.Method and apparatus according to adjustment network route provided by the invention; Carrying out rearrangeable clog-free route calculates; Can guarantee that network exchange reaches the purpose that any input port is connected to any output port, both can practice thrift the quantity of switching node, can effectively guarantee the performance of equipment again.

The above is merely preferred embodiment of the present invention, is not to be used to limit protection scope of the present invention.All any modifications of within spirit of the present invention and principle, being done, be equal to replacement, improvement etc., all be included in the application's scope required for protection.

Claims (11)

1. method of adjusting the network route; Be used for three grades of CLOS networks are carried out the route adjustment; It is characterized in that; Said three grades of CLOS networks comprise first order crosspoint, second level crosspoint, third level crosspoint, and the routed path that said three grades of CLOS networks provide is by said first order crosspoint, said second level crosspoint and said third level crosspoint sign, and this method comprises:

Detect and whether have at least two routed paths with identical second level crosspoint and third level crosspoint;

If exist; Find out the 3rd routed path; Wherein said the 3rd routed path that finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in said at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint;

The third level crosspoint of third level crosspoint in article one path in said at least two routed paths and said the 3rd routed path that finds out is exchanged.

2. the method for claim 1; It is characterized in that; Saidly find out the 3rd routed path; Wherein said the 3rd routed path that finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in said at least two routed paths, specifically comprises:

Judge all routed paths that have different second level crosspoint at least with said two routed paths, whether have the third level crosspoint different with said at least two routed paths;

If, from said all routed paths, select with said at least two routed paths in article one path have the path of identical first order crosspoint, as said the 3rd routed path that finds out.

3. the method for claim 1 is characterized in that, said routed path generates according to preset first order crosspoint and third level crosspoint;

The routed path that is generated has different first order crosspoints or different second level crosspoint.

4. the method for claim 1 is characterized in that, whether said detection exists at least two routed paths with identical second level crosspoint and third level crosspoint, specifically comprises:

Select a second level crosspoint;

Judge all routed paths, whether have identical third level crosspoint with said second level crosspoint.

5. the method for claim 1 is characterized in that, said crosspoint is switch arrays.

6. device of adjusting the network route; Be used for three grades of CLOS networks are carried out the route adjustment; It is characterized in that; Said three grades of CLOS networks comprise first order crosspoint, second level crosspoint, third level crosspoint, and the routed path that said three grades of CLOS networks provide is by said first order crosspoint, said second level crosspoint and said third level crosspoint sign, and said device comprises:

Memory cell is used to store said routed path;

Detecting unit is used for detecting the routed path of said cell stores, whether has at least two routed paths with identical second level crosspoint and third level crosspoint;

Search the unit; Be used for when said detection when having said at least two routed paths; Find out the 3rd routed path; Wherein said the 3rd routed path that finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in said at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint;

Route control unit is used for the third level crosspoint of third level crosspoint in article one path of said at least two routed paths and said the 3rd routed path that finds out is exchanged, and upgrades the routed path of said cell stores.

7. device as claimed in claim 6 is characterized in that, the said unit of searching comprises:

Judging unit is used to judge all routed paths that have different second level crosspoint at least with said two routed paths, whether has the third level crosspoint different with said at least two routed paths;

Selected cell; Be used for when the judged result of said judging unit when being; From said all routed paths, select with said at least two routed paths in article one path have the path of identical first order crosspoint, as said the 3rd routed path that finds out.

8. device as claimed in claim 7 is characterized in that, also comprises:

The command reception unit is used to receive user instruction, and said user instruction comprises the first order crosspoint and the third level crosspoint of preset said NE;

The path generation unit is used for generating routed path according to said user instruction, and the routed path of said generation has different first order crosspoints or different second level crosspoint.

9. device as claimed in claim 8 is characterized in that, said route control unit also is used for the routed path according to the generation of said path generation unit, controls the routed path of said three grades of CLOS networks.

10. system that adjusts the network route; It is characterized in that; Comprise first device and second device, said second device is three grades of CLOS networks, and said second device comprises first order crosspoint, second level crosspoint, third level crosspoint at least; The routed path that said second device provides is by said first order crosspoint, said second level crosspoint and said third level crosspoint sign, wherein:

Said first device is used for detecting said second device, whether has at least two routed paths with identical second level crosspoint and third level crosspoint; If exist; Find out the 3rd routed path; Wherein said the 3rd routed path that finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in said at least two routed paths, and all has the third level crosspoint different with said at least two routed paths with all paths that said the 3rd routed path that finds out has identical second level crosspoint; Control said second device, the third level crosspoint of third level crosspoint in article one path in said at least two routed paths and said the 3rd routed path that finds out is exchanged;

Said second device is used for the control according to said first device, and the third level crosspoint of third level crosspoint in article one path in said at least two routed paths and said the 3rd routed path that finds out is exchanged.

11. system as claimed in claim 10 is characterized in that, said first device comprises:

Memory cell is used to store the routed path of said second device;

Detecting unit is used for detecting the routed path of said cell stores, whether has at least two routed paths with identical second level crosspoint and third level crosspoint;

Search the unit; Be used for when said detection when having said at least two routed paths; Find out the 3rd routed path, wherein said the 3rd routed path that finds out has identical first order crosspoint, different second level crosspoint and different third level crosspoint with article one path in said at least two routed paths;

Route control unit is used to control said second device, and the third level crosspoint of third level crosspoint in article one path in said at least two routed paths and said the 3rd routed path that finds out is exchanged; Upgrade the routed path of said cell stores.

Images