DE2033660C - Method and arrangement for handling connection requests in a centrally controlled switching system, in particular telephone switching system - Google Patents

Description

It is already known in a switching system, in particular a telephone switching system, to have connection requests to be processed centrally. In addition to the switching network, the connections are also made via terminating circuits for lines guided. It can be a termination circuit for outgoing or incoming lines. This also includes so-called house transfers and office transfers and others for special Assignments serving purposes. As is known, the connections can be made using centrally stored information about the operating status of the intended switching equipment (see e.g. German patents 1 190 516, 1 190 517, 1 190 999). It is in this context also known, a cycle for polling memory cells for the information mentioned to be provided, which is interrupted by a period of time while the other process is handled will.

The invention solves the problem of pending connection requests to be processed using a certain cycle in a particularly time-saving manner. The invention thus relates to a method for processing connection requests in a centrally controlled switching system, in particular telephone switching system, in which connections except via the switching network via termination circuits for lines and under utilization from centrally stored information about the operating status of the switching facilities provided. This procedure is characterized in that the cycle for interrogating switching network connections for connection requests

and for the processing of pending verifications, namely only one coupling stage goes through. It is therefore binding requirements in each case by an outside favorable, freely chosen conclusion of this Special time interval interruptions lying in the cycle for the processing of connection interruptions will have to have at least one receivable ready during each, and inevitably more free termination circuit through preparatory free 5 as a coupling stage through the connection path extension can be provided, which must be run for this purpose by means of the stored, because a shorter connection path ten information about the operational status of Ver is not available. This is e.g. B. the case if intermediary devices is searched, whereupon their partial address belonging to a connection request in a special memory area for a business line at another switching matrix or Preparatory freely selected terminating circuits even connected to another coupling group is stored with which it is during the following ab- as that in connection with the connection request cycle short-term for use available funding required final circuit. A connection. manure path, which runs twice over all coupling steps,

Since in a switching system connection can be referred to as a control path. Are against it

requirements are statistically distributed over time, is 15 subscriber line and required available termination

it is to be expected that during a cycle like the one connected to the same switching matrix

was mentioned above, one, several or even sen, so the connection path can be as one over only one

no connection request at all and decoupling stage running short path are established,

are to be made. There are one or more connection When the required route search are, if

requests, so the preparatory free election 20 has to take into account only very few parts of the way.

of termination circuits mean that for the subscribers, which is why they are processed very quickly

production of connection requirements such can. Because they are processed in a very short time

preparatory, freely selected terminating circuits can be short-circuited, in this case need to be released in advance.

can be used in a timely manner, whereby the time-activated termination circuits are not taken into account

wall is limited for such a cycle, as will be.

Cycles during which there are no requirements

are processed particularly quickly. Explained in more detail on figures, in which an example of a

following such cycles are during the particular switching system in question and an accessory

whose intended period of time free final form for the application of the inventive method

through preparatory free elections. You drive to the handling of connection requests

are then shown during cycles with connection requests.

available for use at short notice. From Fig. 1 shows a switching matrix with reverse grouping For reasons of statistics, the mentioned under- lying follows, which consists of several sub-switching networks and different cycles randomly on each other. This results in a central control that is operated as Overall, that cycles with connection requests came up with 35 program-controlled data processing systems forms to be processed in less time than usual;

be able. This also has the consequence that, overall, fig. 2 shows how the information store does this

see individual connection requirements to be broken down faster data processing system;

than usual. F i g. 3 shows the part of an example that is of interest here

The above-mentioned example according to the invention for a program flow chart of the

can also drive for a switching system according to the procedure.

are applied, which a switching matrix with a so-called The in the F i g. The switching network shown in 1 has the th reversed grouping (see German layout coupling stages A, B and C. It consists of several documents 1 235 379, 1 262 358; NTZ, 1969, p. 588 to sub-switching fields, which in turn contain several Kop -595). In a switching matrix with reverse grouping, 45 pelgroups are included. Thus, the one shown part has all connections on the same side of the switching matrix, the switching groups KGW .. .KGIi, the field. They are the coupling group facilities (subscriber lines, local connection KGl \ ... KG2i and the last shown Teilkopptlfeld lines, relay sets or termination circuits, etc.) the coupling groups KGn 1 ... KGni for all lines and corresponding other sub-switching fields shown. The switching matrix is arranged in the same way. Any line can be connected to any other lines, termination circuits, relay sets and overhead lines via this switching network. Each connection path is located on the left side of the switching network, via the switching network between two lines, the course of the switching matrix KW of the coupling group shows a change of direction in which it KGIl, among other things, reverses the subscriber line Γ111 and vice versa. A reverse grouping allows in at 55 the termination circuits (/ 111 and i / 112 angeschlossich known manner, on release of a sen. When switching matrix Kmv the coupling group connection request among themselves offering encryption KGni include the subscriber line Tx and bond because of the one can be selected, which is connected to the terminating circuit. The individual smallest number of switching stages runs through. Sub-switching networks are connected by intermediate lines using the method according to the invention in a connection which, in the case of switching multiples of switching stage C, is connected to a switching network with reversing If, for example, the intermediate grouping belongs to it, it is advisable that line / · 3. In this case, a freely selected terminating circuit is provided for each sub-switching network during the dispatching of its own sub-control device, which is only occupied by connection requests because it belongs to the associated subscribers lines, if a connection path has more than one coupling stage 65 circuit connections and the like. So the part went through. In this case, namely more time is required for the route control device TfVl access to the relevant search than if z. B. a connection facilities of the sub-switching network with the coupling path the lowest number of switching stages, groups KGW .. .KGM. These facilities

hear the other than the already mentioned subscriber line. The route search for connection paths to an Ab-7 * 111, the terminating circuits t / 111 and i / 112 under circuit, which can also be reached via a single switching matrix, the subscriber line Γ and the terminating and thus via a single switching stage, terminating circuit U. The sub- control devices TW1 can be passed through with the aid of a short-path memory area and TWn have access to the relevant inputs 5, which are stored in the information memory SP in the directions of the other two in FIG. 1 is provided and in the sub-switching networks shown for the relevant switching network. The sub-control devices stage information, which is combined in coupling multiple, TWl, TWl .. .TWn, for their part, work together with the centrations via the directly accessible final control, which is contained here as a program. If a connection request-controlled data processing system is designed and io tion is to be processed, then those information processing unit PV combined in addition to the program control unit and information coupling multiples are also queried from the information memory SP which contains the switching matrix assigned to that one. With the aid of the control devices mentioned, the subscriber line affected by the connection request that can handle the connection request is connected. It results in this, and existing connections 15 can also see very quickly whether a suitable termination can be opened again. When clearing the circuit is free, which is then occupied. To the connection requirements is z. B. a partially summarized information then also belong to increasing initially with a closing shell to connect the same information about the for the connection path. Different crosspoint contacts of the decision-making circuit to be sounded through come into question. Is it z. B. at 20 matching matrix. This means that the routing of the switching system to a private branch exchange is already finished. The route search for other Verso is when clearing an internal connection connection route can also be carried out with the help of a route request as a terminating circuit for a house search memory area that is to be used. When processing a ver the information memory SP is provided and the processing request, which contains information about the operating status and the supply via an exchange line, an exchange transmission is to be used to order sections of all switching stages. As a rule, there are also other processes that are known per se (see German patent-specific facilities, such as Meldeüber-schrift 1 190 518, German Auslegeschriften 1 251 816, transfers that are used for the internal assignment of connections 1 252 270.1 254 703) can be used. For this purpose, cross-connection transmissions are to be used, which are freely selected in preparation and which are to be used when a conversion is used.

With the help of the partial control devices TWX .. .TWn , the subscriber lines are led to a private branch exchange instead of to a public office. Accordingly, demands are requested. In the associated cycle, a total of several different types of termination 35, for example, high-switching are available for each sub-switching network. at least one connection request handled. With a switching system with a switching matrix. the intended use of preparatory free that has a reverse grouping are selected terminating circuits, it results that in doing so moderately preparatory free selected terminating an inadmissible lengthening of the cycle for the routing during the processing of connection searches is avoided if for each type of Termination requests only occupied when a connection path preparatory freely selected circuits are available, passes through more than one coupling stage. This is e.g. B. It is advantageously unnecessary if the subscriber line 7 "1 II is connected to the interruption by the program control unit pre-terminating circuit Uy is to be interrupted in order to avoid urgent processes, which are in the coupling stage A. Only for some types of terminating circuits intermediate lines or transmissions marked with r2, r3, r4 and rS belong so many copies Switching matrices of the switching stages B and C that they are connected to each switching matrix, up to the switching matrix Kim of the switching stage A. Therefore, it is only for these types of termination switching and processing of the associated connection requirements that it requires the Path search can be reached over a longer period of time that only lead via a switching matrix than if a Ve rbindungsweg is required, which only leads the route search with the help of a short path memory over a single coupling stage. Such a rich is therefore expediently only in connection leads z. B. attempted connection requests from the subscriber line for which such Γ111 via the switching matrix ΑΊ1 for terminating 55 terminating circuits are required. For all other connections I / 111. Such a connection path represents ren connection requirements, the path is a so-called short path, during the previous search with the help of the path search memory area explained through and via the intermediate lines rl, rl. r3. out, and there are preparatory freely selected r4 and r5 leading connection path a so-called termination circuit taken into account.
Represents control path. There are also connecting paths 60 in FIG. 2 shows in detail how, for example, possible, which are shorter than a control path, but lead over as the information memory SP in various more than a switching matrix. The lowest rich is to be broken down. It initially shows the time already expended for the route search, however, for a short route memory area mentioned and the route over only a single short search memory area leading to a switching matrix. These two areas are needed away. If, during the handling of a connection, each 65 is divided into sub-areas, each of which is assigned to a partial connection request such a short-path used switching network of the switching network. This is how it can be, so the use of a preliminary short-path storage area can be saved in the sub-areas KWW ... riding freely selected terminating circuit . Each of these sub-areas is a "

assigned to the coupling groups, which in and also with a considerable number of other F i g. 1 indicated switching matrix are provided, so parts of the route is connected, each is a large one of the switching groups KGIl .. .KGni. To take into account such number of stretches of road. This is because coupling groups also provide sub-coupling- the overall result is that for a preparatory free field of the in FIG. I represents the switching matrix shown. In Figure 5, a noticeable period of time is required. The corresponding way is also the Wcgcsuchspeicher- nige time span, which is divided into sub-areas of the memory area for addresses of preparatory areas designated as WBW ... WBni designated by freely selected terminating circuits in these coupling groups. In contrast, the names of the parts assigned to one another are much shorter. By using areas and coupling groups have the same io the preparatory free selection therefore the cycle becomes the indexes. In the subareas of the Kurzwcgespeicherbe- queries of subscriber connections on the connection area, as already stated, the storage requests there and for the handling of pending information connection requests are noticeably shortened.
grasps. The sub-areas of information storage that are dealt with above can therefore be stored very quickly, as shown in FIGS. 2 shows im asking. The structure of the route search memory area is arranged in such a way that it also enables the mentioned sub-areas together if they are assigned to the same sub-switching network that is required for a route search for a control route. The information with 11, 12 .. ni can then be found quickly. There are each designated groups of sub-areas. In each of the sub-areas to be interrogated that are assigned to that group of sub-areas, a special coupling group is also assigned to which the sub-area is shown, which can receive further subscriber-localized information not affected here by a connection request. These are the line and a potential preparatory free- the sub-areas SSIl, SS12 .. .SSni. This arrangement selected termination circuit are connected. The sub-areas make it easier to query information. Also the memory area for addresses from prepara- tions. the terminating circuits freely selected to functionally cooperate with one another is in partial connection.

divided areas, each one by a LAD There is also a central storage area AS provided pelgruppe subswitching of the coupling shown, which are assigned for each respective type of termination field. These sub-areas are designated with circuits the address of the sub-switching network of the zii- VFW .. .VFni . In addition, 30 last preparatory, freely selected terminating circuit can be provided with a structure such that, starting from, the next free one in each case in a resulting partial terminating circuit by means of the stored information cich only contains addresses of a certain type of departments about the operational status of switch containment circuits are included. We are looking for directions to these species. This will bring about gc- \ on termination circuits include z. B. with a 35 brings that in the preparatory free election the from-branch office transfer systems are alternately preferred and house transmissions that are also used equally for outgoing traffic who are to be used. When clearing a connection. In the still shown central memory area, it is then only necessary to contain information which, for the purposes of querying those sub-areas for information which is not to be discussed in more detail here.
Addresses of the type in question of the type shown in FIG. 3 includes termination circuits. These addresses are first to recognize that the .. for free electoral processes during the preliminary free choice during the utilized specific time period Start FW .Stop FW sen outside for querying Teilnehmeranschlüs- outside the cycle start V .. .Stop V to query, etc. 45 from subscriber connections to connection request range, namely from stored information and for handling pending connections about the operating status of switching requests. Establishments between the border posts. This information is in Start FW and Stop FW are the operations and subdivisions that take place during a preparation of a memory area, which is also subdivided into subareas for free selection, which are each inserted into a sub-switching network, namely 50 branches. Operation a first follows the start Fn boundary point of a switching node assigned to the switching matrix. While are. These memory areas are labeled KSIl, KS12 ... this operation is referred to as the central memory area VSni . The assignment of the last-mentioned AS is taken for which type of terminating circuit subareas of the memory area for addresses of genes a preparatory free selection is to be carried out unc preparatory freely selected terminating circuits and 55 which address the coupling group has to which the memory area for information about the last preparatory Freely selected final switching state of switching equipment that is connected. This is followed by the operation / same indices as the coupling groups to which the, during the z. B. are assigned by querying the information stored there. For the sub-area assigned to the coupling group of the preparatory free selection, at least the information contained in the memory area for addresses of preparatory free a sub-area of the memory area for information-selected terminating circuits is to be determined . In the absence of a preparatory free one that is already available, it must also be expected that the terminating circuit selected in this case, which is not yet connected to this coupling with a free terminating circuit of the grain group in question, is required. If this is the de: menden type, but also other such partial cases, then branch c follows the opera areas to be queried. Since a coupling group each e an. If for the above considered head a larger number of parts of the path includes pelgruppe a preparatory free choice is not necessary

V.-r

ίο

Hch, then branch c is followed by operation d , during which the address of the coupling group to be taken into account is increased by one unit, so that in the now repeated operation b, the next coupling group is taken into account by the sub-area assigned to it, the memory area is queried for addresses of preparatory freely selected terminating circuits. This is repeated until a coupling group is found for which a preparatory free election is to be carried out. The number of repetitions is limited. During operation e , the address of the terminating circuit used last is determined from the memory area for addresses of previously freely selected terminating circuits, and then that part of the memory area of the information about the operating status of switching equipment is queried for a free, potential disconnection, which is assigned to the coupling group that is currently to be taken into account. If a free qualifying terminating circuit is found, the branch / 'is followed by operation g , during which the address of the terminating circuit selected in advance is written into the relevant sub-area of the memory area for addresses of terminating circuits selected in advance. This is followed by the operation Λ, during which the address of the associated coupling group is entered in the

ίο central memory area AS is written. This is followed by the limit point Stop FW, at which the preparatory free selection has been completed. If the branch / shows that no terminating circuit in question is free, operation g is bypassed. In this case, too, the address of the coupling group last considered is written into the memory area AS . This means that other coupling groups are taken into account during the next cycle.

1 sheet of drawings

Claims (9)

Patent claims: 1. A method for handling connection requests in a centrally controlled switching system, in particular telephone switching system, in which connections are made except via the switching network via termination circuits for lines and made using centrally stored information about the operating status of the switching equipment provided, characterized in that the cycle (Start V ... Stop V) for querying switching network connections (TUl ... Tx) for connection requests and for handling pending connection requests is interrupted by a special time period outside of this cycle (Start FW ... Stop FW) is, during which at least one free terminating circuit can be provided by preparatory free selection, which is searched for this by means of the stored information about the operating status of switching equipment, whereupon its address is stored in a special memory area (KFIl .. . VFni) is stored for preparatory, freely selected terminating circuits, so that it is available for use at short notice during the following interrogation cycle. 2. The method according to claim 1 for a switching system with a switching network, the one Reverse grouping has, ao that when dispatching a connection request can be selected from among available connection paths is, which goes through the smallest number of coupling stages, characterized in that preparatory Freely selected termination connections when handling connection requests only occupied if a connection path runs through more than one coupling stage. 3. The method according to claim 2, characterized in that a route search for connecting routes to a terminating circuit, which can be reached via a single switching stage, is carried out with the help of a short-path memory area (KW W ... KWm ') in which the coupling stage in question is coupled It contains summarized information about the directly accessible termination circuits, and that the route search for other connection routes is carried out with the help of a route search memory area (WBW ... WBni) which contains information on the operating status and the assignment of route sections of all coupling stages. 4. Arrangement for performing the method according to claim 3, characterized in that the short path memory area and the path search memory area are divided into sub-areas (KWW .. .KWni; WBW ... WBni) , each of which is a sub-switching network (KGW ... KGni) of the Are assigned to the switching matrix. 5. Arrangement for carrying out the method according to one of claims 1 to 3 or arrangement according to claim 4, characterized in that the memory area for addresses of preparatory freely selected terminating circuits is divided into sub-areas (VFW ... VFni) , each of which has a partial coupling field (KGW . .. .KGni) of the switching matrix are assigned. 6. Order to carry out the procedure according to one of claims 1 to 3 or arrangement according to one of claims 4 and 5, characterized in that that the memory area for addresses of preparatory freely selected terminating circuits is divided into sub-areas, each addressing a certain type under several types record of termination circuits. 7. Arrangement according to one of claims 4 to 6, characterized in that a central memory area (AS) is provided which contains the address of the sub-switching network of the terminating circuit selected last preparatory for each relevant type of terminating circuit, starting from which in each case the next free terminating circuit a search is made by means of the stored information about the operating status of switching devices. 8. Arrangement according to one of claims 4 to 7, characterized in that the memory area for information about the operating state of switching equipment is divided into sub-areas (VSW ... VSni) which are each assigned to a sub-switching network of the switching network. 9. Arrangement for performing the method according to one of claims 1 to 3 or arrangement according to one of claims 4 to 8, characterized in that a central control is provided which is designed as a program-controlled data processing system.