FI90707B - A method for forming cross-connect paths - Google Patents

Description

1 90707

The invention relates to a method according to the preamble of claim 1 for unobstructed configuration of a cross-switch for digital transmission lines in the event of a change in the cross-connection requirement. The invention also relates to a cross-switch implementing the method and its use.

10

The synchronous digital hierarchy (SDH) comprises a rather large and advanced entity for transmitting time-division signals in a telecommunications network whose backbone transmission network is evolving from separate PCM-encoded links towards a remote 15-co-controlled cross-connect network. Recommendation CCITT G.707 defines a signal of the first level synchronous transport module (STM-1, Synchronous Transport Module) of SDH signals with a transmission rate of 155.520 Mbit / s. The basic frame of STM-1 consists of bytes (8 bits) of 2430 in frame-20, including control blocks; in this case, 63 TU-12, Tributary Unit 2 Mbit / s signals are transmitted in the STM-1 frame, which may include a 2 Mbit / s signal of a standard 30-channel PCM system. The STM-1 frame is repeated 8000 times per second, which is the same as in the subsystem; each byte of the frame then forms 64 kbit / s 25 channels. SDH signals, i.e. transport modules, are formed from the signals of the subsystems by interleaving bytes.

An SDH crossover switch (DXC) can transmit traffic between different SDH levels as well as switch traffic between different signals. Type- -. The 30-whistle upper level cross switch (DXC, Digital Cross Con nect, CCITT draft recommendations G.sdxc-1 ...- 3) is the so-called 4/1-cross switch where 2 Mbit / s channels are connected between the input and output ports. An important goal of the crossover is to optimize the capacity utilization of the transmission network. In addition, it 35 must be able to handle the flexible reconfiguration of the network, i.e. the rerouting of connections, and guarantee the rapid introduction of backup connections in the event of a network failure. Said CCITT SDH recommendations seek to define the logical operation, i.e. the functional structure of the devices, but avoid a detailed structural description of the devices.

Digital cross-linking has been extensively studied to find an architecture that meets the optimal 5 conditions. A structure that satisfies the conditions of capacity, non-blocking and feasibility is the TST (Time-Space-Time) structure, i.e. a time-space-time cross-connection, the schematic representation of which is shown in Figure 1. In the TST-switch structure, finding an unobstructed connection is much more -10 kenna is a demanding task, although the TST switch is basically unobstructed. A component of a large computational need is, for example, the large number of bytes or channels contained in STM-N signals. The advantage of the TST sheet architecture is that the size of the cross-switch can in each case be dimensioned for the required switching capacity 15, so that the hardware solution is more advantageous than with other architectures (e.g. T-S-T, etc.).

In traditional TST cross-connect architectures, the cross-field is completely or partially duplicated, making it more advantageous to calculate 20 non-blocking connections. This has been done, for example, in telephone exchanges where 2 Mbit / s lines are connected to the switch and where the purpose is to quickly establish and decouple channel-specific connections between 64 kbit / s lines. In the case of a control panel TST switch, a free route through the switch must be searched within the limits allowed by the time-25 restrictions, in which case blocking can also be accepted, even if the switch has free capacity, because blocking is applied to only one channel at a time. Such an operation is not acceptable in the handling of transmission paths in cross-switches where all 30 inputs must be able to be routed to their outputs. The connection times of the transmission paths are long and the connections do not change quickly. In addition, when connecting transmission paths, the basic condition is the efficient utilization of the transmission paths and also of the crossover capacity, in contrast to telephone exchanges, where overcapacity can also be used to combat blocking situations.

3 90707

In conventional SDH crossovers using the TST structure, the problem of finding an unobstructed route has been circumvented by increasing the capacity of the state switch, e.g., by doubling the frequency of the state switch. In Figure 1, on the left are the incoming signals 5 II ... In (here STM-1 signals) and on the right are the outgoing signals lit 01 ... On. Each line has its own time switch. The input and output side of the time switches Til ... Tin and Tol ... Ton, to change time slots, ie the number of bytes positions (within a frame) within a signal. The central state switch S transfers the byte of the incoming signal 10 to the signal going to the second time switch. The time slot, i.e. a byte, forms a 64 kbit / s channel. In principle, the time switches are memory elements and the state switch consists of switch elements. In general, the cross-connection is implemented in a modular structure. The first time switch and the ti-15 lacquer switch affect the establishment of an uninterrupted connection from any time slot of the input line to the correct output line. The output side time switch does not affect the achievement of the non-blocking connection, but only switches the channels or time slots into the correct order required by the output line manner.

20

It is an object of the invention to provide a method and architecture for cross-coupling high-speed digital signals which can implement non-blocking coupling and avoid known drawbacks and disadvantages.

This object is solved by a time-periodically configured configuration calculation method according to claim 1. The structure of the cross-connection is further developed by the method according to claim 6 for switching the route verification. Other preferred embodiments of the invention are set out in the other dependent claims.

The invention has the advantage that the entire cross-connection capacity is utilized. Ensuring unobstructed operation 35 does not require additional cross-connection capacity. In addition, the method according to the invention can be used for synchronous operation, i.e. for error-free switching of the switching matrix of cross-switch modules operating at the same clock.

4 90707

The invention can be applied to the connection of standardized transport modules (STM-N) in synchronous digital hierarchy (SDH). The invention can also be applied in cross-linking according to the plesiochronous transfer hierarchy (PDH). The method according to the invention can be used in cross-switching devices of different levels, e.g. a 4/1-cross switch or a 3/1-cross switch which switches 2 Mbit / s signals connected at the 34 Mbit / s level.

The invention will now be described by way of example with reference to the accompanying drawings.

Figure 1 shows the principle of time-space-time cross-connection.

Figure 2 schematically shows a cross-connection control according to the invention.

Figure 3 is a simplified flow chart of a time-intermittent method according to the invention.

Figure 4 shows in a simplified flowchart a selection procedure for a time slot to be switched according to the invention.

Figure 5 is an implementation of 1: N / N: 1 route verification.

Figure 1 also illustrates in principle the structure of the time-space-time cross-switch used in the invention, which has already been explained in the general part. Figure 2 shows a TST-structure ristikytkinra 10, with which the method according to the invention can be applied, and wherein the cross-connect control section 20 is able to simultaneously control all 30 input side time switches 1 ... N perform the term L interconnections. The state switch S comprises N * N switches, which are used to switch N outputs to N outputs. On the output side, there are again N time switches, each of which performs L-slot interconnections.

2 shows a cross-connect control 20 is capable of simultaneously (synchronously) to carry out the input and output side of the time switch-space switch and not the switch matrix 31 (CM Connection mat-

I. I

35 5 90707 rix, or circuit diagram) so that in the event of a change in the circuit configuration, the time and mode switches can be completely reconfigured to correspond to the new circuit configuration. Thus, the processor 30 has an active switching matrix 31 in use in each case 5 and a backup switching matrix (31b, not shown). The configuration calculator 32 of the processor 30 controlling the cross-connect field generates a new configuration by the configuration method described below, which is stored in the backup switching matrix with which the switching configuration update 10 is performed. As input data, the configuration calculator has the channel division at the inputs and the desired output line and channels. The cross-switch control unit 20 takes advantage of the updated matrix 31b when it controls the time and mode switches to match the new switching configuration.

15

The efficient implementation of the configuration calculation of the cross-switch according to the invention is based on the feature of the TST cross-switch that the new configuration can be solved one time slot at a time. In other words, when the input side of the time switch, and 20 N * by N-state switch can be found in a non-blocking state for an arbitrary time slot K can be assured that the other time slots K + l, K + 2, ..., L can be solved by the same principle. Thus, the configuration of the cross connect can be calculated one time slot so that the non-blocking connection configuration 25 always seeks the remaining time slots K, K + l, K + 2, ..., L the input side time switch and space switch.

The mode switching of the specified time interval is unobstructed when all outputs of the mode switch are active. In other words, the time switch of the input side must switch all the time slots, i.e. the channels, so that all the time-switched time slots of the inputs of the state switch are routed to different outputs. Unless there is a time slot coming that should be routed to a particular output, then of course this output does not need to be used. Thus, no space 35 in front of the van switch the input side of the time switch is to distribute the channels evenly by time slots so that the space switch can switch them to the correct, desired outputs. More specifically, the mode switch must avoid a blocking situation where there would be more than one channel to be routed to the same slot in the same time slot.

6 90707

With the method according to the invention, the configuration calculator forms a switching matrix so that the cross-connection according to Fig. 2 operates unimpeded.

Based on the switching request, the counter 32 constructs a new switching matrix 31b (not shown) as a background run, which is stored in the memory of the processor 30. Once the switching matrix 31b has been calculated, the control unit 20 updates the states of the cross-connect modules in their entirety, according to the new switching matrix. Thus, new connections are added to or removed from the connection matrix on the basis that all connections of the risk switch 15 are reconnected on the basis of the new connection state. Thus, even old connections that remain in effect even after changing the connection configuration can receive new routing through the cross-connection. The update is carried out accurately by means of a synchronization signal coming from a predetermined clock just before the new configuration takes effect. This synchronization signal ensures that old, valid connections from the input line to the output line are not disturbed when the switching matrix update is implemented.

25

The switching method calculates the cross-switch configuration one time slot at a time. First, the input channels, i.e. the bytes in the frame, are divided into as many groups as there are cross-connected signals in the 1. transport period of the interface. For example, 30 input side time switch connected to the SDH. The STM-1 line has a transmission rate of 155 Mbit / s 63 2 Mbit / s signal of a time period, a subsystem containers (e.g. TU-1, Tributary Unit, which can contain an ordinary 30-channel PCM. system 2 Mbit / s signal). The position of each time-35 period selected according to the invention in the frame is obtained directly by means of or by calculation from a standard pointer. Correspondingly, a line according to the plesiochronous transmission hierarchy (PDH) at a speed of 140 Mbit / s has 64 2 Mbit / s signal time periods. Every- i-.

7 90707 within the group thus defined, the cross-connection paths are solved in such a way that the switching configuration realized by it also means that the time slots not yet calculated can also be switched. The solution 5 of the entire cross-connection field is thus obtained by the time-periodic method according to Fig. 3.

In this method, when calculating one switching time slot to be considered, the time switches are first selected from those in which the inputs and outputs of the 10 state switches are full, i.e., which have as many unconnected channels as there are unused time slots. Switching decisions are first made for this group, which is called the priority group. Outputs that are not fully operational do not need to be used in each time slot. This means that those inputs and outputs that are fully utilized must be used during this period; other free connections may be omitted if no suitable channels can be found. As shown in Figure 3, the operation starts from the 'start' point. The first step is to implement uninterrupted switching through the 20 input time switches and the mode switch in this time slot. It is then examined whether all time slots have been processed, i.e. connected. If there are remaining time slots to be switched, go back to the beginning and calculate the uninterrupted connection for the next time slot. After the last term, go to 'end'.

Figure 4 shows the single time slot selection procedure in the form of a flow chart. After the start, we go to the check block SI, where it is checked which inputs and outputs are selectable when searching for a route between the input and the output. In this case, said priority group is always selected first. If no priority connections are found, other inputs and outputs are set to select.

In the second step S2 of Fig. 3, a single-slot solution is retrieved in the calculator 30 by first processing the output, i.e. the output with the least choice in the remaining time slots, i.e. with 8 90707 the smallest number of channels from different inputs. The selection naturally takes place from among the outputs of the state switch which were not previously selected when solving the time interval in question, i.e. which are free. The outputs available for selection are already checked 5 in the initial phase SI, as shown in Fig. 4, i.e. first it is checked which outputs are selectable and then the output with the smallest number of channels from different inputs is searched. Once the output has been selected, it is in principle possible to switch to input selection.

10

In selecting the input or input according to Fig. 4, in step S9, the number of connections to be routed from one input time switch to a single output time switch is used as the selection criterion, i.e. the input time switch for which the number of channels to be connected to the already selected (S2) output is largest. In this case, too, the inputs already processed are not relevant, and this is ensured in the check step SI of Fig. 4 immediately at the beginning of the selection pair, as was done in step SI in the selection of the output.

20

Thus, the check block SI first ensures that the output is selectable and then that the input is selectable. After the review, selections are made. The criterion used in the selection of the output is based on the promotion of finding an unobstructed connection for the last routing choices of the 25 time slots. This is based on the fact that it is easier to connect the output with the least different inputs at the beginning than at the last selection of the time period. The input selection criterion is again based on the fact that the selection aims to keep at least one channel coming for each output 30, for as long as possible. This maintains freedom of choice, and solutions for subsequent time periods are easier to find.

If, in the input selection situation in step S9, more than one alternative is found in step S10 with the same high number of connections to the selected outputs, the input with the smallest number of channels to the different outputs is selected in step S13 according to Fig. 4.

1 '9 90707

If, as a result of steps S2 and S13 in Fig. 4 above, an equivalent time switch is found in the input and output time switches in steps S3, S14 according to a selection criterion at several inputs or outputs, the first present option is selected in step S4 and step S11, respectively. If this selected option in the step S7 check does not produce a non-blocking connection, a recursive search of the solution for the current time slot must be performed. The search is now performed by deselecting in step S12 up to the previous untested equivalent option and returning to either step S4 or S11, where the next equivalent option is selected. The new selections are checked in step S7, and if the selections have not succeeded in any of the options, the next selection situation is returned, in which the equivalent step-15 conditions are valid. If necessary, this is repeated until a solution is found for the time interval. Thus, at worst, all equivalent combinations of alternatives are gone through, in which case an attempt is first made to move the selection to the different input time switches until all input alternatives have been traversed. 20 If this does not produce a successful result either, the selection starts to be transferred to the different outputs. Thus going through all the options on the revenue side of each side toward the output options. In the worst case, the search for a time slot solution may comprise a maximum of (N * N) -1 recursive search.

V; 25

The method described above also includes, according to Fig. 4, the handling of the emergency situation in step S5, before proceeding to the input selection in step S9. An exception may occur when a selection is made from a lower-priority group of an input or output interface, regardless of whether a channel is found in each corresponding higher-priority group of an input or output whose outputs or inputs must also be switched in the current time slot. Such an exceptional situation is detected in step S5, which proceeds to step S6, where the selection is made according to the higher priority group of the input or output when the input or output to be connected to it has the last chance to switch in the current time slot. According to the connection search sequence used according to the method, first output then input, an exceptional situation occurs after the selection of the output, but before the selection of the input, as shown in Fig. 4. In line with the above, the rationale is that there are more than 5 different outputs in the priority group. In this case, the selection could be made for the input providing the most channels, even if for a second input the only switching possibility of a single channel is lost. Therefore, the usual input selection criterion, i.e. steps S9 to S11, is skipped, and said single channel is selected in step S6. 10 The selection is checked again in step S7, after which the operation continues within the normal operation previously described.

The basic implementation of the method according to the invention has been described above. The private-specific algorithms used by the configuration calculator 32 (Fig. 2) are freely selectable, e.g. according to a method known per se, as long as they can implement the time-periodic calculation principle according to the invention.

The invention can be applied to cross-switches using one-way or two-way traffic switching. In a bidirectional cross switch, the switching configuration of the second direction can be formed in an analogous manner, e.g. as a mirror image. However, in the cross-switch 25 implementing the inventive method, as such, it is not possible to implement the broadcasting function, i.e. the copying of the selected signal to several output channels. To do this, additional capacity must be provided at the cross-switch. This is done by reserving one input line and one output line 30 in the mode switch for limited distribution. In addition, the TST cross connect the output side of the time switch-I followed by a switch blocks SE (not shown) and time switch blocks TE (not shown) for each output line. The input channel assigned to the distribution is routed via a state switch to said reserved output line, where the TST output time switch 35 arranges the channels. The arrangement of the channels is then adapted so that the respective selected output lines TE of the cross-connection can receive the distribution channels via the selectors SE. The transmission time switch TE then arranges the time slots I connected to it; 11 90707 in the order required for the transfer. Alternatively, for complete distribution operation, a double capacity may be provided for the state switch, the first half of the state switch capacity being used for routing the time slots connected by the method according to the invention, and the second half of the state switch capacity being used for the distribution function. In the distribution operation, straight-line copying of the time slot to the desired time slots of the second half can then be used.

10

According to a further development of the method, the connection required by the route verification is arranged so that the content of the time slot of the input channel to be verified is copied to the two output channels, i.e. to the output channels verifying each other. First, it is examined whether there is free time in the input time switch for the channel verifying the channel. If such a free slot is found, the contents of the time slot to be verified are copied to this free channel. Both channels are then connected via a mode switch to different output time switches and out to lines. If no free time slot is found in the input time switch-20, the authentication switching is performed in the state switch so that the content of the time slot of one of the incoming channels to be authenticated is copied to two output channels, i.e. two different output time switches and out to lines.

25

When route verification is performed on a 1 + 1 basis by duplicating the bidirectional signal to be verified, each route verification crossover has both a 1: N distribution function and a selection of the corresponding reverse signal N: 1 of the N 30 signals to be verified. In this case, in the TST cross switch according to the invention, the signals to be verified can be amplified on top of the corresponding verifiable signals in the reverse direction in the state switch, and thus unobstructed operation can be achieved.

35 As shown in Figure 5, the time slots of the routed 1: N / N: 1 connections are connected first and then the others. If not all input / output time switches are present, the time slots of the priority groups are switched on normally.

'' r.

ΐ2 90707

In bidirectional route verifications, there are always N + 1 si time slots, one signal to be verified, which must therefore be amplified to N outputs, and N verification signals, one of which must be selected for 1 output. Thus also the output-5 and is N + 1.

The switching is performed by selecting all N + 1 above-mentioned time slots for the same time period in the input time switch. The mode switch selects one of the verification slots as the selected output-10 channel and duplicates the N slots of the input to be verified to all N verification slots. The output time switches perform normal time switching for the outputs. When performing fast route verification, the connection configuration does not need to be calculated.

15

The method according to the invention provides an efficient calculation method for the switching configuration. In this case, the new configuration can be quickly computed in the processor 30 (Figure 2). This allows the implementation of an unobstructed and synchronous cross-connect, with which an error-free switching matrix can be arranged without having to duplicate the cross-connect time switches. The method according to the invention can also be applied in such cross-switches in which parts of a byte are connected in parallel in a series-by-state manner.

25

The invention has been described above on the basis of first selecting an output and then an input. One skilled in the art will appreciate that the method can be implemented in reverse, by calculating unblocked connections from time to time, by first selecting the input-30 line and then the output line. The above-mentioned time period was 63 or 64 time slots, in which case the number of bytes to be processed is 63 or 64 times the number of input time switches in each selected time period. However, it is conceivable that another suitable number of bytes be selected for the time period.

Claims (14)

13 90707 A method for configuring a time-space-time cross-switch in situations of changing the cross-connect requirement, wherein the cross-switch is provided with time switches (T) and state switches (S), and wherein the signals entering and leaving the cross-connect (10) are high speed serial data streams (1). ..N), in which the time slots of the logical frame structure are bytes to be moved and cross-switched, and wherein the current configuration of the cross-switch is stored in the switching-matrix (31), characterized in that - a new cross-switching configuration is formed periodically, each time comprising a predetermined number of time slots, and wherein provided for the connection configuration for each time slot is stored in rice varakytkentämat- 15 (31b), and in that - within each period of the input side of each of the yet unselected bytes as the input side time switch-Mella coupled to a byte through the space switch, that this byte can be connected to the space switch to the desired output of the framework covering the 20 irrigated slot, wherein - the output side of the time switch is provided in the outgoing connected to the space switch to the respective output bytes of a transmission line for the order, and - varakytkentämatriisi (31b) at the desired moment denoted ak-25 Tiivi switching matrix (31 ) when all crossover time periods have been processed. 2. An application is made to claim 1, which is amended as follows: '”25 is illustrated by the provisions of this Regulation; tidsintervallet bytena som först tas account behandling utväljs (SI) i tur och ordning frän sädana tidskopplare, vilka har lika mänga obehandlade byten som obehandlade tidsintervall. 3.. 3O 3. For the purposes of patent claims 1 or 2, a reference is made to the image configuration of the copying configuration for the following time intervals when the account is retrieved · "'(S2) is there and is intended to be used as a reference. vilka uppvisar koppiingsbehov account den tidskoppling pä 35 utgängssidan pä den ena sidan av rumskopplingen, vilken upp- '···' visar det minsta antalet frän olika ingängar kommande kopplin-; gar (S2). 90707 BC A method according to claim 1, characterized in that when the switching configuration of the considered time slot is formed, the bytes to be processed first are selected (SI) in order from time switches which have as many unprocessed bytes as there are unprocessed time slots. Method according to Claim 1 or 2, characterized in that the bytes to be processed in forming the switching configuration of the considered time slot are selected (S2) in the order of the input time switches which have switching needs to the output switch on the other side of the state switch 14 90707 which has the least number of different inputs. connections (S2). 4. The first of the patent claims 1 or 2, according to which a copy of the image configuration is used for the purpose of determining whether the account has been used to determine the value of the data, the first of which is an exemplary copy number. enskild utgäng. Method according to Claim 1 or 2, characterized in that the bytes to be processed are formed in each case for the input switch which has the most switchable time slots for a given individual output when forming the switching configuration of the considered time slot. 5. A patent according to claim 1 or 2, which is intended to include an image of the copying configuration for the first time. gäende koppiingar (S13). 15 6. The present invention is set forth in paragraphs 3-5 of the invention, which is incorporated herein by reference in its entirety. These criteria are used in the calculation (S9) for the transfer and the transfer of the transfer (S9). Method according to Claim 1 or 2, characterized in that the bytes to be processed in each case when forming the switching configuration of the considered time slot are selected such that the input with the least number of connections to the different outputs is selected from the equivalent selection options (S13). 6 3-5 A method as claimed in any one of claims, characterized in that the examined period, the connection configuration in each case be reading the byte 20 so that it first meets the output side of the criterion of the time switch (S2) of the case and then also in the input side of the criterion of the time switch (S9) is selected from the selected output side time switch for. 7. A patent according to claim 1 or 2, which is intended to include an image for the purpose of: account den tidskopplare pä ingängs-sidan pä den ena sidän av rumsomkopplaren, vilken tidsomkopp- "lare uppvisar det minsta antalet frän olika utgängar kommande --- 3¾ kopplingar. Method according to claim 1 or 2, characterized in that the bytes to be processed when forming the switching configuration of the considered time slot are selected (S2) in order from the output time switches with switching needs to the input time switch with the least number of different outputs on the other side of the status switch. . 8. An application for a patent according to claims 1 or 2, which is intended to include an image for the purpose of determining the amount of data to be used in the first instance; bestämd enskild ingäng. is 90707 Method according to Claim 1 or 2, characterized in that the bytes to be processed in each case when forming the switching configuration 35 of the considered time slot are selected for each output switch which has the most time slots to be switched for a given individual input. is 90707 9. An embodiment according to the preceding claims 1 or 2, which is intended to include an image of the configuration configuration for a particular time between the following steps in the first and second steps, the alternative alternatives according to the same invention being used for a further 5 minutes. the account was foreground (S13). Method according to Claim 1 or 2, characterized in that the bytes to be processed in each case when forming the switching configuration of the considered time slot are selected such that the output with the least number of connections to different inputs is selected from the equivalent selection options (S13). 10. For the purposes of realization in connection with the transmission of signaling power in digital signal boxes, colors 10 gängsbyten, varvid - account först hos tidsomkopplaren pä fi ingssssvall utsöks ett 15 fritt tidsintervall för byten som skall säkerställas, och dä det fria interval interval funnits, innehället hos byten som skall säkerställas kopieras head detta fria tidsintervall och rumskopplare kopplas account olika utgängs-tidsomkopplare, och 20 - ifali inom tidskopplaren pä ingängssidan icke hittas ett fritt tidsintervall, säkerhetskopplingen utförs i rumskoppla-ren sälunda, att det säkerställande tidsintervallet som . .. '25 10. A method for implementing switching required by routing backup in a digital cross connect, wherein the coupling calculation 10 kemiseksi the method according to any one of the preceding claims, characterized in that the certified input byte is copied to two output byte, wherein - the first requested the input side time switch to a free slot the certification bytes, and when the gap is found is copied to the content 15 to be certified byte to that free time slot, and coupled to be certified and the certification byte mode switch via different output time switches, - or if the input side time switch are no free time slots, varmennuskytkentä made in the space switch, so that its to some 20 I was coming to be verified term content is copied to two output. 11. For example, the realization of the copying is performed on a duplicate signaling circuit in a digital copying operation, the signaling voltage of the transmission signal being realized according to the following: 1: N processing functions, the variation is shown above. 3) the calculation of the total number of entries in the first instance of the present invention, if the same number of claims is in the first instance, "; - tidsintervall för den utvalda tidskopplaren pä utgängssidan. 11. A method for implementing switching required by the bidirectional path protection in a digital cross connect, To some 25 sa path protection implemented in one cross connect both the 1: n distribution facility that the N-1 selection function, wherein the calculation circuit is used according to any one of the preceding claims, or some other method, characterized in that the input side time switch in which connecting to the same time slot both ..30 1 time slot to be divided and all N selection time slots, all of which always come at different input time switches, and performing 1: N distribution over all N selection function time slots connected in the status switch to the distribution time slots. for the output lines, that the selection of 35 desired time slots from the N selection time slots for the selected output time switch. 90707 BC 12. Tid-rum-tid-korskoppling, särskilt för situationener somom 5 kräver en ändring av korskopplingen, varvid korskopplen är försedd med tidskopplare (T) oc rumkopplare (S), och varvid de account korskopplingen (10) inkommande ochärär ut ut in the case of data sets (1 ... N) with a maximum of, the color of the logical host and the log of the frame 10-10, a light field and the time interval of the same korskopplas, utvörs av byten, och varvid den städse aktella configatio-nen hos korskopplingen är uppteckad In the copying matrix (31), the transverse matrix of the image copying matrix (30) is shown in the configuration of the copying matrix (31b) as shown in the configuration of the copying matrix (31b). under signaling from the signal to the synchronous genome of the korskopplingen. 12. A time-space-time cross-switch, in particular for situations of change in the need for cross-switching, wherein the cross-switch is provided with time switches (T) and state switches (S), and wherein the signals entering and leaving the cross-connection (10) are high-speed serial data streams ( 1 ... N), in which the logical units to be moved and cross-connected in the time slots of the logical frame structure are bytes, and in which case the current configuration of the cross-switch is stored in the switching matrix (31), characterized in that the new switching configuration is adapted to be calculated by the cross-switching controller (30). (32) and stored in its switching matrix (31b), whereby the new switching configuration is effected synchronously under the control of a signal propagating through the cross switch. 15 A cross-switch according to claim 12, characterized in that one input and one output line are reserved for limited distribution operation in the state switch, wherein the input byte allocated for distribution is copied via the state switch to preselected time slots of said reserved output line by a cross-switch group added after the cross-switch. (SE) is connected to the respective output lines by a time switch group (TE) added to the crossover. Cross switch according to Claim 12, characterized in that a double capacity is provided for the state switch for complete distribution operation, the first half of the state switch capacity being used for connecting the bytes selected by the method according to one of the preceding claims 1 to 6. , and wherein the second half of the capacity of the state switch is used to switch the distribution operation by a method according to any one of the preceding claims 1-6. : -35 1. Förfarande för configering av en tid-rum-tid-korskopp- Ling vid situationer som kräver en forsändring av korskoppling-en, varvid korskopplenen försedd med tidskopplare (T) ooh rumskopplare (S), och varvid de account korskopplingen (10) in- I:: 17 90707 kommande och därifrän utgäende signalerna utgörs av seriefor-made dataströmmar (1 ... N) med hög hastighet, vilkas inom tids-intervalvalos hos en logisk ramstruktur överförbara och Kors-kopplingsbara logiska enheter utgörs avgörs byte, och varvid den 5 städse aktella configurationen hos korskopplaren är uppteck-nad i en koppiingsmatris (31), kännetecknat av att - korskopplingens nya koppiingskonfiguration bildas periodvis, varvid var och en tidsperiod omfattar en pä förhand bestämd mängd t ids for the purpose and to the time-10 of the image copying configurations up to and including the re-servopplings matrix (31b), and the number of copies of the total number of copies of the total number of copies of the total number of copies of the total number of copies of the total number of copies of the current number i ord ordning som krävs av den utgäende transmissionslinjen, och att 20. reservkopplingsmatrisen (31b) vid önskat ögonblick antecknas säsom Aktiv koppiingsmatris (31), d korskopplarens samtliga tidsintervall behandlats. 13. Korskoppling enligt patentkravet 12, kännetecknad av to Bruk av en begränsad fördelningsfunktion i rumskopplingen reserverats in ingängs-- ja engängslinj, varvid a fördelning in the same way as in the case of the authorities of the Member States, after the entry into force of the transfer order, the transfer of the return payment (SE) is based on the payment of the transfer order (SE). . - '• 3: 0 14. Korskoppling enligt patentkravet 12, kännetecknad av att i och för en fullständigt fördelningsfunktion for rumkopplar-na anordnats en dubbelcapitet, varvid den första andelen rums koppi a rna s capacityt .35 patentkraven 1-6, och varvid den andra andelen hos hos rumskopp- ·. · Larnas capacities används för en inkoppling av fördelnings- functioninen enligt förfarandet en avt visgot av de föregäende: patentkraven 1-6.