FI90707C - Method of forming the coupling routes in a cross coupler - Google Patents

Description

1 90707

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

10

The synchronous digital hierarchy (SDH) is quite extensive and holds the developed entity for the transmission of time-division signals in a telecommunication network whose backbone transmission network is evolving from separate PCM-coded links towards a remote-controlled cross-link network. Recommendation CCITT G.707 Maarit interprets the signal of the first level Synchronous Transport Module (STM-1) 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 sa, including control blocks; tailOin The STM-1 frame transmits 63 TU-12, Tributary Unit 2 Mbit / s signals that can accommodate a 2 Mbit / s signal from a standard 30-channel PCM system. The STM-1 frame repeats 8000 times per second, which is the same as in the subsystem; each byte of the frame forms a tailOin 64 kbit / s 25 channels. The SDH signals, i.e. the transport modules, are formed from the signals of the subsystems by interleaving bytes.

The SDH cross switch (DXC) can silence traffic between different SDH levels and 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-risk switch with 2 Mbit / s channels connected to the input and output ports. The specific goal of the cross-connect is to optimize the capacity utilization rate of the transmission network. In addition, Silia 35 must be able to handle the flexible reconfiguration of the network, i.e. the rerouting of connections, and guarantee the rapid use 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 go beyond the detailed structural description of the devices.

Digital cross-connectivity has been extensively studied for optimal 5 conditions for finding a usable architecture. A structure that satisfies the conditions of capacity, unobstructedness 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-switching structure, the addition of an unobstructed connection is much more -10 field demanding task, the white TST switch is basically unobstructed. A component of a large computational need is, for example, the large number of bytes or channels included in the 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-connection is completely or partially duplicated, whereby there are more advantageous possibilities for calculating 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 create and decompress channel-specific 64 kbit / s lines. In the case of the control panel's TST switch, within the limits allowed by the time-25 restrictions, a free route must be searched through the switch, so that the block can be accepted even if the switch has free capacity, because the block is only applied to one channel at a time. Such operation cannot be accepted 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 use of the capacity of the transmission paths and the myOs cross-switch, in contrast to telephone exchanges, where overcapacity can be used to combat blocking situations.

3 90707

In conventional SDH cross-switches using the TST structure, the problem of finding an unobstructed path 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 lahtiipuolen time switches Til ... Tin and Tol ... Ton, to change a number of bytes aikavaiien positions (within a frame) signal sisaiia. The central mode switch S transfers the byte of the signal from the time switch-10 to the signal going to the second time switch. The time or 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, cross-connection is implemented in a modular manner. The first time switch and the ti-15 law switch affect the establishment of an unobstructed connection from any time line of the input line to the correct source line. The time switch on the open side does not affect the achievement of an unobstructed connection, but merely switches the channels, i.e. the time slots, in the correct order as required by the open line.

20

The object of the invention is to show a method and an architecture implementing the method for cross-linking high-speed digital signals, which can implement unobstructed switching and obviate the known shortcomings and disadvantages.

25

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

The advantage of the invention is that the entire cross-connect 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 changing the error faults of the switching matrix of the cross-switch modules operating at the same clock.

s 90707

The invention can be applied to the connection of transport modules (STM-N) standardized in synchronous digital hierarchy (SDH). The invention can be applied to cross-linking according to the myds 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 a simplified flow chart of a selection procedure according to the invention for a time slot to be switched.

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

Figure 1 illustrates in principle the structure of the time-space-time cross-switch used in the present 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 keksinndn can be applied, and wherein the cross-connect control section 20 is able to simultaneously control all the 30 time switch sisaanmenopuolen 1 ... is carried out in badger-L aikavaiin medium women coupling. The state switch S comprises N * N switches, which are used to implement N outputs even N outputs. On the Laht side, there are again N time switches, which in each case perform L time interval mutual connections-35

2 shows a cross-connect control 20 is capable of simultaneously (synchronously) to carry out the input time switch and lahtdpuolen-I and the state of the switch 31 of the switching matrix (CM Connection mat-

I. I

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 and a backup switching matrix (31b, not shown) in use. The configuration calculator 32 of the cross-connect control processor 30 generates a new configuration of the configuration method shown below, which is stored in the backup switching matrix with which the switching configuration update 10 is performed. As output data, the configuration calculator has the channel division at the inputs and the desired output and channels. The cross-switch control unit 20 utilizes the updated matrix 31b when controlling the time and mode switches to match the new switching configuration.

15

The efficient implementation of the configuration calculation according to the invention 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 at a time. In other words, when the input side of the time switch 20 and the N * N space switch can be found in non-blocking mode an arbitrary aikavaiille K, one can be assured that other time-vaiit K + l, K + 2, ..., L can be solved at the same time of principle la. N3in ols configuration of the cross connect can be calculated aikavaii at a time so that the non-blocking connection configuration 25 is always the search for jaijelia aikavaiien K, K + l, K + 2, ..., L, the input side time switch and the space switch.

The mode switching of the set time interval is unobstructed when all the outputs of the mode switch are in use. In other words, the time switch of the input side must switch all 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 bays. Unless there is a time slot coming that should be routed to a particular bay, then that bay does not need to be used. This is not the 35-ols of the space switch van in front of the input side time switch is to distribute the tasks of channels, a steady-time slots so that the space switch can connect them, O-keisiin, desired outputs. More specifically, the state switch must silence a blocking situation in which there would be more than one channel to be routed to the same time slot in the same time slot.

According to the method of the invention, the configuration calculator forms a switching matrix such that the cross-connection according to Fig. 2 operates without hindrance.

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 the connection matrix or old connections are removed from it on the basis of Silia, so that all connections of the risk switch 15 are reconnected on the basis of the new connection state. Thus, even old connections that share power after changing the mybs switching configuration can get a new routing crossover. The update is performed precisely by means of a synchronization signal coming from 20 predetermined clocks 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 disrupted when the switching matrix update is implemented.

25

The switching method is calculated by the cross-switch configuration time by time. First, the input channels, i.e. the bytes in the frame, are divided into as many groups as there are cross-connectable signals in the 1st transport period of the transport module of the interface. For example, 30 input side time switch liitetylia 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 your built 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 a standard pointer or by calculating it. 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 defined in this way, the cross-connection paths are solved in such a way that the switching configuration mytts realized by Silia means that the time-counted mytts that have not been calculated can be switched. The solution 5 of the entire cross-connection field is thus obtained by the periodic method according to Fig. 3.

In this method, when calculating one switching time period to be considered, the time switches are first selected from those in which the associated inputs and outputs of the state switch 10 are full, i.e., which have as many unconnected channels as there are unused time periods. Switching decisions are first made to a group called a priority group. Sources that are not fully used need not be used at every time. This means that the income and outputs that are fully used must be used during this period; other free connections can be left unused if suitable channels are not available. 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 state switch in this time slot. Its verse examines whether all time slots have been processed, i.e. connected. If there are time slots to be switched and the signal is moved back to the beginning and the calculation of the unobstructed connection for the next time slot is performed. The last time period and 25 are moved to 'end'.

Figure 4 shows a single time slot selection procedure in the form of a flowchart. The start is moved to the check block SI, where it is checked which inputs and outputs are selectable when searching for a route to the input and output paths. Said priority group of the tail is always selected first. If the priority switches are not found, other inputs and outputs are set to select.

In the second step S2 of Fig. 3, a solution for one time slot is retrieved in the calculator 30 so that of the unconnected bytes, the output with the least choice in the time slots, i.e. with β 90707, has the smallest number of channels from different inputs. The selection naturally takes place from among the fields of the state switch which were not previously selected when solving the time in question, i.e. which are free. The bays available for selection are already checked 5 in the initial stage SI, as shown in Fig. 4, i.e. first it is checked which bays are selectable and the bay with the smallest number of channels from different inputs is retrieved. Once the output is 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 is selected. In this case, too, the revenue already processed is not relevant, and this is ensured in the check step SI of Figure 4 at the very beginning of the selection pair, as was done in step SI in the selection of the output.

20

Thus, the check block SI first checks that the output is selectable and then that the input is selectable. Selections are made for the review. The criterion used in the selection of the source is based on promoting the establishment of an unobstructed connection for the last 25 routing choices. This is based on the fact that it is easier to connect the output with the least different inputs at the beginning than with 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 cell 30 for as long as possible. Freedom of choice is maintained in Taiia, and solutions for the following time slots are easier to find.

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

1 '9 90707

If, as a result of steps S2 and S13 of Fig. 4 above, the input and output time switches in steps S3, S14 have an equivalent time switch at several inputs or outputs according to the selection criterion, the first quasi-option in step S4 and in step S1, respectively, is selected. If this selected option in the check of step S7 does not produce an unobstructed connection, a recursive search of the solution for the time period in the cat has to be performed. The search is now performed by deselecting in step S12 up to the previous unexperienced 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 the el-bread selections are not successful from the millions of options, returning to the next selection situation where the equivalent alternate-15 conditions are valid. If necessary, this is repeated until a solution is reached for the time selection. In this way, at worst, all equivalent combinations of alternatives are used, in which case an attempt is first made to move the selection to the different entry time switches until all input options have been used. 20 If this does not produce a successful result, the selection starts to be transferred to the different outputs. Tate goes through all of the options on the revenue side each lahtdpuolen per option. In the worst case, the search for a time-selective solution can handle a maximum of (N * N) -1 recursive search.

V; 25

According to Figure 4, the method described above also includes myOs in the handling of the emergency situation in step S5, before proceeding to the input selection in step S9. An exceptional situation may occur when a selection is made from a lower-priority group of an input or output connection, regardless of the fact that the channel is not found in each corresponding higher-priority input or output group whose outputs or inputs must also be connected in the time slot. Such an exceptional situation is indicated 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 it is the last chance to connect to the input or output to be connected in the time slots. According to the method used in the connection search sequence used, then the input is first output, an exceptional situation occurs in the output selection sequence, but before the input selection, as shown in Figure 4. In line with the above, the justification is that there are more than 5 different bays in the priority group. The TailOin selection could focus on the input that provides the most channels, even if for a single input, the only switching option for the Single channel would be 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, the operation of which continues within the normal operation described above.

The principle 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 the nile 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 two-way cross-switch, the second-direction switch configuration can be formed in an analogous manner, e.g. 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. Additional capacity must be provided for this crossover. This is done by reserving one input line and one output line 30 in the mode switch using the limited distribution function. In addition, the TST cross connect lahtttpuolen-en jaikeen time switch adapted to select the blocks SE (not shown) and time switch blocks TE (not shown) for each lahtdlinjaa closets. The input channel defined for distribution is routed through a state switch to said reserved source line, where the TST time switch 35 arranges the channels. The arrangement of the channels is adapted to the tailGin so that the respective selected bay lines TE of the cross-connection can receive the distribution channels via the selectors SE. The Lah time switch TE then arranges the time slots I connected to it; 11 90707 transfers to the required order. Alternatively, for full distribution operation, a double capacity can be arranged for the state switch, whereby the first half of the capacity of the state switch is used by the methods according to the invention for routing the switched time slots, and the second half of the capacity of the state switch is used. In the distribution operation, the tail can be used for direct-time copying of time slots to the desired time slots of the second half.

10

According to a further development of the method, the connection required for route verification is arranged in such a way that the time interval of the input channel to be verified is copied to the two output channels, i.e. to the bay channels certifying each other. First, it is examined whether the input time switch has free time slots for the uplink channel. If such a free time is found, the time of the time period to be verified is copied to the free channel. Both of its channels are connected via a mode switch to different output time switches and out to lines. If no free time slots are found in the input time switch-20, the verification switching is performed in the state switch so that the contents of the time slot of one of the incoming channels to be verified are copied to the 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 from the N 30 signals to be verified. Thus, in the TST cross switch according to the invention, the signals to be verified can be amplified in the mode switch of the corresponding verifiable signals in the reverse direction, and thus unobstructed operation can be achieved.

35 As shown in Figure 5, the time slots of the route-confirmed 1: N / N: 1 connections and the others of its fraction are first connected. If not all input / output time switches have them, the time slots of the priority groups are switched on normally.

'' r.

ΐ2 90707

In bidirectional route verifications, there are always N + 1 si-inputs, 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. NSin is thus myOs output-5 and is N + 1.

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

15

The method according to the invention provides an efficient calculation method for the connection configuration. The new TailOin configuration can be quickly computed in processor 30 (Figure 2). This makes it possible to implement an unobstructed and synchronous cross-connection, with which the exchange of the error-free switching matrix can be arranged without having to duplicate the cross-connection time switches. The method according to the invention can also be applied to such cross-switches in which the mode switch blade is connected in parts of the byte in parallel.

25

The invention has been further described by the fact that first the source and then the input are selected. The person skilled in the art understands that the method can be implemented in a capped way, by calculating the non-blocking connections periodically, first selecting the input-30 line and then the output line. The above was mentioned as a time period of 63 or 64 time slots, in which case the number of bytes to be delayed in each selected time period is 63 or 64 times the number of input time switches. However, it is conceivable that another suitable number of bytes be selected for the time period.

Claims (14)

13 9 0 707 Patent applications A method for configuring a time-space-time cross-switch in crossover situations change situations, wherein the cross-switch is provided with time switches (T) and mode switches (S), and wherein the signals entering and leaving the cross-connect (10) are high speed serial data streams ( 1 ... N), in which the logical units to be moved and cross-connected in time slots of the logical frame structure are bytes, and in which 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 period kMsittaa predetermined land predetermined quantity of time frames, and wherein each aikavaiia formed of the connection closets deposited varakytkentamat- 15 rice (31b), and in that - within each period of the input side in each case to select the still available bytes as the input side time switch-melia a byte to be coupled to the space switch through the response tama tavu can be connected in the space switch to the desired ouptuts TAR the framework 20 irrigated period of time, wherein - lahtOpuolen time switch is provided connected to the space switch to the respective lahtdttn bytes of outbound transmission line for the jarjes-tykseen, and that - the varakytkentamatriisi (31b) at the desired instantaneous entered in a k-25 Tiivi switching matrix (31) when the cross-connect all time periods have been processed. 2. Forfarande enligt patentkravet 1, kånnetecknat av att vid. '”25 bildande av kopplingskonfigurationen for det if rågavarande; tidsintervallet bytena som Forst tas till behandling utvåljs (SI) i tur och ordning från sådana tidskopplare, vilka har lika många obehandlade byten som obehandlade tidsintervall. 3.. vilka uppvisar kopplingsbehov till den tidskoppling på 35 utgångssidan på den enan sidan av rumskopplingen, vilken upp- '···' visar det minsta antalet från olika ingångar kommande kopplin-; gar (S2). 18 90707 A method according to claim 1, characterized in that when forming the switching configuration of the considered time slot, the bytes to be processed first are selected (SI) in sequence from time switches having 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 when forming the switching configuration of the time selection under consideration are selected (S2) in the sequence of the input time switches which have switching needs on the other side of the state switch 14 90707 & Inputs (S2). 4. A method according to claims 1 or 2, which can be used as an example of a copying configuration for the purpose of determining the interval between the present invention, is preferably performed in such a way that it is exemplary. enskild utgång. Method according to Claim 1 or 2, characterized in that, when the switching configuration of the time slot in question is formed, the bytes to be processed are selected in each case for the input switch which has the most switchable time slots for a given individual output. 5. Forward a patent according to claims 1 or 2, which is not shown in the description of the total configuration of the invention. total number (S 13). 15 6. The method is preferably set out in claims 3-5, which can be used to illustrate the copying configuration for the time interval between the bytes of the device and the number of steps to be used. These criteria are used in the first instance (S9) on the other hand and on the other hand. Method according to Claim 1 or 2, characterized in that, when the switching configuration of the time period under consideration is formed, the bytes to be processed in each case are selected by selecting from the equivalent selection options the input with the fewest connections to different outputs (S13). 6 3-5 A method according to any of the preceding claims, characterized in that the checking aikavaiin connection configuration in each case to be processed byte 20 is selected so that it first fills the lahtOpuolen the criterion of the time switch (S2) in the case, and then the inlet side by the criterion of the time switch on the case (S9) the selected lahtOpuolen aikakytkinta closets. 7. A method according to claims 1 or 2, which can be taken as an example of a copying configuration for the following conditions: tidskopplare på ingångs-sidan på den ena sidan av rumsomkopplaren, vilken tidsomkopp- "lare uppvisar det minsta antalet från olika utgångar kommande --- 3¾ kopplingar. A 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 sequence from the output time switches having switching needs to the input 30 on the other side of the mode switch, FUTURE CONNECTIONS. 8. A method according to claims 1 or 2, which can be shown in the description of the copying configuration for the purpose of determining the interval between the following steps; an input. 19 90707 Method according to Claim 1 or 2, characterized in that, when forming the switching configuration 35 of the time slot under consideration, the bytes to be processed are in each case selected for the output switch which has the most switchable time slots for a given individual input. is 90707 9. A method according to claims 1 or 2, which can be used as an alternative to a copy configuration for detecting an intermittent bypass of a step on the same side, in which an alternative alternative to the first part is shown. to the other side of the head (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 time slot in question are selected in such a way that the output with the least number of switches to the various inputs (S13) is selected from the equivalent selection options. 10. Forwarding for sale in connection with the transmission of a signal from a signaling device to a digital coupler, for example, for the sale of a signaling device to a digital carrier gångsbyten, varvid - till Forst hos tidsomkopplaren på ingångssidan askåks et 15 fritt tidsintervall for byten som skall sörkerstållas, och då det fria interval funnits, innehållet hos byten utland som skall särkerstållas kopieras petta dia fria rumskopplare kopplas till olika utgångs-tidsomkopplare, och 20 - ifall inom tidskopplaren på ingångssidan icke hittas ett fritt tidsintervall, såkerhetskopplingen utfårs i rumskoppla-ren sålunda, att det såkerstållande tint. .. '25 required for the coupling 10. The method of path protection is carried out, in order to digital ristikytkimesså, wherein the coupling calculation 10 kemiseksi Used when any one of the preceding claims mu band Using the method further characterized in and working certified input byte is copied into two låhtåtavuun, wherein - the first requested the input side aikakytkimestå free aikavåli var-five bytes, and when the free election was ldytynyt, copy 15 to be certified byte sisålto the free aikavålille mill, and kytketåån certified and certification byte through the space switch in different låhtd-time switches, - or if the input side aikakytkimesså no free aikavåliå, varmennuskytkentå done in the summer tilakytkimesså to and working its to some 20 I was becoming within the time interval to be verified is copied to the two sources. 11. Farfarande for realizering av en koppling som kraver en dubbelriktad signalvågssåkring i en digital korskoppling, varvid signalvågssåkringen i en korskopplare realiserar såvål 1: N fårdelningsfunktionen som N: 1 valfunktionen, varvid i och får. 3. "; stycken valfunktions-tidsintervall for den utvalda tidskopplaren på utgångssidan. 11. The method of implementing the required coupling of the bidirectional path protection in a digital ristikytkimesså, To some 25 sa path protection take yhdesså ristikytkimesså correctly with one of the distribution facility and working of one selection function, wherein the coupling of the calculation Used when any one of the preceding claims compound or another Using the method further characterized in and working the inlet side aikakytkimisså is connected to the same time slot as well. that 35 the desired time slot is selected from the N selection function time slots for the selected output time switch. 1 «90707 12. Tid-rum-tid-korskoppling, sårskilt for situationener som 5 kråver en åndring av korskopplingen, varvid korskopplen år forsedd tidskopplare (T) and rumskopplare (S), och varvid de till korskopplingen (10) incommande and dåri in the form of a data set (1 ... N) with a maximum length, the color of the logical hosts and the logic frame 10 is there, the number of overflows and the time interval of the korskopplas, utgors av byten, ocv varvid den stådse aktella configuren hos korskopplingen år upptecknad i upptecknad The copying matrix (31), which can be used as an image of the copying configuration (30), can also be connected to the copying configuration (30), but also to the copying matrix (31b), which can be copied to the copying configuration. and the signal can be synchronized with the genome of the genome. 12. A time-space-time cross-switch, in particular for changing the need for cross-switching, wherein the cross-switch is provided with time switches (T) and state switches (S), and wherein the signals coming to and leaving the cross-connection (10) are high-speed serial d 1 ... N), in which the logical units to be moved and cross-switched in the time slots of the logical frame structure are bytes, and wherein the current configuration of the cross-switch is stored in the switching matrix (31), characterized in that the new switching configuration is in the switching calculator (32) and stored in its switching matrix (31b), whereby the new switching configuration is brought into effect synchronously under the control of the signal propagating through the cross switch. 15 A cross-switch according to claim 12, characterized in that one input line and one output line are reserved in the mode switch for limited distribution operation, wherein the input byte distributed for distribution is copied via the state switch to a preselected time slot of said busy output line. (SE) is connected to the respective output lines with a time switch group (TE) added to the cross switch. 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 capacity of the state switch being used by a method according to any one of the preceding claims: 1 to 6: 3.0, wherein the other half of the capacity of the state switch is used to switch the distribution function by a method according to any one of the preceding claims 1-6. : -35 1. F6rfarande f6r configuring av en tid-rum-tid-korskopp- Ling vid situationer som kråver en fåråndring av korskoppling-en, varvid korskopplen ärr forsedd med tidskopplare (T) and rumskopplare (S), och varvid de till korsk (10) in- I:: 17 90707 command and signaling device for a series of data sets (1 ... N) with a maximum of, at the same time, a host of logic overloads and a Kors-kopplingsbara logiska enheter utgors av by, and the color of the current configuration of the copying configuration and the copying matrix (31), can be shown as the copying configuration of the copying configuration during the period, tidsin- 10 tervall bildade kopplingskonfigurationen upptecknas i en re-servkopplingsmatris (31b), och att - inom var och en tidsperiod av de på ingångssidan stadse ånnu ovalda by tena medelst en tidskopplare på ingångssidan utvåljs en sädan by kopte kopplas genom rumskopplingen, att denote byte 15 kan kopplas till rumskopplarens onskade utgång inom ramen for det utrågavarande tidsintervallet, varvid - tidskopplingen på utg Ord. when the load is on the transmission line, and in Fig. 20. the backup copying matrix (31b) is shown on the active anti-transmission matrix (31), for which the copying matrix is delayed. 13. Korskoppling enligt patentkravet 12, kannetecknad av att for Bruk av en begrånsad fordelningsfunktion i rumskoppiingen reserverats in ingångs- oc en engångslinje, varvid en f6rdelning bestånging ingångsbyte kopieras via rumskopplingen på fora after the end of the cross-section of the cross-section of the cross-section (SE), the head of the cross-section of the cross-section of the cross-section (TE). - * • 3. 0 14. Korskoppling enligt patentkravet 12, kannetecknad av att i och en en fullståndigt fordelningsfunktion f6r rumskopplar-na anordnats en dubbelcapitet, varvid den f6rsta andelen hos rums koppi a rna s capacity utnyttjas for en koppling av byten -. *. In the case of a state-of-the-art patent in the first year, patent claims 1 to 6, and in the case of the same and a host of rumscopp- ·. · larnas capacity anvånds f6r en incoppling av fordelings functionen enft fSrfarandet enligt något av de f6regående.