DE1562127A1 - Method for route search and establishment of connection routes in telecommunications, in particular telephone switching systems - Google Patents

Description

Dipl.-Ing. Heinz Ciaessen 10 0/127

Patent attorney

7, Stuttgart - 1

Rotebuhlstrasse 70

ISB / Eeg. 3833

G. J. Le Strat-A, Regnier 1-8

INTERNATIONAL STANDARD ELECTRIC CORPORATION, NEW YORK

Method for finding the way and producing Connection paths in telecommunications, especially! Telephone switching systems

The priority of the application in France of January 30, 1967 No. PV 93.057 is in Availed.

The invention relates to a method and a circuit arrangement for carrying out the method for route search and establishment of connection routes taking into account existing false call connections in coupling networks with input circuits such as subscriber circuits and outgoing circuits such as connection sets t »m% a for telecommunications, in particular telephone exchanges.

Switching systems of the type mentioned are, for example, from the French patents 1,382,913 (with the addition 85,259) and 1,431,902 known. The switching network has switching stages with several switching matrices in each case, while the possible connection paths in a path search network simulated in the switching network to be established.

In the known switching systems, they are in the false call state subscriber circuits located, for example, by actuation of a false call relay marked as being in the false call state

January 24, 1968

Krü / H. - 2 - ■

009809/0667

ISE / Reg. 3833

or included in a false call chain circuit. The present Invention, however, is concerned with switching systems that no such means for marking or otherwise identifying the subscriber circuits with regard to their false call status have, but the one connection of the subscriber circuits (input circuits) via the switching network to form connection sets (Output circuits) and a false call mark of the so occupied Enable connection sets.

However, false call connections leading via the switching network can lead to an internal blockage of the switching network during the search for new connection paths. Finding a new one The connection path can namely remain unsuccessful because a path section, for example an intermediate line, for this connection path of the switching network, which is part of a false call connection. The object of the invention is therefore to in the method of the type mentioned at the outset, this internal blocking to avoid. This is achieved according to the invention in that, after a connection with a false call state has been established, the between an input circuit in the false call state and an output circuit runs over the switching network, this output circuit is marked as being in the false call state and that this missed call connection is maintained and only then for the purpose of further handling the missed call in any other is released in a suitable manner when it has been determined that a new connection path over a route section of this false call connection can be produced.

According to a further embodiment of the invention, after an unsuccessful path search for a new one, between a predetermined one Subscriber circuit uol a connection set of the required The following steps are carried out one after the other:

009809/0667

ISE / Seg * 5833

a) The route search is repeated, with the busy marking on all such connecting routes through the switching network is pressed, via the subscriber circuits in the false call state marked with as being in the wrong call state Connecting sets are connected,

b) if the second route search is successful, a connection set marked as having the wrong call status is displayed in the the suppression of the busy marking a successful one Route search promises, identified by the fact that this marking selectively on the various false call connection records, is suppressed,

c) the one in the false call state with the identified one The subscriber circuit connected to the connection set is identified,

d) between this subscriber circuit and this pre-connection record existing false call connection and this connection set are triggered

e) the new connection path is between the specific Subscriber circuit and a connection set of the required Class switched through,

f) a new false call connection is established between the one in the false call state located, previously identified subscriber circuit and any connection set established, which is marked as being in the false call state, or the subscriber circuit is when this new Wrong call connection cannot be established, dropped and treated like a normal calling subscriber circuit.

009809/0 6 87

ISE / Eeg. 3833

Further developments of the invention relate to the circuit arrangement for carrying out the method according to the invention.

The invention will now be explained in more detail using an exemplary embodiment. Show it:

1 shows a basic circuit diagram of a switching system

to explain the method according to the invention,

Figo 2 shows a circuit arrangement for implementing the method according to the invention shown in Figure 1 _o in conjunction with a specific identification means, and

3 shows a circuit arrangement for controlling and scanning connection sets.

In Fig. 1, EG denotes a switching network, which the production of connections between input circuits, such as subscriber line circuits, which are on the left of the switching network are shown, and output circuits, such as connection sets, shown on the right-hand side of the switching network are made possible. The switching circuits in the switching network are controlled by the devices shown under the line X-X. These devices include, for example, a marker UC, which directly on the circuits of the switching network EO acts, a data processing device Z, which controls the marker UC, and scanner and allocator, for example one between the data processing device and the subscriber circuits arranged subscriber circuit scanner EA and a inserted between the marker and the connection sets Allocator CJ. It should be noted that the marking process of the missed call status in a connection set essentially in the actuation of a false call relay exists.

- 5 - 009809/0667

ISE / Reg. 3833

To explain the method according to the invention, it is assumed that a false call connection 1 has been established by a subscriber circuit LFA with a false call via the switching network RC to a connection set JFA1. This connection set has been connected to the subscriber circuit LFA in order to handle the corresponding call. If the usual test device has detected a false call status ("Subscriber does not dial"), the connection set is marked by the allocator CJ with a "false call ^w This connection set is noted in a memory SJ arranged in the data processing device, which is connected to the scanner EJ and serves to transmit the status of each connection set for the purpose of recording.

When a new call arrives in a subscriber circuit LHA., the data processing device establishes this call by sending a character from this subscriber circuit to it a message leader 2 and the scanner EA is transmitted; it then initiates further operations to clear this call, namely the connection of the calling subscriber circuit with a connection set. For this purpose, for example, it is necessary to use this Subscriber circuit first with a designated for the election recording Connection kit and then with an internal connection kit or with an external connection kit for connection to the to connect the desired participant. Each time the marker UC searches for a route in the switching network to connect the calling subscriber circuit LNA with a connection set of the required Class before

The connection 3 symbolically represents such a route search, and it is assumed that this route search is unsuccessful. These Unsuccessful route search can be caused by a false call connection, such as For example, the connection 1. may be conditional, which in the switching network RC keeps such. © sections of the route over which the new

- 6 009809/066 7

BATH ORIGINAL

ISE / Reg. 3833

Connection could have been switched through. The marker briefly suppresses the busy marking via the command wires 4 arranged between the connection sets and the allocator CJ in all connection records marked with "false call". It is assumed that the busy marking on the connection paths in the switching network usually comes from the connection records that occupy these paths. While so the busy mark is suppressed on connection paths belonging to connection records with a missed call, the marker begins with a second route search, which is symbolically represented by the connection 5. This second path search should therefore now be successful because the new connection path from the subscriber circuit LNA over a path section of the incorrect call connection to the connection set JNA can be manufactured.

The marker then identifies the missed call connection set JFA1, the activation of which triggers connection path 1 and thus enables the new connection to be established. In this process, the busy flag is placed on the various missed call paths (through the action on the false call connection records via connection 4) selectively suppressed, and each time the possibility of switching through a new connection path 5 is checked. For example, all connecting clauses, which are subject to a false call, are acted upon one after the other. It can also be beneficial initially to groups such connecting sentences and then successively acting on the individual connecting sentences within the group, or the action takes place first on the in a coordinate direction arranged group of such connection sets, then to the group of such connection sets arranged in another coordinate direction, etc. For example, you can first click on groups of hundreds, then on groups of tens and then on the individual connection sets be acted in such a way that the lobsters

- 7 -009809/0667

BATH ORIGINAL

ISS / Reg. 3833

of a connection set in which one hundred is found. This The process of identifying a connection set with a false call is symbolically represented by connection 6. Suppose that in this way the connection set identifies JFA1 has been. This identification is needed, however, by the way noticed not having success. It was believed that the new connection path can be routed over a section of the path of the incorrect call connection 1. However, it is possible that a new connection route must lead over route sections that belong to two or more false call connections. In this The case is the activation of more than one false call connection and the identification of the connection records assigned to these false call connections is necessary. With the one described here Modification is simply assumed that in the case in which no connection record with a missed call could be identified to to be able to set up a new connection path when it is activated (which is why it is necessary to have more than one connection set unlock), a situation of internal blocking occurs in the coupling network? the new call will then be in the designated area Way treated otherwise.

If it is again assumed that a connection set JFA1 with The wrong call has been identifiable, then the marker IJC begins with the identification of the subscriber circuit EFA, which is coupled with this connection set. This identification is symbolically represented by the connection 7. It can be carried out in a known manner.

After the identity of this subscriber circuit LFA in the Memory has been entered, the marker triggers the false call connection 1 by means of the connection 8. Triggering this Connection also includes the release of the connection set JFA1. The triggering of this connection set has of course also the interruption of its flag "false call" (for example the fall of his false call relay).

- 8 - 00980 9/0667

- 8 ISE / Rego 3833

The processes described have shown that after price activation the wrong call connection 1 the new connection path established can be »The marker then continues the full search for the new connection path and establishes it as it does is indicated by the connection 9. The new connection route leads over a section of the route of the previous incorrect call connection 1, and thereby the calling subscriber circuit LKA. connected to another INA connection kit. It is possible, however, that the new connection route via an outgoing section of the route old false call connection 1 runs and so with the same connection set is connected.

After the new call of the subscriber circuit LNA has been dealt with in this way, the marker proceeds in such a way that it searches for a new false call connection in the same way as for a normal call and this between the subscriber circuit LB ¹ A and another connection set, e.g. the connection set JFA2, produces ,, In this operating case, however, no specific class is displayed for the connection set; Any compound set can be utilized _e This process is symbolized by the connection 10, "The marker provides the occupied connection set JFA2 marked" failed call "over the arbiter OJ and the command wire 11, and the failed call state of this compound set is stored in memory SJ notes.

Nevertheless, it is possible that the establishment of the new connection 9 between the subscriber circuit LNA and the connection set JNA is an internal blocking in relation to the subscriber circuit LFA causes and does not allow this subscriber circuit LFA to be connected to a connection set »In this case there will be no attempt to establish a connection by activating another false call connection as when handling a new call made, but the subscriber circuit LFA

- 9 009809/0667

ISE / Reg. 3833

is simply left dormant to then later like a new call to be dealt with by scanning over the message headers 10a by means of the scanner EA.

FIG. 2 shows a circuit arrangement for carrying out the method described above. In this circuit arrangement, the invention is applied to a coupling network, as it is is described in said patents.

The coupling network EG consists of several switching stages, each multiple switching matrices, such as GL, Gp, G. ,, have »the switching matrices the first stage, like G ^, have their inputs on Input circuits, for example connected to subscriber circuits such as L, in a telephone exchange «Die Switching matrices (G ^) of the last stage are with their outputs to outgoing circuits, for example to connection sets (J), connected. The outputs of a switching matrix of one switching stage are each connected to the switching matrix of the following switching stage by intermediate lines such as HL, Mp. Be it assumed that the connection paths each have at least three cores, namely the usual speech cores a, b and the occupancy core c. When a connection between two circuits L and J is established via the switching network, is the occupancy wire c is constantly switched through between these two circuits, whereby the occupancy of the successive route sections, in particular that of the intermediate lines arranged between the switching matrices, by means of one of the connection set applied busy marking (or in other words, by means of a between the two circuits L and J via the c-wire flowing current) can be marked. The connection sets J are in particular (as shown) with the usual occupancy relay C. and provided with a false call relay FA, which can be made to respond and which then the false call status of the Connection set marked; this is the state in which the

- 10 009 809/0 66 7

ISE / Reg. 3833

binding set used by a subscriber circuit which is in an e-dialing state.

A routing network EI is assigned to the switching network, in which each switching matrix G ^, G ₂ , G, ... is represented by a so-called node such as' N ^, N ₂ , N, .... The last two levels of nodes, such as the nodes IL, N ~, represent groups of tens and a group of hundreds, as will be explained in more detail elsewhere. In every node representing a switching matrix there is a common multiple point m ^, m ,,, m _? available, assigned to the inputs of a switching matrix and connected to the input side with AND gates such as PE, ... ", (PE ₂ , PE,). In the node N _x , therefore, each input AND gate PE ,, corresponds to a subscriber circuit L, which is connected to an input of the switching matrix G ^. Each node also has on the output side a further multiple point nu ·, m ₂ ', m ^', which is assigned to the outputs of a switching matrix and is connected to the first multiple point via a common memory element, such as Me ,,, Me ₂ > Me ^, in Connection. Each path section or each intermediate line, such as nu'-PE ₂ -Di ,, or m ₂ '-PE _: zm ₂ , therefore corresponds to an intermediate line M ^ or M _{2 of} the switching network. Each intermediate output line nu corresponds to a connection set connected to an output of the switching matrix G 1.

In the node Np simulating the connection ten groups is the first multiple point nu towards the input side with AND gates PEj connected, which emulate connection sets. The intermediate lines

nu '-PE-rm, form the connections between the outputs of the O J ?

Switching matrix G, and the connection sets J according to. If these connections run via a distributor (mixer) in a switching system, this is also simulated in the route search network and ^{inserted between the multiple points nu 1} and the gates PEj. On the output side, the first multiple point is connected to a tens intermediate line m ^ ¹ _{via a storage element Me D.}

- 11 - 009809/0667

ISE / Reg. 3833.

In the nodes representing the connection set groups of hundreds, the first multiple point nu is connected on the input side to AND gates which simulate the connection set groups of tens. On the output side, each multiple point m _{D is} connected to a hundred-wire fc via a storage element Me _n. This wire is intended for a group of one hundred connections. In this way, each connection path leading from a subscriber circuit L via the switching network to a connection set J is _{reproduced in the path search network by a marker path between a gate PE 1} and a hundred line fc.

The AND gates PE ₁ , PE ₂ , PE ₅ each have three inputs. An input is provided for the route marking, which runs through the route search network to select a connection route and is applied to a starting point, namely to an _{input wire fe connected to the marking input of an AND gate PE 1} , this AND gate simulating a specific subscriber circuit L. . The connection path marking can be selectively applied to the input wires fe by means of a decoder 37, which in turn receives _{the identification code word of a gate PE 1 via a connection 38 from a central marker, such as UC in FIG.} This marking runs from left to right through the route search network, and under certain conditions via routes such as fe - PE ,, - m - N ₁ - .. .N ₀ . . ° N -, .. .N _n .. "N _n -Me _n - fc. Another

IOI d. $ 1) Kj Kj

The input of the gate PE is used to select such gates according to their rank in this node. This selection is made in conjunction with a time system in which a time slot is assigned to a point in the sampling cycle, to all of the input gates of one covers any node. A pulse distributor 39 distributes cyclically Timing pulses to a bundle of control lines 40, the lines of which each have a specific position in the order of precedence, and correspond to the same position for all nodes shown. The lines of this bundle are in each stage of the routing network With respect to all nodes of a switching stage, each line is connected to the inputs of the gate of the same

009809/0667 - 12 -

ISE / Reg. 5855

Ranges switched multiple times in all nodes Path marking of each gate in the time slot assigned to its rank. The third input of each gate PE is used for applying the free or busy marking · This marking comes from the cores c of the corresponding intermediate lines in the coupling network via corresponding wires c "to these gates. In reality, the free marking is due to the absence of the busy marking marked on the cores c. The busy marking blocks the gate PE. In relation to this marking are the ones with the assignment core parts c connected gate inputs as blocking inputs shown. Therefore, the path marker runs through each gate in the state in which the corresponding section of the wire c is not considered marked occupied and in which the corresponding intermediate line is free.

At the first multiple point in each node, N ^, Np, N, are therefore certain pulses of the path marker pulses assigned to the gates received in certain time slots, on condition that this marking is pending at the input of this gate and that the corresponding intermediate lines in the coupling network are free. These impulses are permanently marked by means of storage elements converted to outgoing links of these nodes. This permanent marking is thus applied to the inputs of the following Gates applied, which are arranged at the other end of these intermediate lines. Certain nodes become a route marker because of busy links cannot receive, and this marking cannot then be sent to the inputs of the following nodes get that with the outgoing intermediate lines of this conscience Nodes are connected.

The gates PEj of the node N ₀ are AND gates with four inputs each. Three inputs correspond to the three inputs of the gates PE / j, PEp, PE, (route marking, time slot and free marking of the corresponding connection sets). The fourth entrance is on one

- 15 009809/0667

ISE / Keg. 3833

Wire cj connected, via which a character to identify the connection set class is sent. The cores cj are grouped together according to connection set classes and ■ multiple switched. The core cj of the required class is marked by means of a decoder 21 to which the central marker UG sends a godeword identifying this class via a connection 22. The first multiple point of a node N ₀ then receives path marker pulses, provided that they pass through those gates PBj which emulate connection sets of the required class. These pulses - if any are present at all - are then converted by means of storage elements Me ^ into a permanent marking on the outgoing intermediate line nuJ of each node N ₀ .

The gates P1 ₁ * of the nodes EL · are concentration means and are controlled neither by a free marking nor by a class marking. These gates are AND gates each with only two inputs (route marking, time slot). The node N ^ thus receives path marker pulses, provided that there are suitable connection sets (accessible and free) in the assigned hundreds.

In this way, the route marking runs from left to right on the right the path search network, where it runs over sections that simulate possible connection paths in the coupling network, and where the availability of the intermediate lines and the connection sets with the required class taken into account, the presence of the mark on a hundred-line fc indicates that there is is possible to establish a connection between a calling subscriber circuit and a connection set of the required class in the group of hundreds identified by this vein. A marker tester 23 searches the wires fc for markings abο This is preferably done by means of a parallel check, at the same time also one of the marked wires in

- 14- 009809/0667

ISB / Reg. 3833

is selected in a known manner. The result of this selection (and, if applicable, the negative result after checking all wires, which indicates an internal blockage) is the central Markers (or the data processing device Z in FIG. 1) communicated via a connection 24.

After selection of a connection set group of hundreds by the marker tester 23, the central marker selects a group of ten in the selected group of hundreds, then it selects a connection set in this group of ten and then the successive _{intermediate lines leading to the switching matrix G 1} ^, with this switching matrix at one input the calling subscriber circuit is connected. The arrangement for making this selection in accordance with the referenced patents will now be briefly described.

All nodes each have a sampling gate ί! _Λ , PT ₀ ... PT, which are designed as TMD gates with two inputs each. One input is connected to the first multiple point of the associated node and receives the tfegemarkierimpulse in their time slots. The other input is each connected to an identification wire n ,,, n ₂ , n ,, d, cc for the node. These identification wheels are marked one after the other by means of a decoder 41 on the basis of code words which arrive from the central marker UG (or the data processing device) via a connection 42 to this decoder. This activates the scan gates in the nodes that are to be subjected to the test process. The output of each sampling gate is connected to a test wire ft., Ft ~ ... ft. All test wheels are connected multiple times and lead to a common test wire 43, which is connected to a test and selection circuit 44. When a node has been identified by the decoder 41, a series of path marker pulses appear on the common test wire 43, the timing of which indicates the rank of the gate via which this marker reaches the node.

009809/0667 - 15 -

ISE / Reg. 3835

The test circuit 44 analyzes these pulse trains and chooses one the gate and distributes the Kang number of this gate a connection 25 to the central marker (or the data processing device) with. -

This checking and selection process is first carried out at node N.

of that hundred that has been determined by the mark tester 23 is carried out. The process marks the input gate PE ^ of this node, which embodies a group of ten in the hundred. Then the same process is performed on node N _D that simulates this group of ten. This process marks the input gate PEj of this node, which simulates a connection set of the required class in this group of ten. The node Έ- is known due to the connection ■ scheme of the switching network, because the intermediate line 2U ¹ leads from it to this gate PEj. The node N, can also be identified by the device described in said French patent 1 431 902 (part of this device is shown in FIG fi ^, fi ₂ , fix »via which this decoder places an identification mark on the inputs of a node connected to the intermediate lines; however, those parts of the device which collect and test this mark at the output of the intermediate lines of the upstream nodes are not shown).

The same process is then carried out at the inputs of this node N, which is known or identified in the aforementioned manner. The node F ₂ is thus defined because it is connected to the selected input gate PE _{via the intermediate line m 2 '.} Finally, the same process is carried out at the inputs of this node F ₂ , with which the via the

-.16 00 980 9/0667

ISE / Reg. 3833

Intermediate line m ^ 'with the selected input gate PEp connected node IL _{1 is} determined. This node IL simulates the switching matrix G ^, one input of which is connected to the calling subscriber circuit L requesting the route search. The test and selection means assigned to the node IL ₁ (gate PT ,,, wires n ,,, ft, -) are not required for this route search; however, they are used to identify a subscriber circuit that cooperates with a given connection set. The input gates PE ^ are provided for this identification. For the purpose of the route search, the route marking can be created by the same means as in the other nodes, namely via the input wire fe; the gate PE ^ corresponding to the calling subscriber circuit can be activated in the assigned time slot by the pulse distributor; it can also be continuously activated by a decoder 78 'which is provided for identifying a connection held busy by a given subscriber circuit. If all these means were not provided for identification purposes, the route marking can be applied directly to the first multiple point of the node IL .

In FIG. 2, the central marker UC has memories (L), (M ,,), (Mp), (J), (D), (C) in which the various identifiers of the Connection route sections are recorded according to the identifiers of the corresponding link sections in the route search network.

The first process of the route search, namely that of the marker tester General test carried out, shows immediately whether a connection path between the calling subscriber circuit and a connection set of the required class »in general is available. If this test is negative, operations according to the invention follow, which deal with false call connections deal and which will now be described.

- 17 009809/0667

ISE / Reg. 3833

The busy marking is applied to the cores c via the connection sets J and via selective blocking devices 54, one such device 54 being connected to each connection set hundreds group Hundreds group selector 63 has. All of these devices allow the busy marking to be switched off in a specific connection set. The busy marking runs via a normally closed contact 26 in the marker to the connection sets. A false call relay FA is provided in each connection set, which connects the wire c ¹ with a wire c " ^1. All wires c" ¹ are multiple-switched and connected to a common wire 27 to which the busy marker (earth) is connected in the marker by means of a normally open contact 28. can be created.

Assume that the marker has been notified over connection 24 that the general test performed by the marker tester produced a negative result; in this case there is an internal blockage with respect to the calling subscriber circuit. The marker then causes the contact 28 to be closed, which applies the busy marker to all connection records that are not in the "missed call" state. In the connection sets concerned with incorrect calls, the relay FA is actuated and the wire c ^MI disconnected from the wire c ¹ , so that the busy marking made with the contact 28 cannot reach these connection sets. In the marker, the contact 26 is now opened, which suppresses the busy marking on the wires c ^{1 of} all connection sets. Therefore, all connection records that are not in the false call state receive the busy marking via their wires c ^n! If the connection records in the call state no longer receive such a busy flag. In the assigned connection sets

- 18 -

009 809/0667

ISB / Heg. 3833

the usual occupancy relay C is activated, which marks the busy via its own working contact to the occupancy wire c of the coupling network in which it runs. When closed Contact 28 and open contact 26 is the busy marking on the core c of those connection paths that are connected to the call records in the missed state end, i.e. on wire c of the false call connections, suppressed. Of the Marker then takes over the connection 24 · and the test and Selection circuit 23 a second general test of ·. This second test is positive, so that it is stated that that the internal blockage was caused by existing false call connections.

Thereupon, after a connection set in the 3? Ehlanruf state sought whose release allows the establishment of a connection for the calling subscriber circuit. This will be the contact 26 is closed again and the busy marking is selectively switched off by such means that are known per se are. For example, the control device G2 sees the busy marking of compound set hundreds groups to find a group for which the general test using the Marker checker 23 remains positive. The disconnection device 5 ^ assigned to such a group of hundreds then holds the Busy marking of groups of ten and then of individual connection sets, creating a connection set accordingly

number

of his / her group of hundreds is identified. Suppose that the mark tester 23 each time a positive result notices. »As has already been mentioned, the passage of the new connecting path leads through sections of the path that go from more than of a missed call connection are kept busy, the general test during one or the other phase of this identification to a negative result. If, for example, it should be necessary to send a call to the the one Hunderi; claimed part of the route and another

- 19 -

009809/0667

BAD U

ISE / Reg. 3833

by another missed call connection in another hundred To use the claimed stretch of route for the new connection results in the deactivation of the busy marking of the Hundergrup'pen every time a negative result. In this case, the internal blocking is permitted and handled as it is in the system is provided; however, this handling is not relevant to the present invention.

It is now assumed that the identification process has led to the identification of a connection record which is in the false call state and in which the suppression of the busy marking has had a positive result in the general test. The contact 28 can be opened as soon as the busy marking is applied again via the disconnection device 54-, The busy marking of the marked connection set in the false call state is done by means of the disconnection device ^ A, however, only when this connection set has been identified. The marker then identifies the missed subscriber circuit associated with that call set. For this purpose, the checking of the inputs of each predetermined node is repeated, once by normally applying the busy marking to all connection sets and the other time by switching off the busy marking (in 5 * 0 of the specific missed call connection record) In the same way, the inputs of the node N ^ checked to determine that gate PE ^ which is connected by a wire c "to the input of the switching matrix G ^ connected to the particular connection set. Therefore, the subscriber circuit that is connected to this input is identified.

The marker then begins to activate the false call connection, for example by causing relay C in the particular connection set to drop. Then he goes with the full one

- 20 009809/0667

ISE / Reg. 3853

Route search for the calling subscriber circuit in the one described above Away. This connection path should now be found due to the activation of the false call connection can. Finally, the marker switches this connection path between the calling subscriber circuit and a connection set of the required class.

The marker advancing the identity of the false call subscriber circuit is now looking for a connection path between this subscriber circuit and any connection set in the manner described above, but without determining a connection set class. Does this search success, it turns the marker the new failed call connection according to the way found her and puts the failed call mark on the respective connection set to ₀ If the search unsuccessful, had the marker triggers the incorrect call party circuit. This subscriber circuit is then queried like any other calling subscriber circuit by the subscriber circuit scanner EA (FIG. 1).

In Fig. 3, a practical example for the issuing of commands to the connection sets and the query of their switching states is shown. The arbiter CJ (Fig. 1) has three parts in Fig. 3 · In the marker UC, a selector 71 receives information from the data processing device Z via a connection 72. On the one hand, such information contains the decimal coordinates (hundreds, Tens, ones) of the connection sets and, on the other hand, the commands to be transmitted (for example for one in the connection set zu actuating or releasing relay). It is assumed that this information is sent encoded. In voter 71 is on relevant hundreds place a hundreds group selector 73 is arranged, the tens and units information as well as commands about sends one of the links 75 to a decoder 74 which is one

- 21 009809/0667

ISE / Reg. 3833

Connection set hundreds group is assigned. In the decoder 74, the tens and units information is carried out by means of two decoder circuits which, however, are only shown in FIG. 3 by a single decoder circuit 76. The command information is if necessary by means of a decoding storage 7? decoded. Each wire of the bundle of tens 78 is multiple-switched with ten input wires 79, which are assigned to the ten connection sets of a group of ten. Each wire of the ones bundle 80 is multiple-switched with ten output wires 81, which are assigned to ten, the same ones digit in the ten groups of ten connection sets. Finally, each wire of the command bundle 82 is multiple-switched with a hundred command wires which are assigned to the hundred connection sets of a group of hundreds. _O in Fig 3, the command wires 83 »· 84, 85 are shown only as Beipsiel over which are 0, the relay and the relay PA controlled a relay K.

The third part of the arbiter (GJ) is divided among the connection sets. In each connection set it contains a relay CJ ¹ , the working contacts of which are in the course of the command wires. The winding of this relay is in series with a decoupling diode 86 between an input wire 79 (connection set group of tens) and an output wire 81 (connection set group of ones) o The command sent thus reaches the connection set in which relay GJ 'corresponds to the hundreds identifying the connection set -, tens and ones digit has been pressed.

The status of the connection sets is queried by electronic means such that the signals of different amplitudes are centrally received and encoded. Any condition of a connection set is identified by a code word transmitted via a group of loops 87, "four of these Loops are only shown, but there are actually six

~ 22 009809/0667

ISE / Reg. 3833

Loops present in this embodiment. These six loops allow 64 code words, which are completely sufficient to identify all the states of the connection sets of all classes. The loops coming from all connection sets of a group of hundreds lead to a reading matrix which forms the connection set scanner according to FIG. Each line of this matrix corresponds to a connection set, and each matrix column corresponds to a code position. Each intersection has a magnetic single core like 88. The loops such as 87 form writing cores or windings on the corresponding toroidal cores. Through each row of toroidal cores associated control wire such as 89 · running the control line of a a desired connection set associated ring core is excited by means of a decoder 90 which receives the number of the connection set encoded on the light coming from the data processing device Z compound 91st In reality, the control wires 89 can be energized in the same way as the relays CJ ', namely between a wire of a group of ten decoder circuit and a wire of a group of one decoder circuit. A read wire like 92 is drawn through each column of toroidal cores; an amplifier such as 93 is inserted in each read wire.

This reading device (especially in the case where the scanner have to work together with two data processing devices of this type, due to which each ring core has two read wires must) can be structured> as in the French patent specification 1,463,888.

The reading wire bundles leading from the hundreds group samplers BJ via a connection 95 to a control circuit 94 in & ex data processing device Z. In this control circuit 94, an output selector inputs the condition of Verbin & usgssätze representing code words in a row of the memory S * F,

- 23 009809/0667

ISE / Reg. 3833

which is assigned to this connection seed. The selection a line in the memory SJ "in the control circuit 94- of course in connection with the information about the identity which a connection set in the scanners EJ lcennseieh.net. The query of the status of the connection sets can be done in a cyclical manner «

4 claims

3 BIp drawings with 3 figures

0 09809/0 6 67

Claims (1)

x _SE / _E e _{S. 5835} "* '" 62127 Claims A method for searching for and establishing connection paths taking into account existing false call connections in coupling networks with input circuits such as subscriber circuits and outgoing circuits such as connection sets for telecommunications, in particular telephone switching systems, characterized in that after a connection was established with a free call that was between an im Wrong call state located input circuit and an output circuit runs through the switching network, this output circuit is marked as being in the wrong call state and that this wrong call connection is maintained and is only released for the purpose of further processing of the wrong call in some other suitable way, if it has been determined that a new connection path over a segment of this false call connection can be established. Method according to claim 1, characterized in that after an unsuccessful path search for a new one, between one predetermined subscriber circuit and a connection set of the required class to be established connection path following Steps to be taken in sequence: a) The route search is repeated, with the busy marking on all such connecting routes through the switching network is suppressed, via the subscriber circuits in the false call state with marked as being in the false call state Connecting sets are connected, January 24, 1968 Krü / H - 25 - 009809/0667 ISE / Reg. 3833 b) if the second route search is successful, a connection set marked as having a false call status is generated in which the suppression of the busy marking promises a successful route search, identified by that this marking selectively on the various missed call connection sets is suppressed, c) the one in the false call state with the identified one Connection satζ connected subscriber circuit is identified, d) between this subscriber circuit and this connection set existing false call connection and this connection set are triggered, e) the new connection path is required between the particular subscriber circuit and a connection set Class switched through, f) a new false call connection is established between the im Previously identified false call status Subscriber circuit and any connection set established as being in the false call state is marked, or the subscriber circuit is, if this new false call connection cannot be established, discarded and treated like a normal calling subscriber circuit. Circuit arrangement for carrying out the method according to Claim 1 or 2 with a coupling network which simulates the coupling network Route search network, characterized in that means (IJO, 37 »39, 21, 23) for route search, means (PT, 41, 44, 52) to identify the input and output circuits as well as the intermediate lines of the switching network and means (54, 62) for the selective suppression of the busy marking in the output circuits or connection sets are. 009809/0667 ■ _ ₂₆ _ ISE / Rego 3835 4. Sohaltungsanordnung according to claim 3 »characterized in that that switching means (CJ, FA, C, K) in the connection sets from the central control via meter (71) with coded Output information and can be switched on via decoding circuits (76, 77) and these connection sets are therefore considered in the false call state can be marked, triggered or controlled in a suitable manner and that the switching states of the Switching means in the connection sets can be queried by means of a scanner (EJ) and can be transmitted to the central control (Z) are. -27- 009 809/0667