SELF-ROUTING SWITCHING SYSTEM

Abstract: A self-routing switching system including a route setting unit (10) which receives transmission information and identification information given from incoming lines and forms, from the identification information, control information for setting a path to one outgoing line to which the transmission information is to be transferred, and a self-routing speech path (20) which can form a plurality of paths and which selects the most suitable one therefrom by the control information and autonomously guides the transmission information to the destination outgoing line.

Description: DESCRIPTION TITLE OF THE INVENTION Self-Routing Switching System TECHNICAL FIELD The present invention relates to an N x N (where N is a natural number, same below) or N x M self-routing switching system having N number of incoming lines and N or M number of outgoing lines which is optimal for use for high-speed packet switching or asynchronous transfer mode switching. In telephone switching (line switching) , once a speech path is set up, the speech path is maintained until the conversation of the call is finished. In the case of multiplex transmission, calls (channels) are switched at a high speed, but the positions of the calls on the frame remain the same, so simple sequential switching is sufficient. As opposed to this, with packet switching, each of the packets has its own destination. The destinations of the packets as seen by a time series are diverse, so the above two methods cannot be used. Therefore, the method is adopted of taking the processors into a memory once and then distributing the same to outgoing lines (memory switching) . However, this memory switching requires time, so it is not suitable in cases where high-speed switching is required. A self-routing speech path is suitable for cases of high-speed switching to different outgoing lines for each packet or each cell (asynchronous transfer mode blocks) , such as high-speed packet switching or asynchronous transfer mode switching, and for cases where centralized control of the speech path by software is not desired because of the need for high speed call processing. PRIOR ART A so-called Banyan-type self-routing speech path has already been proposed in, for example, Zurich seminar in 1985, D4.1, R. . Muise et al (AT&T Bell Laboratory) "experiments in wideband packet technology" P. 135 to P. 139. Figure 1 is a circuit diagram showing a Banyan-type self-routing speech path as an example of the prior art. This is comprised of 2 x 2 unit self-routing switches S.. (where ij is 11, 12, ) by reverse shuffle wiring as shown in the illustrating (in this example, an 8 8 Banyan is shown) . Each packet of the incoming line side is given control information showing the outgoing lines (in this example, binary-notation outgoing line number) . Using the control information, each switch is operated and the transmission information (INF) sent to the designated outgoing line. For example, when the control information is "010" and the packet is input to IN of the S, , , the first stage (i = 1) switch sends the packet to its own "0" output since the MSB of the control information is "0". Receiving this, S--. views the next bit of the MSB and since this is "1", sends it to the "1" output. Receiving this, S views the SB and since this is "0" sends it to the "0" output. In this way, the packet is sent to the target outgoing line 010. Figure 2 is a view showing the construction in the case of expanding the scale of the speech path of Fig. 1. In the above-mentioned Banyan-type self-routing speech path, to increase the number of incoming and outgoing lines, for example, to make a 16 x 16 Banyan, the construction of Fig. 2 is adopted. That is, two 4 x 4 Banyans are arranged, four 2-unit switches are arranged at the outgoing side, and wiring performed as illustrated to construct an 8 x 8 Banyan. Similarly, two 8 8 Banyans are arranged, 4 x 2, and 2 2 unit switches are arranged at the outgoing side, and wiring performed as illustrated to construct a 16 x 16 Banyan. A 32 x 32 Banyan etc. can be similarly constructed. In general, any N x N Banyan can transmit information to a targeted outgoing line by log2 N stage cascade connection of 2 x 2 unit switches. Note that in a unit switch, the outgoing terminal is given twice the operating speed of the incoming terminal to avoid congestion. As mentioned above, a Banyan type self-routing speech path is constructed based on the principle of dichotomization, so expansion of scale is achieved by combining two N x N switches and N number of 2 x 2 switches to make a 2N x 2N switch. The increases are in units of multiples of 2. A modular construction is difficult and it is necessary to relay all the wirings on the outgoing line side. Therefore, there are practi¬ cal inconveniences as a speech path built into a self- routing switching system. DISCLOSURE OF THE INVENTION The present invention has as its object the improvement of the above points and the provision of a self-routing switching system which enables increase of the switch modules to a sufficient extent and enables easy conversion from small capacity to large capacity without the need for revising preexpansion wiring. To achieve the above object, the present invention constructs a self-routing switching system by a self- routing speech path with multi routes, an improvement of a Banyan-type self-routing speech path. SUMMARY OF THE DRAWINGS The present invention will be further described in connection with its embodiments, with reference being made to the accompanying drawings, wherein: Fig. 1 is a circuit diagram showing the prior art, i.e., a Banyan type self-routing speech path; Fig. 2 is a view showing the construction in the case of expansion of the scale of the speech path of Fig. 1; Fig. 3 is a view showing a first embodiment of a speech path in a self-routing switching system accord¬ ing to the present invention; Fig. 4 is a view showing a first example of a format of information appearing on an incoming line; Fig. 5 is a view showing a second example of a format of information appearing on an incoming line; Fig. 6 is a concrete example of a speech path of the first embodiment shown in Fig. 3; Fig. 7 is a circuit diagram showing a specific example of a self-routing switch module (SRM) ; Fig. 8A is a block diagram showing an outline of a self-routing switching system of the present invention; Fig. 8B illustrates a packet switching network; Fig. 9 is a view showing an example of the construction of a self-routing switching system of the present invention; Fig. 10 is a view showing a first example of a format of information appearing at the output of the route setting means; Fig. 11 is a view showing a second example of a format of information appearing at the output of the route setting means; Fig. 12 is a circuit diagram showing a specific example of the route setting means; Fig. 13 is a view showing in detail the control information; Fig. 14 is a wiring diagram showing a self- routing speech path expanded in scale based on the present invention; Fig. 15 is a wiring diagram showing an example of a 4 x 4 self-routing speech path of the present invention before expansion of scale; Fig. 16 is a circuit diagram showing an example of the construction of the 2 x 4 self-routing switch module in Fig. 15; Fig. 17 is a circuit diagram showing an example of the construction of the 4 2 self-routing switch module in Fig. 15; Fig. 18 is a wiring diagram showing a self-routing speech path after the expansion in scale of the self-routing speech path of Fig. 15; Fig. 19 is a concept view of a self-routing switching system able to supply specific services as optional functions; Fig. 20 is a circuit diagram of a self-routing switching system showing details, in particular, of the portion of the optional service module of Fig. 19; Fig. 21 is a signal flowchart showing the flow of input information upon detection of error in Fig. 19; Fig. 22 is a signal flowchart showing the flow of input information upon no detection of error in Fig. 19; Fig. 23 is a flowchart showing the operation of Fig. 21 and Fig. 22; Fig. 24 is a view showing an example of the protocol construction of error control; Fig. 25 is a circuit diagram showing a specific example of the selector control circuit in Fig. 20; Fig. 26 is a concept view of a self-routing switching system able to perform priority processing; Fig. 27 is a circuit diagram showing a specific example of a self-routing switch module for performing the priority processing; Fig. 28 is a view showing an example of a circuit of the selector control circuit for performing the priority processing; Fig. 29 is a principle block diagram of a second embodiment of the self-routing switch module; Fig. 30 is a circuit diagram showing a specific example, for realizing a second embodiment of Fig. 29; Fig. 31 is a principle block diagram of a third embodiment of a self-routing switch module; Fig. 32 is a timing chart showing signal waveforms appearing at principal portions of Fig. 31; Fig. 33 is a circuit diagram showing a specific example for realizing the third embodiment of Fig. 31; Fig. 34 is a timing chart showing signal waveforms appearing at principal portions of Fig. 33; Fig. 35 is a principle block diagram of a fourth embodiment of a self-routing switch module; Fig. 36 is a timing chart showing signal waveforms of principal portions of Fig. 35; Fig. 37 is a circuit diagram showing a specific example for realizing the fourth embodiment of Fig. 35; Fig. 38 is a principle block diagram of a fifth embodiment of a self-routing switch module; and Fig. 39 is a circuit diagram showing a specific example for realizing the fifth embodiment of Fig. 38. PREFERRED EMBODIMENTS OF THE INVENTION Figure 3 is a view showing a first embodiment of a speech path in a self-routing switching system according to the present invention. The self-routing speech path 30 of the first embodiment is comprised of one or a plurality of basic switching units. In this figure, a speech path 30 comprised of a single basic switching unit is shown. This basic switching unit is comprised of an input stage self-routing switch module (SRM) 31, a middle stage self-routing switch module (SRM) 32, and an output stage self-routing switching module (SRM) 33. In the present invention, multiple link connection is used for the SRM.. 's. Even in the Banyan type, multiple connection was used for the unit switches S.. , but not multiple link connection. There was only one path formed between the incoming lines and outgoing lines. For example, when the transmission information entering S,, of Fig. 1 was to go to the outgoing line 111, there was only one route, S,. -> S 2 „ →- S... , i.e., there was no other route such as S,, -* ■ S„-. - S_.. In this regard, in the multiple link connection of the present invention, there is in addition to SRM.,., →- SRM-, →- SRM.,, , other paths such as SEM 11 ÷ S 2m ÷ SBM 31- With N number of incoming lines, the input stage SF-M switches SRM,, to SRM, , have n number of input ends and m number of output ends and are N/n in number, the middle stage SRM.- modules SRM , to S M have N/n number of input ends and N/n number of output ends and are m in number, and the output stage SRM modules SP-M-i-. to SRM_ ,„ have m number of input ends and n number of 3n/N ^ output ends and are n/N in number. L.. are the primary links, and M.. the secondary links. The input ends of the input stage modules (31) SRM,. to SRM. , are connected to the incoming lines, while the output ends are connected to the input ends of the middle stage modules 32. The m number of output ends of the SRM.. are connected to one of the input ends of the m number of middle stage SRM modules SRM_. to SRM2_m. The SRMi..N τ /,n module etc. are similarly J connected. The N/n number of output ends of the middle stage modules are connected to one of the m number of input ends of the outgoing line side N/n number of modules SRM-. to SRM-, T , . 31 3N/n In this example, the switch modules SRM.. are built into a three-stage construction of an input stage, a middle stage, and an output stage. Further, the middle stage may, like in Fig. 3, be made three-staged in construction, giving a total of five stages (with two basic switching units) . Further, the total number of input ends of the input stage switch modules SRM.. to SRM. , is N, the same as the number of incoming lines, while the number of output ends of the output stage switch modules SRM-. to SRM_„ . is N, equal to the 31 3N/n ^ number of outgoing lines. Further, the number of input ends of the middle stage switch modules SRM„. to SRM_ 21 2m is mN/n, equal to the number of output ends of the input stage switch modules. The number of output ends is also mN/n, equal to the number of input ends of the output stage switch modules. In the example shown, therefore, there are no idle modules, but idle ones may be made. In particular, when expansion is envisioned, a larger number of middle stage switch modules may be provided (the number required) and a lesser number of input and output stage switch modules may be provided. Figure 4 is a view showing a first example of a format of information appearing on an incoming line of a self-routing switch path. Figure 5 is a view showing a second example of a format of information appearing on an incoming line of a self-routing switch path. The packet or cell entering the incoming line is given control information (C.INF) RH, , RH 2 , RH comprised of routing headers, as shown in Figs. 4 and 5. This may be in series with the transmission information (T.INF) such as in Fig. 4 or in parallel such as in Fig. 5. The latter case, of course, requires an exclu- sive control information line. The control information RH. , RH 2 shows the number of the ith order link, i.e., the number of the output end of the ith stage switch module. The switch modules view the number and guide the transmission information to the said link, i.e., the designated output end. In this self-routing speech path 10, the required number (m number) of middle stage switch modules SRM 21 to SRM„ are provided. If less than the possible number (N/n number) of input and output stage switch modules are provided, then in expansion it is merely necessary to add input and output stage switch modules and perform wiring for the input and output stage switch modules. At this time, there is no need to make any changes on •the already installed switch modules or their wiring. Further, in this self-routing speech path 10, there are a plurality of routes of paths between the incoming lines and outgoing lines. Compared with the Banyan type etc. where there is only one route, this is a great advantage in processing during congestion of traffic. That is, in packet switching or cell switching, in particular when transmitting information, the amount of information generated often changes greatly over time, so with a single path, the transmission delay fluctuates tremendously. However, when there are a plurality of paths as in the present invention, it is possible to disperse the load. Further, during congestion, other routes may be taken and thus the transmission delay may be reduced. Figure 6 is a view showing a concrete example of a speech path of the first embodiment shown in Fig. 3. It shows the case where N > 9 and n = m = 3. There are three 3 x 3 self-routing switch modules SRM..'s at the input stage, middle stage, and output stage. The primary links L, , , L, 2 , and L. , connect the three output ends of the input stage switch module SRM., to the first top input ends of the middle stage switch modules SRM_, to SRM , . The primary links L . to L„ and L_. to L,_ follow this. The secondary links M. , to M-, , connect the three output ends of the middle stage switch module SRM-. to the first input ends of the three switch ' modules SRM,. to SRM,., of the output stage. The secondary links M 2 - to M„, and M_, to M,_ follow the same. In this self-routing speech path, if, at first, SRM,, , SRM„. to SRM , , and SRM,. are provided, the installation of M. 2 and SRM, 2 and SRM., to SRM.,, does not require any change of already installed portions and can be performed with just the wiring of L 2 , to L 2 , , L,, to L,_ , M_. to M„, , and M_. to M,_ as illustrated. Further, for example, there are three paths leading incoming line #9 to outgoing line #3: SRM,, →- SPM_. ■ * ■ SRM 31 , SRM 13 -* SFM 22 →- SRM 31 , and SRM 13 SRM 23 c RM_.. It is thus possible to disperse traffic between SRM,, and SRM,.. to SRM . to SRM_ . Further, when traffic concentrates in SRM„. and a delay occurs, it is only necessary to change to a path through SRM_„ or SRM - to reduce the delay to the minimum possible. Figure 7 is a circuit diagram showing a specific example of a self-routing switch module (SRM) . It shows the example of a 3 x 3 construction SRM. I. are control information detection circuits, D* transmission informa¬ tion delay circuits, DM. demultiplexers, DEC. control information decode circuits, FM.. buffer memories, for example, first-in first-out (FIFO) memories, SEL. selectors, and SC. selector control circuits for receiv¬ ing the request signals R.. of the FIFO memories FM.. and performing control of the selectors SEL.. The signals entering the input ends #1 to #3 (i) take the form of the afore-mentioned transmission information plus control information (T.INF + C.INF) . The detection circuits I 1. extract the control information and send it to the decode circuits DEC.. The control information comes in three types, a first stage (input stage) routing header RH. , a second stage (middle stage) routing header RH 2 , and a third stage (output stage) routing header RH, , when the self-routing speech path is comprised of three stages, so the detection circuits I . extract the corresponding control "information according to which stages the self-routing switch modules SRM are. When the input control information indicates an output end j, a decode circuit DEC. operates a demultiplexer DM. and sends the transmission informa¬ tion to an FIFO memory FM... For example, if the control information of the input end #1 indicates the output end #2, the decode circuit DEC. operates the demultiplexer DM. and inputs the information of the input end #1 to the FIFO memory FM„- . When the trans¬ mission information enters the FIFO memories FM. , to FM i3 r the selector control circuit SC. operates the selector SEL. and sends the said transmission information to the output end #1. The same is true for the rest as well. A selector control circuit SC . , for example, continually scans for a request signal R.. from an FIFO memory FM.. and, when a request signal R.. is detected, operates so that the contents of that FIFO memory FM are output through a selector SEL.. Alternatively, a request signal R.. is input to a selector control circuit SC . as an interruption input and, when an interruption occurs, the selector control circuit SC. outputs the content of the said FIFO memory FM through the selector SEL. If the FIFO memories FM.. are given a capacity corresponding to a plurality of packets or cells, a buffer function is obtained and sufficient response is possible even when the transmission data increases temporarily. The self-routing switch modules SRM.. are not limited to ones having three input ends and three output ends and in general may have n number of input ends and m number of output ends, where n > m and n = m or n < m. When n > m, there will be a plurality of input ends making, common use of the same output end, but with calls (channel) with small volumes of transmission, this wound be sufficient for processing. When n < m, a single input may be divided into two outputs and both input side high speeds and output side low speeds dealt with. Of course, the excess amount may be left unused. For the same reason, even though.3 x 3 self-routing switch modules are used in Fig. 6, the invention is not limited to three middle stage switch modules SRM„. to SRM 2 _; two or four are also possible. Further, it is not limited to three stages. For example, the whole of Fig. 6 or Fig. 3 may be used as the middle stage and input stage and output stage switch modules added to make a total five-stage construction. Further, by the same method, a seven-stage construction is also possible. However, in general, three stages are appropriate. The control information C.INF is added in series or in parallel to the call (packet or cell) on the input side as in a Banyan type and the like. On call origina¬ tion, depending on the call processing, control informa¬ tion for a certain call is determined, then a virtual channel number (VCN) of the call and said control information are registered in a table. In response to an input call, the table is referred to and said control information added. The control information is added since it is needed when the multiple link construction switch module group is passed through, but is not necessary.once the outgoing line is reached, so is then deleted. As explained above, in accordance with the construc- tion of Fig. 3 to Fig. 7, it is possible to change the number of incoming and outgoing lines without changing the existing wiring. The amount of change is not limited to multiples of 2. The change can be made in units of the number of input and output ends of the switch modules. The middle state switch modules may be provided in larger numbers than the incoming and outgoing side switch modules in anticipation of an increase in the outgoing lines. However, with multiplexing, its possible to install a number less than the outgoing line side switch modules. Further, the self-routing speech path 10 may have a plurality of paths linking between the incoming and outgoing lines, so there is little delay even with congestion. Figure 8A is a block diagram showing an outline of a self-routing switching system of the present invention. In the figure, reference numeral 10 is a route setting means and 20 a self-routing speech path (SRSP) . The route setting means 10 receives information input from a plurality of incoming lines #1, #2 ... #N. This informa¬ tion is comprised of pairs of the original transmission information (voice information, facsimile data, computer data, etc.) T.INF and identification information I.INF. The identification information consists of the identifi¬ cation number, such as a virtual channel number (VCN) , added to the cells under the afore-mentioned asynchronous transfer mode, and to the packets under the afore¬ mentioned packet switching network. The virtual channel number is explained with reference to Fig. 8B. Figure 8B illustrates a packet switching network. In Fig. 8B, SWITCH 0 ^ n are the packet switching systems, CP. ^ CP are the call processors for SWITCH 0 ^ n, X is a calling terminal accommodated by SWITCH 0, Y is a called terminal accommodated by SWITCH n, and VCN. % VCNn are the virtual channel numbers for link 0 ^ link n. When CP, detects the issuance of a call from terminal X, it recognizes the destination of the call (terminal Y) and performs a call setting phase. Accord- ing to the communication between call processors CP. , CP, ^ CP , a transmitting path has been set, and each call processor allocates the virtual channel numbers VCNO. ^ VCNn to the call in each link,' resp^ectively, and memorizes the correspondence between a pair of the virtual channel numbers, such as VCN./VCN, , VCN. /VCN , Then, each call processor performs a packet transfer phase. In the packet transfer phase, the CP. controls SV7ITCH 0 to connect a terminal X to link 0, and adds the virtual channel number VCN. to a head of a packet from terminal X. When CP. detects the virtual channel number VCN. , it recognizes a receipt of a packet from terminal X, and a destination of the packet. CP. controls SWITCH 1 to connect link 0 to link, and adds the virtual channel number VCN. after exchanging VCN0. to VCN1.. The operations of CP2, -v* CPn-1. are the same as the above operation of CP.. When CPn„ detects the virtual channel number VCNn , it ercognizes the receipt of a packet for terminal Y, so tthhaatt CCPPnn ccoonnttrroollss SSWWII 1 TCH n to transfer the received packet to terminal Y. In Fig. 8A, the route setting means 10 performs the afore-mentioned call setting phase, but a packet transfer phase is carried out autonomously without a control of the route setting means 10, that is a self-routing switch. The route setting means 10 monitors the above- mentioned identification information from the information of the incoming lines and forms control information C.INF in accordance with this identification information. The self-routing speech path (SRSP) 20 sends the transmission information of the afore-mentioned incoming lines through the afore-mentioned outgoing lines based on the formed control information C.INF. In this case, the self-routing speech path (SRSP) 20 forms multiple paths. With a conventional self-routing speech path (SRSP) (Fig. 1 or Fig. 2) , there is only one path running from one incoming line to one outgoing line, but in the self- •routing speech path (SRSP) 20 of the *present invention, there are a plurality of paths from one incoming line to one outgoing line, forming multiple paths. Which path is selected is determined by the route setting means 10. Further, the self-routing speech path (SRSP) 20 of the present invention has built in it a buffer memory means which holds temporarily at least the transmission information (if necessary, both the transmission informa¬ tion and control information) which can make time adjustments on information transfer in the self-routing speech path (SRSP) 20. Note that the first embodiment of the self-routing speech path (SRSP) 20 has already been explained with reference to Fig. 3 to Fig. 7. The second, third, fourth, and fifth embodiments of the self-routing speech path (SRSP) 20 are respectively shown in the later-mentioned Figs. 29 and 30, Figs. 31 to 34, Figs. 35 to 37, and Figs. 38 to 39. Figure 9 is a view showing an example of the construction of a self-routing switching system of the present invention. In this example, use is made of the self-routing speech path (SRSP) 30 (first embodiment) as the self-routing speech path (SRSP) 20 in the system. The control information C.INF is added by control of the call processor 12 in the control information addition circuits 11-1 to N provided at the incoming line side. As explained with reference to Fig. 8B, a call processor 12 sets the correspondences between an incoming line and outgoing lines for a pair of virtual channel numbers for every incoming packet, and decides the transmission path in a self-routing speech path 30 for each virtual channel number of the incoming packets. As mentioned in Fig. 6, a transmission path is identified by control information C.INF, so that a call processor sets the correspondences between a pair of virtual channel numbers with corresponding control information C.INF to a table in each addition circuit. That is, the identification information I.INF in the headers of the input information, e.g., the virtual channel numbers (VCN) , is extracted. The addition circuit searches the table with the extracted virtual channel numbers, finds the corresponding virtual channel numbers and control information and adds the found control information and virtual channel number in the addition circuits 11-1 to the input information. Figure 10 is a view showing a first example of a format of information appearing at the output of the route setting means. figure 11 is a view showing a second example of a format of information appearing at the output of the route setting means. These correspond to the already mentioned Fig. 4 and Fig. 5. Figure 10 further shows the series addition of the control informa¬ tion C.INF to the input information, i.e., the pairs of transmission information T.INF and identification information I. INF, while Fig. 11 shows the state of parallel addition of the C.INF to the pairs of T.INF + I. INF. Note that the I. INF of Fig. 10 and the I. INF of Fig. 11 are equivalent. Figure 12 is a circuit diagram showing a specific example of the route setting means. In the figure, an explanation is made of how to control information C.INF is added by the route setting means, taking as an example the case where packet information is the input information. The calling party of the packet information carries out a call setting up phase for notifying the packet receiving party to the call processor 12 before the transmission of the packet. A microprocessor (MPU) 15 of the call processor 12 sets the path of the speech path through which the packet is to pass by the notified receiving party and calling party and decides a virtual channel number for the next link. The switching information of the switch modules to which the packet is input, that is, the control information C.INF, i.e., RH. , RH 2 , and RH, , and the virtual channel number for the next link are stored in the address corresponding to the identification information (VCN) which indicates the receiving party. Next, the packet is actually transmitted in the packet transfer phase. This packet is comprised of the transmission information and the header portion consist¬ ing of the identification information (VCN.) added to the header of the transmission information. The synchro¬ nizing circuit 17 synchronizes with the incoming packet for the use of a synchronizing pattern in a header portion, and controls the timing of each part. The packet which is transferred to the speech path is stored in the buffer 13 of the addition circuit 11-1, and the identification information portion I. INF is input to the decoder 19 via the register 18 under the control of the synchronizing circuit 17. When the decoder 19 receives the identification information (virtual channel number VCN r °^ t ^ ιe l n P ut packet, the table 16 is accessed using this identification information VCN. as the address. The table 16 stores therein the control information corresponding to the identification informa¬ tion VCN and the identification information (VCN. ) showing the packet in the next link, as mentioned earlier. To add this control information and VCN. to the packet header, the control information read out from the table 16 is sent to the selector (SEL) 14. The synchronizing circuit 17 performs switching control of the selector 14, first sends out the control information C.INF and new identification information VCN. , then reads out the transmission information portion of the packet from the buffer 13 and sends it through the selector 14 to the speech path (SRSP) 30. In the above way, the control information and the identification information of the next transmission path are added to the packet headers on the incoming line side of the speech path 30. As it is obvious from above explanation, packet transfer control is performed by hardware and not controlled by the microprocessor 15. Figure 13 is a view showing in detail the control information. It shows illustratively the selection of the different paths by the different routing headers RH. The right block numbers of the RH's show output lines of SRM.. , SRM, 2 , SRM., , the middle block numbers of the RH's show output lines of SRM„, , SRM.. , SRM., , and the left block numbers of the RH's show output lines of SRM.,, , SRM 32 , SRM 33 . That is, each block number corresponds to the right sub-index of line symbols such as L.. , L.. , L. , , ... , M n ' ••• As already explained, the self-routing switching system of the present invention can much more easily be expanded in scale compared to the conventional Banyan type speech path. The major portion of the expansion of scale of a switching system consists of expansion of scale of the speech path, so being able to easily perform expansion of the scale of the speech path is very advantageous. When performing expansion of the scale of a Banyan type speech path, it is necessary to stop the operation of the speech path once and then rewire. It is impossible to perform the expansion of the speech path with the speech path still in the active state. Therefore, the communication service drops when expanding the speech path. Figure 14 is a wiring diagram showing a self-routing speech path expanded in scale without increasing the switching stages. When scheduling to expand the scale in the future, the self-routing speech path (SRSP) is constructed by multiple link connection of two types of self-routing switch modules (SRM) 41 to 52 with differing numbers of input ends and output ends. By a one-versus- many link connection of the self-routing switch modules SRM to all the self-routing switch modules SRM of the later stages, provision is made of a method of construct¬ ing a self-routing speech path which enables expansion of the scale of the speech path with the speech path (SRSP) still operating and without change of the number of link stages. By forming a speech path through multiple link connection of two types of self-routing switch modules 41 to 52 with different numbers of input and output ends and one- ersus-many connection of each of the self-rout- ing switch modules of each stage to all of the self- routing switch modules of the later stages, there is no increase of link stages even upon expansion of the scale of the speech path, so it is possible to expand the scale with the speech path still operation. In Fig. 14, k x m and m x k means that there are two types of SRM's with different numbers of input ends and output ends. Figure 15 is a wiring diagram showing an example of a 4 x 4 self-routing speech path of the present invention before expansion of scale. In the figure, reference numerals 61 and 62 are self-routing switch modules SRM with 2 x 4 input and output ends, and ref rence numerals 65, 66, 69, and 71 are self-routing switch modules with 4 x 2 input and output ends. The self- routing speech path (SRSP) has self-routing switch modules connected by a three-stage link. The individual self-routing switch modules operate equivalently to 2 x 2 modules before expansion of the scale. Figure 16 is a circuit diagram showing an example of the construction of the 2 4 self-routing switch modules in Fig. 15. Figure 17 is a circuit diagram showing an example of the construction of the 4 x 2 self-routing switch modules in Fig. 15. The construction of Fig. 16 and the construction of Fig. 17 are basically the same as the construction of the afore-mentioned Fig. 7. The only difference is that there is an imbalance in the number of input ends and the number of output ends. Therefore, explanation of the function is omitted. Figure 18 is a wiring diagram showing a self-routing speech path after the expansion in scale of the self- routing speech path of Fig. 15. More specifically, it shows an example of the expansion of scale of a 4 x 4 self-routing speech path (SRSP) to an 8 x 8 speech path (SRSP) . The hatched blocks in the figure are newly added self-routing switch modules. The modules 63 and 64 have 2 x 4 input and output ends, while the modules 67, 68, 70, and 72 have 4 x 2 input and output ends. In this way, there is no increase in the number of link connection stages. Two modules each are added at each stage. In the link connection between the input stage and middle stage, the four output ends of the input stage modules are connected to the idle ends of the modules, e.g., all the input ends of the modules 65 to 68 of the middle stage. Further, in the link connec- tion between the middle stage and output stage, the two output ends of the modules of the middle stage are multiplex connected to the input ends of the existing modules 69 and 71 and newly added modules 70 and 72 of the output stage. As a result of this multiplex connection, the packet sent from a module of the middle stage to modules of the output stage is also sent to the modules other than the module corresponding to the packet destination. In such modules, the routing header RH of the packet is analyzed at the control information decoder circuit DEC, so there is no mistaken output of the packet to those output ends. In the working of the present invention, various modifications are possible. For example, the self- routing switch modules used are not limited to 2 x 4 or 4 2 ones. It is sufficient that there be two types of modules with differing numbers of input ends and output ends. Further, the number of incoming lines and outgoing lines of the expanded self-routing speech path is not limited to 8 x 8, of course. The number of connection stages of the self-routing speech path is determined by the relationship between the number of incoming lines and outgoing lines and is not limited to the illustrated three stages . Therefore, it is possible to change the number of input and output ends of a self-routing speech path without changing the number of its link connection stages, so it is possible to expand the scale while the self-routing speech path is operating, thus preventing a decline in communication service due to cessation of operation during speech path scale expansion. Referring to Fig. 14 to Fig. 18, it was explained that expansion of scale of the self-routing switching system according to the present invention was easy, however, in addition to this, it is also possible to expand various service functions. However, some measures are needed to expand the service functions. These measures will be explained here. First, in the self- routing switching system shown in Fig. 9, when providing a subscriber with a particular service, such as error control, as an optional function, it is necessary to add in advance to a self-routing switch module SRM itself the function of performing the particular service using hardware. If no measure is taken at all, the amount of hardware of the switch modules would increase and the switching system as a whole would become large scale and uneconomical as an apparatus. Further, when further adding various services, the switching modules must be changed, so it becomes impos¬ sible to flexibly deal with increases in services. On the other hand, in the CCITT recommendation X.25 base packet switching, use is made of th system of processing the packets completely by software, but strict provisions are made on error control etc., so the processing delay becomes large. Therefore, in packet processing, it is preferable to process by hardware as much as possible and further it is desirable to simplify the protocol. Therefore, measures have been taken with respect to the self-routing switching system of Fig. 9 to realize a self-routing switching system which can flexibly deal with optional services simply and with a small amount of hardware. Figure 19 is a concept view of a self-routing switching system able to supply particular services as optional functions. In the figure, the self-routing modules SRM autonomously perform a switching operation of the control information C.INF added to the trans is- sion information T.INF and send it to the outgoing line specified by the control information. The control information C.INF includes an optional service demand. OSM is a predetermined module out of the modules SRM which is given optional service functions and is provided in parallel with the modules of the middle stage of the modules SRM. In the self-routing switching system shown in Fig. 19, the input information header includes commands that particular optional services are to be performed. Based on this, a routing header RH is given and a decision is made on a path toward the optional service module OSM. The information sent from a module SRM at the input stage to the module OSM at the middle stage is sent to a switch module SRM of the output stage after the error control or other optional service is performed and the routing header replaced. Figure 20 is a circuit diagram of a self-routing switching system showing details, in particular, of the portion of the optional service module of Fig. 19. Portions other than the optional service modules are the same in construction as in Fig. 9. In this switching system, for example, a predetermined single switch module SRM. located at the middle stage of the self- routing switch modules SRM of the self-routing switching system shown in Fig. 9 is changed to an optional service module OSM. In this change, one each of the output ends of the input stage switch modules SRM.. to SRM,„, are connected to the input ends of the optional service module OSM and the output ends of the optional service module OSM are connected to one each of the input ends of the modules SRM 3,1. to SRM3,-N T /,n. In this optional service module OSM, FIFO memo¬ ries 81 are provided to make transmission information buffers. To the information stored there, a processor (CPU) 82 executes a predetermined service function set in an optional service (OS) unit 83, constructed as firmware, and sends the results to the selector (SEL) 84 and enables the optional service unit 83 to give a selection signal to the selector (SEL) 84 for selecting the path of the information packet by the routing header RH and store the transmission information in the FIFO memory 85 corresponding to the predetermined path. Note that the FIFO memories in the figure are drawn schemati¬ cally, but are exactly the same as the FIFO memories of other figures. Next, an explanation will be made of the case of execution of an optional service. When setting up an optional service demand for, e.g., a cyclic redundancy check (CRC) code error control or flow control, in a subscriber side terminal equipment (not shown) , the call processor 12 sets a routing header RH to the optional service module OSM in the addition circuit (11) connected to the said terminal equipment based on the virtual channel number (VCN) in the identification information received, adds the routing header information and optional service demand to the transmission information packet, and sends the result to switch module SRM., , for example, at the input stage. At the module SRM,. , the optional service module OSM is selected from the routing header as the module of the middle stage. In this way, by the routing header, the information packet from the terminal equipment which generated the optional service demand is , at the optional service module OSM, once stored in the FIFO memory 81, then passes through the processor 82 and, at the optional service unit 83, is used for execution of, for example, the CRC code error check. Next, according to the results, the selector (SEL) 84 is controlled and the transmission information packet is stored in one of the FIFO memories 85. In the same way as the case of Fig. 9, it is then transmitted from the output end of the module OSM to an output stage module SRM. Figure 21 is a signal flowchart showing the flow of input information upon detection of error in Fig. 19. Figure 22 is a signal flowchart showing the flow of input information upon no detection of error in Fig. 19. When an error is detected at the optional service module OSM, as shown in Fig. 21, the information packet is discarded, a packet for requesting retransmission is formed, the routing header is changed, the packet returned through the output stage module to the terminal equipment which set up the call, and retransmission requested. On the other hand, when no error is detected, as shown in Fig. 22, information transfer is performed to the terminal equipment on the receiving side. Figure 23 is a flowchart showing the operation of Fig. 21 and Fig. 22. Figure 24 is a view showing an example of the protocol construction of error control. At layer (V) , hardware interface is performed for transmitting and receiving information. At layer (2 , packet sequential control etc. is performed and, at C.INF layer (V), an optional service demand etc. is made. Further, at the common part of layer ( ) of the transmission information T.INF, packet identification and other packet control is performed, while at the option portion of the T.INF layer (2) , the sequence of the option control is set. Further, the layer (V) of T.INF has set therein proce¬ dures for special control of calls. In addition to this CRC code check, it is of course possible to set error control or other optional services in advance in the optional service module OSM. Figure 25 is a circuit diagram showing a specific example of the selector control circuit in Fig. 20. In the figure, the transfer requests (*1, *2, ... *n-l, *n) from the FIFO memories 85 are shifted one by one and input to the individual selectors (SEL) 90. Based on the commanded value from a counter 91, they are sent through the fixed priority level decision circuit 92 and encoder 93 to the adder (ADD) 94. The adder 94 adds the commanded value of the counter 11 and the transfer request number (*1, *2, ... *n-l, *n) shown by the output of the encoder 93 and issues the corresponding FIFO memory number and sends it to the selector (SEL) 86 of Fig. 20. The commanded value to the selector (SEL) 86 is returned to the controller (CNT) 95 and a transfer acknowledge (ACK) signal sent to the FIFO memory 85 producing the said transfer request. When a signal for which transfer is completed is received from the FIFO memory 85, a signal is sent to the counter 91 to raise the count of the counter 91. By this, the selection signal of the selector 90 is raised, for example, by "1". In this case, when there are two or more transfer requests at the same time, the fixed priority level decision circuit 92 sends transfer request signals to the encoder 93 by a predetermined priority order (for example, the order from the top of the illustration). In this way, a plurality of self-routing modules SRM are autonomously switched and information packets sent. Therefore, according to self-routing switching system of Fig. 20, the optional service module for executing optional services is replaced by a predeter¬ mined module of the middle stage in the self-routing switching system of the modular construction of Fig. 9 and made exclusive for optional services, so it is possible to flexibly add optional services without changing the construction of the overall switching system and to simplify the hardware construction and protocol. To make the self-routing switching system of the present invention shown in Fig. 9 operate at a higher efficiency, it is desirable to be able to perform the information transfer in accordance with the attributes of the information and state of congestion of the input information. that is, unless some measures are taken with regard to the switching system of Fig. 9, the following two disadvantages exist. First, since all information is handled uniformly without consideration of its attributes, priority is not given to processing of data requiring real time process- ing (for example, voice and video information) and thus a time delay occurs through the self-routing switch modules SRM in the switching apparatus. Second, traffic imbalances result in overload states of information transfer. When it is required to control this, the routing headers RH are rewritten, but in this case if the same call information is held waiting in another buffer FM, reversal (overtaking) of the transfer order of information will occur. Figure 26 is a concept view of a self-routing switching system able to perform priority processing. When the self-routing switch modules SRM.. to SRM,,., receive priority processing requests from the call processor 12, the input information of the incoming line requiring the priority processing is selected and sent on a priority basis. Therefore, when setting up a call, if the attributes of the information are those requiring priority process¬ ing (voice, video, etc.) , priority processing is allo¬ cated.to the modules SRM 1.1, to SRM,3N -T / / n from the call processor 12. Further, by making it possible to detect the overload state of input information in the modules SRM1..1 to SRM3,„N/,n ,' the call p^rocessor 12 can allocate priority processing to the modules SRM.. to SRM,^. , to avoid congestion of information. Figure 27 is a circuit diagram showing a specific example of a self-routing switch module for performing the priority processing. This module SRM is shown as having a similar construction to the module OSM shown in Fig. 20, but basically it is completely equivalent to the module SRM of Fig. 7 and the modules SRM's of Fig. 16 and 17. In Fig. 27, the self-routing switch module SRM is provided with a signal distributor SD which transmits and receives signals with respect to the microprocessor (MPU) 15 (Fig. 12) of the call processor via a control bus 96. Further, the selector control circuits (SC) 97 have a somewhat different construction from the circuit SC shown in Fig. 7. Note that as a specific example of the circuit SC of Fig. 7, it is possible to use the circuit SC shown in Fig. 25. Figure 28 is a view showing an example of a circuit of the selector control circuit for performing the priority processing. The selector control circuit of Fig. 25 is additionally given some circuits for priority processing. In Fig. 28, the controller (CNT) 105 continuously monitors the state of information storage of the FIFO memories 85 of Fig. 27 and reports its monitoring signals through the signal distributor (SD) 101 to the microprocessor (MPU) 15 (Fig. 12) . That is, instead of the monitoring signals being sent directly to the microprocessor (MPU) 15, they are assembled by the signal distributor (SD) 101 as master information and then sent to the microprocessor (MPU) with signal distribution control performed. Further, the con- troller 105 sends to the selector (SEL) 106 on a priority basis the information of the predetermined FIFO memory 85 upon command from the microprocessor (MPU) . The selector 106 selects one of the priority information by command of the microprocessor (MPU) or output of the counter 91. Other constructions are the same as in Fig. 25. Next, an explanation will be given of the operation of priority processing according to the attributes of information with reference to Fig. 26 to Fig. 28. First, the microprocessor (MPU) 15 determines the priority transfer path in advance and sets the priority information in the modules SRM. As one example, priority information is set for priority processing of the information from module SRM„, out of the modules SRM,. to SRM 3N/n . Next, when setting up a call, based on the virtual channel number (VCN) in the identification information I. INF from the terminal equipment (Fig. 21 and Fig. 22) , a routing header (RH) to a predetermined outgoing path is set in an addition circuit (already explained) connected to the terminal equipment via the micropro¬ cessor (MPU) . At this time, the attributes of the call are checked. When a voice, video, or other call requir¬ ing real time processing is detected, priority processing is performed on the routing header for passage through the module SRM 21 so that the input information packet of the call is transferred and processed on a priority basis. The addition circuit adds the routing header to the input information and sends the same to, for example, the module SRM. _ of the input stage. The module SRM-,. views the routing header and transfers the information to the module SRM 2 . of the middle stage. Next, in the modules SRM,. to SRM, , of the output stage, since the microprocessor (MPU) has already set the module SRM.. , for example, as the priority receiving party (of course, another priority transfer route also may be determined in advance) , the input information packet is stored in the predetermined FIFO memory 85 of the FIFO memories 85 (for example, the FIFO memory of the topmost section in the figure) through the selector SEL 84 in Fig. 27. On the other hand, when a priority transfer processing request signal is input from the microprocessor (MPU) 15 via the signal distributor (SD) 101 to the controller 105 shown in Fig. 28, this is sent to the selector 106 as a switching signal SWS. By this, unlike the case of Fig. 25, where the selection number of the selector 90 is successively changed by the output of the counter 91, in the case of Fig. 28, fixed priority information is output from the selector 106, so the selector 90 is selected for transfer of information of the FIFO memory designated for priority processing. In this example, the selector 90 (HIGH) at the topmost section of Fig. 28 is selected. The information is sent through the fixed priority level decision circuit 92, encoder 93, and adder (ADD) 94 to the selector (SEL) 86 shown in Fig. 27. The selector (SEL) 86 selects the memory of the topmost section of the FIFO memory 85 and sends it to the modules SRM,, to SRM3,.N../,n at their input ends. In this way, for calls requiring real time process¬ ing, a priority route can be designated and control effected for the easy transfer through the modules. Next, an explanation will be given of the priority transfer processing in the case where the buffers in the modules, i.e., the FIFO memories, show an overload state. The selector control circuit (SC) 97 of Fig. 27 receives as input the transfer requests (*1 to **n) (same as R in Fig. 7) from the FIFO memories 85. Along with this, the storage states of the FIFO memories 85 are input as overload signals ##1 to ##n. These overload signals can be set based on the criteria of information of a certain value or more stored in the FIFO memories. The controller 105 of Fig. 28 receives the overload signals ##1 to ##n as input and sends them all together through the signal distributor (SD) 101 to the micropro¬ cessor (MPU) as master information. The microprocessor (MPU) analyzes the master information (Δl to Δn) , reads detailed information through the signal distributor (SD) , and discharges the information from the overload state FIFO memories 85 on a priority basis, so sends a control signal Sc and controls the selectors 106 and 90. Therefore, if the FIFO memory of the topmost section, for example, out of the FIFO memories 85 of Fig. 27 is in an overload state, the selectors 90 of Fig. 28 are controlled so that the transfer request *1 is. selected. Further, when there are a plurality of FIFO memories in an overload state, selection is made by the fixed priority level decision circuit 92. In this case, even if an overload state occurs, there is no rewriting of the routing headers by the microprocessor (MPU) 15 and addition circuit (11) . This is so that there is no reversal of the order of flow of the packets. In this way, the packet information stored in an overload state FIFO memory is sent out from the modules SRM on a priority basis without route modification. Finally, various embodiments (second to fifth embodiments) of the self-routing speech module (SRM) shown in Fig. 8A will be proposed. Note that the first embodiment of the self-routing speech path (SRSP) has already been shown in Fig. 3 to Fig. 7. First, explana¬ tion will be made of the second embodiment. Figure 29 is a principle block diagram of a second embodiment of the self-routing speech path. In the self-routing switch module SRM shown in Fig. 7, provision was made of FIFO memories to avoid packet collisions due to concentration of transfer information, e.g., packets, at the same output end. However, when there are N 2 number of input ends and output ends, respectively, N FIFO memories are required. Therefore, an increase in the number of incoming lines and outgoing lines results in an expotential increase in the number of requisite FIFO memories. Further, the content to be stored in the FIFO memories is the packet as a whole. To give a buffer function, the storage capacity of the FIFO memories is set to enable storage of a plurality of packets. Considering this, FIFO memories with large storage capacities are required. However, even if the storage capacity of the FIFO memories is set large, since the probability of occurrence of packet collisions is not high, usually use is not made of all the storage regions of the FIFO memories and the efficiency of use of the memories is not high. Therefore, in the second embodiment, provision is made of a self-routing speech path which can deal with an increase in the number of incoming lines and outgoing lines without a major increase in the memory means and which can use the memory means with a high efficiency. In Fig. 29, there are provided a plurality of incoming lines #1 to #N and a plurality of outgoing lines #1 to #M, with inputs to each incoming line. Transmission information with routing headers is autonomously switched to outgoing lines designated based on the routing headers. A converting means 111 converts the transmis¬ sion information input in parallel from the plurality of incoming lines to a time-series format. A transmission information storing means 112 stores sequentially the transmission information T.INF sequentially sent from the converting means 111. A write address storing means 113 stores the addresses for accessing the trans- mission information storing means 112 and sequentially gives the same to the transmission information storing means 112 as write addresses. A plurality of read address storing means 114(1) to 114 (M) are provided corresponding to the plurality of outgoing lines. An address distributing means 115, based on the routing header RH of the transmission information which is sent from the write address storing means 113 and stored in the address of the means 112, stores addresses in the read address storing means 114 corresponding to the outgoing line designated by the routing header. A address selecting means 116 selects sequentially the plurality of read address storing means 114(1) to 114 (M) and gives the stored addresses to the transmission information storing means 112 as read addresses and stores them in the write address storing means 113. A distributing means 117 distributes the transmission information sequentially read out from the transmission information storing means 112 by the address selection of the address selection means 116 to the outgoing line corresponding to the selected read address storing means 114. The packet or other transmission information input to the plurality of incoming lines is converted by the converting means 111 to a time-series data format and sequentially stored in the transmission information storing means 112. The address designation to the transmission information storing means 112 at this time is performed by the address given from the write address storing means 113. At the same time as this address designation, the address from the write address storing means 113 is stored in the read address storing means 114 corresponding to the outgoing line designated by the routing header RH of the transmission information written in that address position by the address distrib¬ uting means 115. In this way, the various transmission information is stored in the transmission information storing means 112. Further, the read address storing means 114 corresponding to the destination outgoing line of the transmission information stored in the transmis¬ sion information storing means 112 has stored therein the address for reading the said transmission informa- tion. The address selecting means 116 sequentially reads out the stored read addresses from the read address storing means 114(1) to 114(M) and, using the same, reads the transmission information from the transmission information storing means 112. The distributing means 117 distributes the read transmission information to the outgoing line corresponding to the destination of the transmission information. Further, the read addresses read from the read address storing means 114(1) to 114 (M) are again stored in -the write address storing means 113 and used for address designation of the transmission information storing means 112. Figure 30 is a circuit diagram showing a specific example for realizing the second embodiment of Fig. 29. The time-division multiplexer (MUX) 121 holds N number of incoming lines #1 to #N and performs time-division multiplexing on the packets P(l) to P (N) input in parallel to the incoming lines #1 to &N to place them in a time-series format and sends them to the input highway HWl. The input highway HWl is connected to the data input terminal DI of a random access memory (RAM) 122. The packets on the input highway HWl are successively stored in the RAM 122. The address designation for the RAM 122 is performed using the addresses stored in the idle address memory 124. The idle address memory 124 is comprised of an FIFO memory and has a capacity able to store a number of addresses corresponding to the number of addresses of the RAM 122. The address output from the idle address memory 124 is led to the write address input terminal WA of the RAM 122 and the input terminal of the address distributor (DS) 126. The address distributor 126 is switched and controlled by the routing header copier (RHC) 128 and the input address is stored in one of the outgoing line FIFO memories 125(1) to 125 (M) . M number of FIFO memories 125(1) to 125 (M) are provided corresponding to the M number of outgoing lines #1 to #M accommodated in a time-division demultiplexer 123. These have a capacity able to store a plurality of addresses for avoiding collision of packets in the outgoing lines #1 to #M. The routing header copier 128 is connected to the highway HWl. The routing header RH of the packet on the input highway HWl is read and given to the address distributor 126. The contents of the FIFO memories 12-5(1) to 125 (M) are successively selected and read by the address selector (SEL) 127 and sent to the read address input terminal RA of the RAM 122 and the input terminal of the idle address memory 124. The packet information read from the data output terminal DO of the RAM 122 is successively sent to the output highway HW2. The packet information on the output highway HW2 is input to the time-division demultiplexer 123 where it is successively allocated to the outgoing lines #1 to #M. The time- division multiplexer 121, address selector 127, and time-division demultiplexer (DMX) 123 respectively are operated with clock timing by a clock generator (CLK) 129. The operation of the second embodiment will be described below. Assume that packets P(l) to P (N) are input to the incoming lines #1 to #N of the time-division demultiplexer. The packets P (1) to P (N) are comprised of the transmission information T.INF and routing headers RH. The time-division multiplexer 121 executes time-division multiplexing on the packets P(l) to P(N) to rearrange them into a time-series data format and sends the same to the input highway HWl. Therefore, the transmission speed on the input highway HWl is N times the transmission speed on the incoming lines #1 to #N. These packets P(l) to P (N) are stored successively in the RAM 122. The address designation on the RAM 122 at this time is performed by using the addresses succes¬ sively read from the idle address memory 124 as write addresses. The addresses read from the idle address memory 124 are sent to the RAM 122 and, simultaneously, stored in one of the FIFO memories 125(1) to 125 (M) through the address distributor 126. That is, the routing header copier 128 reads the routing headers RH of the packets P(l) to P (N) on the input highway HWl and identifies, by the routing headers, to which of the outgoing lines #1 to #M the corresponding packets should be output. Next, using the routing headers RH, the address distributor 126 is switched and controlled and the addresses sent from the idle address memory 124 are stored in the FIFO memories 15 correspond¬ ing to the outgoing lines to which the packets stored at the corresponding positions of the RAM 122 should be sent. For example, when the destination of the packet P(l) input to the incoming line #1 is the outgoing line #2, the packet P(l) is written at the address position of the RAM 122 designated by the address from the idle address memory 124. At the same time, the address is allocated to and stored in the FIFO memory 125(2) corresponding to the destination of the packet P(l) , i.e., the outgoing line #2, under the control of the routing header copier 128 and address distributor 126. When there simultaneously exist a plurality of packets to be sent to the outgoing line #2 and collision occurs, the plurality of addresses are 5 stored in the FIFO memory 125(2) . ft In this way, the packets P(l) to P(N) are succes¬ sively stored in the RAM 122. At the same time, the address information of the RAM 122 in which the packets P(l) to P (N) are stored is stored in the outgoing line 10 address FIFO memory 125 corresponding to the destination outgoing lines of the packets P(l) to P (N) . The reading of the packets P(l) to P (N) stored in the PAM 122 is performed by having the address selector 127 successively select the FIFO memories 15 125(1) to 15 (M) , in that order, by timing of clocks from the clock generator 129, reading the addresses stored therein, and applying the same to the RAM 122 as read addresses. By this, packets are successively sent to the time-division demultiplexer 123 from the RAM 122 via 20 the output highway HW2. The addresses selected by the address selector 127 are simultaneously sent to the idle address memory 124 and reused as write addresses of the packets to the PAM 122. The time-division demultiplexer 123 allocates the 25 input packets successively to the outgoing lines #1 to #M such that, for example, the packet read by the address from the FIFO memory 125(1) is sent to the outgoing line #1, the packet read by the address from the FIFO memory 125(2) is sent to the outgoing line #2, 30 ... and the packet read by the address from the FIFO memory 125 (k) is sent to the outgoing line #k. By this, the packets P(l) to P (N) input to the incoming lines #1 to #N are sent to the destination outgoing line desig¬ nated by the routing headers RH. 35 Therefore, according to Fig. 29 and Fig. 30, the memory means necessary for constructing the self-routing speech path may be a RAM or other memory for storing the packets, an idle address memory for storing the idle addresses of the RAM, and outgoing line address memo¬ ries 125 of a number corresponding to the outgoing lines for storing the read addresses of the RAM. As a result, even when there is an increase in the number of incoming lines and outgoing lines, it is possible to considerably reduce the number of necessary memory means. This effect is greater the larger the increase of the number of incoming lines and outgoing lines. Further, it is possible to construct the idle address memory 14 and outgoing line address memories 125 by small capacity memories able to just store the addresses of the RAM 122. Still further, it is possible to raise the efficiency of use of the RAM 122 storing the packet information. Note that when the RAM capacity is very large, the idle address memory 124 is not necessary. Next, an explanation will be given of a third embodiment of the self-routing speech path. The intent of the third embodiment is, like the afore-mentioned second embodiment, to reduce the number of memory means. Figure 31 is a principle block diagram of the third embodiment of the self-routing speech path. In Fig. 31, 131 is a self-routing speech path, which self-routing speech path 131 has N number of incoming lines 132 and N number of outgoing lines 133. Reference numerals 134 show memory means, which memory means 134 are provided corresponding to the N number of incoming lines 132. The output lines of the memory means 134 are connected to the N number of outgoing lines 133 through the latch groups 135. The memory means 134 are memories which operate at a speed of N + 1 times the transmission speed of the incoming lines. Reference numerals 136 show control means, which control means 136 control the writing and reading with respect to the memory means 134. That is, due to the control means 136, the memory means 134 are operated at a speed of N + 1 times the incoming line transmission speed, writing is performed at one of the phases of the speed of N + 1, and reading is performed to the N number of outgoing lines 133 in the remaining N phases. The control means 136 detect the routing headers from the input information of the incoming lines 132, cause the memory means 134 to operate at a speed of N + 1 times the incoming line transmission speed, and, simultaneously, designate the addresses and performing writing and reading with respect to the memory means 134. At this time, the memory means 134 are written at one of the phases in the N + 1 speed and read out to the N number of outgoing lines 133 during the remaining N phases. The transmission information read to the outgoing lines 133 is suitably latched by the related latch groups 135 and output. Figure 32 is a timing chart showing signal waveforms appearing at principal portions of Fig. 31. It shows, from the top, the input information, output information, address control signal AD, write control signal WE, and read control signal RE. Figure 33 is a circuit diagram showing a specific example for realizing the third embodiment of Fig. 31. In Fig. 33, 131 is a self-routing speech path, which self-routing speech path 131 has N number of incoming lines and N number of outgoing lines. Reference numerals 134 show buffer memories used as the memory means. These buffer memories 134 are provided corresponding to the N number of incoming lines 132. The output lines of the buffer memories 134 are connected to the N number of outgoing lines 133 through the latch groups 135. Further, the buffer memories 134 are designed to operate at a speed of N + 1 times the transmission speed of the incoming lines. N number of latch groups 135 are provided corre¬ sponding to the buffer memories 134. Further, the latch groups 135 have N number of latches (flip-flops) 139. Reference numerals 136 show buffer memory con¬ trollers used as control means, which buffer memory controllers 136 control writing and reading with respect to the buffer memories 134 and control the latch mode of the latches 139. Reference numerals 137 show routing header detection circuits, which routing header detection circuits 137 detect routing headers from the input information, e.g., packets, of the incoming lines 132 and output the routing headers to the buffer memory controllers 136 and output the transmission information to the buffer memories 134. Under the above construction, the routing header detection circuits 137 detect the routing headers from the input information of the incoming lines 132 and input the routing headers to the buffer memory con¬ trollers 136. At this time, the transmission information is sent from the routing header detection circuit 137 to the corresponding buffer memory 134. The buffer memory controllers 136 cause the memory means 134 to operate at a speed N + 1 times the incoming line transmission speed and, simultaneously, designate the addresses by the address control signals AD and perform writing and reading with respect to the buffer memories 134 by the write control signals WE and read control signals RE. At this time, the buffer memory controllers 136 view the routing headers RH and control the buffer memories 134 for writing at one of the phases in the N + 1 speed and reading to the N number of outgoing lines during the remaining N phases. Further, at the same time, the buffer memory controllers 136 output latch control signals CLK.. (where i and j are both 1 to N) to the latches 139. By this, the output information read to the outgoing line 133 is suitably latched by the corresponding one of the latch groups 135 and output to the required outgoing line 133. Figure 34 is a timing chart showing signal waveforms appearing at principal portions of Fig. 33. It shows, from the top, the input information, output information, address control signal AD, write control signal WE, i.e., write enable, read control signal RE, i.e., read enable, and latch control signals CLK,, , CLK. _ , CLK,, , and CLK. . Note that in Fig. 34, the write control signal WE and read control signal SE indicate "enable" at the L level and the latch control signal (clock) CLK.. indi- cates "data latch" at the H level. The latch control signals differ by one clock in each phase. In this way, since provision is made of a number of buffer memories 134 corresponding to the incoming lines, the buffer memories 134 are operated at a speed of N + 1 times the incoming line (outgoing line) transmission speed, writing is performed at one of the phases in the N + 1 speed, and reading is performed to the N number of outgoing lines during the remaining N phases, the number of memories (memories corresponding to the FIFO memories FM of Fig. 7) can be reduced to 1/N and, thereby, the size of the circuit can be reduced. Next, an explanation will be given on a fourth embodiment of the self-routing speech path. The intent of the fourth embodiment is, like the afore-mentioned second embodiment, to reduce the number of memory means. Figure 35 is a principle block diagram of the fourth embodiment of the self-routing speech path. In Fig. 35, 141 is a self-routing speech path, which self-routing speech path 141 has N number of incoming lines 132 and N number of outgoing lines 133. Reference numerals 144 show memory means, which memory means 144 are provided corresponding to the N number of outgoing lines 133. The memory means 144 are memories which operate at a speed of N + 1 times the transmission speed of the incoming lines. Reference numerals 145 show speed conversion means, which speed conversion means 145 convert the input information to a speed of N + 1. Reference numerals 146 show control means, which control means 146 control the speed conversion means 145, control the selectors (SEL) 147, and control writing and reading with respect to the memory means 144. That is, due to the control means 146, the memory means 144 are operated at a speed of N + 1 times the incoming line transmission speed, the information of the N number of incoming lines is written under time division during N phases in the speed of N „+ 1, and the information is read to the outgoing lines 133 at the. remaining one phase. The selectors 147 suitably allocate the input information from the speed conversion means 145 to the memory means 144 corresponding to the outgoing lines. Reference numerals 148 are OR gates, which OR gates 148 enable the write control signals from the control means 146 to be supplied to the memory means 144. The input information of the incoming lines 132 is converted by the speed conversion means 145 to a speed N + 1 times the incoming line transmission speed. The control means 146 detect the routing headers from the input information and send the control signals VCK. (i is 1 to n) to the speed conversion means 145, whereby, input information from the speed conversion means 145 is sent to the memory means 144. Further, the control means 146 send the control signals SCK. to the selectors 147, whereby the selectors 147 are suitably switched and input information from the speed conversion means 145 is sent to the desired memory means 144. At this time, simultaneously, the write control signals WCK.. (i and j being respec- tively 1 to n) output from the control means 146 perform writing and reading with respect to the memory means 144 at the following timing. That is, writing is performed on the N number of incoming lines 132 under the time division method during the N phases in the speed of N + 1, and reading is performed to the outgoing lines at the remaining one phase. Figure 36 is a timing chart showing signal waveforms appearing at principal portions of Fig. 35. It shows, from the top, the speed conversion control signal VCK. , the selector control signal SCK. , the write control signal WCK.. , and the read control signal RCK.. Note that #1 to #N correspond to the numbers of the incoming lines. Figure 37 is a circuit diagram showing a specific example for realizing the fourth embodiment of Fig. 35. In Fig. 37, 141 is self-routing speech path, which self-routing speech path 141 has N number of incoming lines 132 and N number of outgoing lines 133. Reference numerals 144 show buffer memories used as the memory means. These buffer memories 144 are provided corresponding to the N number of outgoing lines 133. The buffer memories 144 are constructed as FIFO memories. Further, the buffer memories 144 are designed to operate at a speed of N + 1 times the transmission speed of the incoming lines. Reference numerals 145 are speed converters, which speed converters 145 convert the input information to a speed of N + 1. Reference numerals 146 are controllers which controllers 146 control the speed converters 145, control the selectors 147, and control writing and reading with respect to the buffer memories 144. Reference numerals 147 are selectors, which selectors 147 receive the selector control signal SCK. from the controllers 146 and suitably allocate the transmission information T.INF from the speed con- verters 145 to the desired buffer memories 144 corre¬ sponding to the outgoing lines. Reference numerals 148 are OR gates, which OR gates 148 enable supply of the write control signals WCK.. from the control means 146 to the buffer memo- ries 144. Reference numerals 149 show routing header detection circuits, which routing header detection circuits 149 detect routing headers RH from the input information, e.g., packets, of the incoming lines 132 and output the routing headers to the controllers 146 and output the transmission information to the speed converters 145. Reference numerals 150 are latches (flip-flops) , which latches 150 are used for returning the speed of the information to the original incoming line speed and sending the same to the outgoing lines. Under the above construction, the routing header detection circuits 149 detect the routing headers RH from the input information of the incoming lines 132 and input the routing headers to the controllers 146. At this time, the transmission information is sent from the routing header detection circuits 149 to the speed converters 145. The speed converters 145 convert the transmission information to a speed N 4- 1 times the incoming line transmission speed. Further, the controllers 146 receive the routing headers RH, view the destinations of the input informa¬ tion, and control the selectors 147 by the selector control signals SCK. (i being 1 to n) for switching to the buffer memories 144 corresponding to the destination outgoing lines and further control the clock VCK. for reading the transmission information from the speed converters 145, the clocks WCK.. (i and j being respec¬ tively 1 to n) for sharing and writing the N number of buffer memories 144, and the clocks R.CK. for reading from the buffer memories 144. Writing and reading with respect to the buffer memories 144 are performed by the following timing determined by the controllers 146. That is, information of the N number of incoming lines is written under the time division method during the N phases in the N + 1 speed, while reading is performed to the outgoing lines 133 at the remaining one phase. The output information read to the outgoing lines 133 is latched by the latches 150, which are actuated in synchronization with the clocks RCK. for return to the original incoming line transmission speed, and output to the required outgoing lines. Referring to Fig. 36, at the rising edge of the write clock WCK.. , writing is performed on the buffer memories 144. At the rising edge of the read clock RCK. , reading is performed from the buffer memories 144 and also latching is performed by the latches 150. The write clocks WCK 1,1. to WCKI.n (..., WCKnl. to WCKnn) differ in pt-hase by j r one clock each, In this way, since provision is made of a number of buffer memories 144 corresponding to the outgoing lines, the buffer memories 144 are operated at a speed of N + 1 times the incoming line (outgoing line) transmission speed, information of the N number of incoming lines is written under the time divisio'n method during the N phases in the N + 1 speed, and reading is performed to the outgoing lines at the remaining one phase, the number of memories corresponding to the FIFO memories FM of Fig. 7 can be reduced to 1/N and, thereby, the size of the circuit can be reduced. Next, an explanation will be given on a fifth embodiment of the self-routing speech path. The intent of the fifth embodiment is, like the afore-mentioned second embodiment, to reduce the number of memory means. Figure 38 is a principle block diagram of the fifth embodiment of a self-routing speech path. The self- routing speech path of the fifth embodiment has a plurality of incoming lines and a plurality of outgoing lines and sends input information, including routing headers, input from the incoming lines to the outgoing lines specified by the routing headers. A plurality of storing circuits 151 to 153 are provided corresponding to the incoming lines and temporarily store the input information input therefrom. A switch circuit 154 connects spatially the output terminals of the plurality of storing circuits 151 to 153 and the plurality of outgoing lines, in accordance with both the output signals and the control signals from the circuits 151 to 153. A memory circuit 155 has led to it in parallel, as address input, routing headers of the input informa¬ tion, e.g., packets, stored in the plurality of storing circuits 151 to 153 and holds the transmission permission signals to be sent to the plurality of storing cir¬ cuits 151 to 153 as data corresponding to those addresses and control signals to be sent to the switching cir¬ cuit 154. The input information input to the incoming lines is held temporarily in the storing circuits 151 to 153. The routing headers RH of the input information are taken in parallel and given to the memory circuit 155 as its address input. The memory circuit 155 holds both the transmission permission signals and control signals corresponding to the addresses and sends the same to the storing circuits 151 to 153 and the switch circuit 154. When a collision of the input information occurs, one of the plurality of storing circuits for which collision has occurred is selected by the transmission permission signal and the data block stored therein is sent out. On the other hand, the switch circuit 154 is switched by the control signal and the selected input information is sent out to the outgoing lines corresponding to the routing headers. This operation is successively repeated so that the input information for which collision has occurred is successively sent out to the same outgoing lines under the time division method. Figure 39 is a circuit diagram showing a specific example for realizing the fifth embodiment of Fig. 38. The self-routing speech path is illustrated as having 4 x 4 incoming and outgoing lines. In the figure, 132(1) to 132(4) indicate the incoming lines, 162(1) to 162(4) transmission information buffers comprised of FIFO memories, 163(1) to 163(4) routing header buffers comprised of FIFO memories, 164(1) to 164(4) routing header registers, 165 an arbitration memory, 166 a matrix switch, 133(1) to 133(4) outgoing lines, 168 a transmission permission line, and 169 a control line. The incoming lines 132(1) to 13(4) receive as input the input information of the format shown in Fig. 4. This input information is comprised of routing header and transmission information T.INF. The routing header designates one of the outgoing lines 133(1) to 133(4) as the destination, therefore, is comprised of two-bit information. The transmission information buffers 162(1) to 162(4) can successively store a plurality of input information as illustrated in Fig. 4. The routing header buffers 163(1) to 163(4) can successively store a plurality of only routing headers RH out of the input information shown in Fig. 4. The routing header regis¬ ters 164(1) to 164(4) take out routing headers stored in the routing header buffers 163(1) to 163(4) one at a time and hold them temporarily. The outputs of the routing header registers 164(1) to 164(4) are led to the address inputs of the arbitration memory 165. The outputs of the routing header registers 164(1) to 164(4) are each two bits. The arbitration memory 165 has stored therein one word data corresponding to each address. The one words are comprised of a four bit information transmission permission signal and 16 bit crosspoint control signal. The information transmission permission signal has one bit each allocated to the transmission information buffers 162(1) to 162(4) and is information which determines if the buffers 162(1) to 162(4) may send the transmission information held to the matrix switch 166. When transmission is permitted, "1" is set. When it is not permitted, "0" is set. These information transmis¬ sion permission signals are sent to the enable terminals of the buffers 162(1) to 162(4) via the transmission permission line 168. The crosspoint control information controls the connections between the inputs and outputs of the matrix switch 166 and is sent to the control terminal of the matrix switch 166 through the control line 169. The arbitration memory 165 has stored therein a number of words (M ) corresponding to the number of outgoing lines to a power of the number of incoming lines. Below, the operation of the speech path will be explained. The input information input to the incoming lines 132(1) to 132(4) is stored in the transmission informa¬ tion buffers 162(1) to 162(4) . The routing headers are stored in the routing header buffers 163(1) to 163(4) . The routing headers are read successively from the routing header buffers 163(1) to 163(4) and stored temporarily in the routing header registers 164(1) to 164(4) . The outputs of the routing header registers 164(1) to 164(4) are given to the arbitration memory 165 as address signals. The routing headers determine unilaterally to which outgoing line the input information of which incoming line is output. The words corresponding to the addresses are read from the arbitration memory 165 and sent to the transmis¬ sion information buffers 162(1) to 162(4) as transmission permission signals and to the matrix switch 166 as crosspoint signals. The transmission permission signals determine if the buffers 162(1) to 162(4) may sent out the stored information or if they should hold off on transmission for a while. By the crosspoint control signal, the matrix switch 166 performs switching so that the path between the buffers 162(1) to 162(4) and the outgoing lines 133(1) to 133(4) is built so the input information of the incoming lines 132(1) to 132(4) is sent to the outgoing lines corresponding to the routing headers. If a collision occurs, i.e., the input information of the incoming lines 132(1) to 132(4) all have the same outgoing line as their destinations, the arbitration memory 165 makes only one of the transmission permission signals sent to the buffers 162(1) to 162(4) "1", gives transmission permission to the said transmission informa- tion buffer, and outputs the stored transmission informa¬ tion to the desired outgoing line through the matrix switch 166. On the other hand, it makes the other transmission information buffers hold off on the trans¬ mission of the input information. This operation is successively repeated so that the input information for which collision has occurred is successively sent out on to the same outgoing line. In this way, by reading information from the arbitration memory 165 using the combination of the routing headers of the input information of the incoming lines as an address, it is possible to perform simultane¬ ously arbitration processing during collisions, that is, processing to select one incoming line from a plurality of incoming lines which are colliding and connect it to the outgoing line, and path building of the matrix switch 166. The fifth embodiment may be modified in various ways. For example, the arbitration memory may be made of a read only memory (ROM) and its content fixed. Alternatively, a RAM may be used and rewriting performed under external control. Further, the embodiment shown was for a self-routing speech path with 4 x 4 inputs and outputs, but the invention is not limited to this and can be applied to self-routing speech paths of P x Q (where P and Q are integers of 2 or higher) as well. Therefore, in the case of N incoming lines, N number of buffers for holding the input information temporarily are sufficient. Compared with the case of 2 buffers under Fig. 7, the number of buffers can be greatly reduced, thus enabling more compact and inexpen¬ sive apparatuses. Further, the content of the arbitra- tion processing during collisions can be easily changed by just changing the content of the arbitration memory. INDUSTRIAL APPLICABILITY The present invention may be used for switching network of voice, facsimile data, computer data, and other switching data, in particular for high speed packet switching networks and high speed asynchronous transfer mode switching networks.

Claims: CLAIMS 1. A self-routing switching system comprised of: a route setting means which monitors identification information out of pairs of transmission information and identification information input from a plurality of incoming lines and forms control information for setting a path from an incoming line to an outgoing line corresponding to said incoming line and designated by said identification information and adding the thus formed control information to said transmission informa- tion and a self-routing speech path which is a multipath speech path able to create a plurality of paths formed between said plurality of incoming lines and outgoing lines from each one incoming line to each one outgoing line and which monitors said control information and selects and sets a path for lead said transmission information from said incoming line to said outgoing line from among said plurality of paths and autonomously transfers said transmission information to said outgoing line through the thus set path. 2. A self-routing switching system according to claim 1, wherein: said route setting means has a call processor and addition circuits for said control information provided corresponding to each said incoming line, in a call setting phase, said call processor is notified, from a calling party of said transmission information of said identification informa- tion showing a destination party of said transmission information and, by referring to a table storing a predetermined correspondence relationship between said identification information and said control informa¬ tion, and in a transfer phase, said control information is read out from said table with the notified identification information and, in said addition circuits, added to the said transmission information, subject to said control information, said transmission information is switched in the said self-routing speech path and autonomously led to the destination outgoing line. 3. A self-routing switching system according to claim 2, wherein said self-routing speech path is comprised of at least one basic switching unit, said basic switching unit being comprised of an input stage self-routing switch module, middle stage self-routing switch module, and output stage self-routing switch module connected by multiple link connection from said incoming line side to said outgoing line side. 4. A self-routing switching system according to claim 3, wherein: said input stage self-routing switch module is comprised of N/n number of self-routing switch modules, each said self-routing switch modules being provided with n number of input ends and m number of output ends; said middle stage self-routing switch module is comprised of m number of self-routing switch modules, each said self-routing switch modules being provided with N/n number of input ends and N/n number of output ends; said output stage self-routing switch module is comprised of N/n number of self-routing switch modules, each said self-routing switch modules being provided with m number of input ends and n number of output ends; and the multiple link connected input stage, middle stage, and output stage self-routing switch modules are inserted between N number of said incoming lines and N number of said outgoing lines. 5. A self-routing switching system according to claim 3, wherein said middle stage self-routing switch module is replaced with another multiple link connected input stage, middle stage, and output stage switch modules. 6. A self-routing switching system according to claim 3, wherein: said self-routing switch modules are each provided with a plurality of input ends and a plurality of output ends and comprised of an identical circuit group provided for each said input end; said circuit group comprising: a detection circuit for detecting said control information; a decode circuit for decoding the detected control information; a demultiplexer for sending an input information from one of the output lines determined by output of said decode circuit; a delay circuit for giving a prede¬ termined delay to said transmission information to be applied as input of said demultiplexer; buffer memories connected to said plurality of output lines and said demulti¬ plexer; and selector for selecting the input information in said buffer memory according to a request signal from said buffer memory or an interruption and sending the same to said output end. 7. A self-routing switching system according to claim 6, wherein each said buffer memory is a first-in first-out (FIFO) memory. 8. A self-routing switching system according to claim 3, wherein: self-routing switch modules comprised of p number of input ends and q number of output ends (p < q) are provided in a number corresponding to said incoming lines and form said input stage self-routing switch module; there are a plurality of self-routing switch modules comprised of q number of input ends and p number of output ends, which form said middle stage self-routing switch module which is link connected to said input stage switch module; there are a plurality of self-routing switch modules comprised of q number of input ends and p number of output ends, which form said output stage self-routing switch module which is link connected to said middle stage switch module; (q - p) number of output ends of the individual said input stage self-routing switch modules forming idle ends; (q - p) number of input ends of the individual said middle stage self-routing switch modules forming idle ends; and (q - p) number of input ends of the individual said output stage self-routing switch modules forming idle ends. 9. A self-routing switching system according to claim 8, wherein: when the number of said incoming lines and the number of said outgoing lines are increased, the number of the self-routing switch modules comprising the respective said input stage, middle stage, and output stage self-routing switch modules is increased and all the output ends and input ends, including the said (q - p) number of idle output ends and (q - p) number of idle input ends, between said input stage and middle stage self-routing switch modules, are mutually link connected, all the output ends and input ends between said middle stage and output stage self-routing switch modules, including said (q - p) number of idle input ends, are mutually link connected and, each output end of said middle stage self-routing switch module forms at least two branched lines and is connected to the input ends of the individ¬ ual said output stage self-routing switch modules. 10. A self-routing switching system according to 5 claim 3, wherein one of the group of said self-routing switch modules functions as an optional service module and, by imparting a optional service demand in said control information, the input information from said incoming line is given an optional service which is sent out to said outgoing line. 11. A self-routing switching system according to claim 10, where ' in said optional service module is provided replacing one of the group of said middle stage self-routing switch modules. 12. A self-routing switching system according to claim 11, wherein said optional service is an error control for the input information. 13. A self-routing switching system according to claim 11, wherein one of the group of output ends of said input stage self-routing switch modules is taken out and connected to each of the input ends of said optional service module and one of the group of input ends of said output stage self-routing switch module is taken out and connected to each of the output ends of said optional service module. 14. A self-routing switching system according to claim 11, wherein buffer memories are provided for each of the input ends of said optional service module and which comprises a processor and optional service unit - for receiving the information in said buffer memories as input and executing the optional services and selector for sending out the information subjected to the optional service to a target one of said output stage self-routing switch module. 15. A self-routing switching system according to claim 12, wherein when an error is included in said input information, said control information is renewed and the input information is retransmitted from the related originating party. 16. A self-routing switching system according to claim 3, wherein said self-routing switch module can perform priority processing under the control of said call processor. 17. A self-routing switching system according to claim 16, wherein said priority processing is determined according to attributes of said transmission information and when transmission information requiring real time processing, such as voice or video information, is input in said stages of self-routing switch modules, it is sent to the output stage earlier in time than other transmission information not requiring read time pro- cessing. 18. A self-routing switching system according to claim 16, wherein said priority processing is started when input information is stored in the buffer memories in said stages of self-routing switch modules and said buffer memories are in an overload state due to said input information and wherein said path is set on a priority basis through self-routing switch modules with light load states. 19. A self-routing switching system according to claim 17, wherein said call processor detects attributes of transmission information in said call setting phase and said control information is formed for making a passage through self-routing switch modules allocated in advance for priority processing. 20. A self-routing switching system according to claim 18, wherein said buffer memories output overload signals when said buffer memories store a certain value or more of said input information and notify said overload signals to said call processor. 21. A self-routing switching system according to claim 2, wherein said self-routing speech path is comprised of: a converting means for converting input information comprised of said transmission information from said incoming lines and said control information into a time-series format; a transmission information storing means for successively storing transmission information sent successively from said converting means; a write address storing means for storing addresses for accessing said transmission information storing means and successively giving said control information as addresses- to said transmission information storing means; a plurality of read address storing means provided corresponding to a plurality of outgoing lines; an address distributing means for storing read addresses in said read address storing means corresponding to an outgoing line designated by ' control information stored in the addresses of said transmission information storing means, output from said write address storing means; an address selecting means for succes¬ sively selecting the plurality of said read address storing means and giving the addresses stored therein to the transmission information storing means as read addresses and for storing the same in said write address storing means; and a distributing means for distributing the transmission information successively read from said transmission information storing means by the address selection of said address selecting means to the outgoing line corresponding to the said selected read address storing means. 22. A self-routing switching system according to claim 21, wherein said transmission information storing means is comprised of a random access memory (RAM) , each said read address storing means is comprised of a first-in first-out (FIFO) memory, and said write address storing means is comprised of an FIFO memory which successively stores said read addresses. 23. A self-routing switching system according to claim 2, wherein said self-routing speech path is comprised of: a memory means which stores input informa¬ tion comprised of said transmission information from said incoming lines and said control information and operates at N + 1 times the transmission speed of said incoming lines (wherein N is the number of said incoming lines) ; a control means for controlling the writing and reading with respect to said memory means based on said control information and for executing writing control at one phase out of the N + 1 phases formed by the said N + 1 speed and executing reading control during the remaining N phases; and latch groups provided corresponding to said outgoing lines for temporarily holding " read informa- tion from said memory means and, based on the control of the corresponding said control means, discharging held information. 24. A self-routing switching system according to claim 23, further comprising a detection means provided at a stage before said memory means and said control means for detecting said control information out of said input information and inputting the same to said control means. 25. A self-routing switching system according to claim 2, wherein said self-routing speech path is comprised of: memory means provided corresponding to each said outgoing line which operate at N + 1 times the transmission speed of said incoming lines (wherein N is the number of said incoming lines) ; speed conversion means provided corre¬ sponding to each said incoming line for converting the input information comprised of the transmission informa¬ tion from said incoming lines and said control informa¬ tion to said N + 1 speed; a selector for allocating the output of each said speed conversion means to a desired one of said memory means; and a control means for controlling said speed conversion means, said selector, and said memory means, performing writing of input information to said memory means during N phases of N + 1 number of phases formed by said N + 1 speed, and performing reading to said outgoing lines at the remaining one phase. 26. A self-routing switching system according to claim 25, further comprising a detection means provided at a stage before said memory means and said control means for detecting said control information out of said input information and inputting the same to said control means . 27. A self-routing switching system according to claim 26, wherein each said memory means is comprised of a first-in first-out (FIFO) memory, the outputs are sent through flip-flops to corresponding said outgoing lines, and said flip-flops are driven at suitable timings by corresponding said control means. 28. A self-routing switching system according to claim 2, wherein said self-routing speech path is comprised of: storing circuits provided corresponding to each said incoming line which store input information comprised of the transmission information from said incoming lines and said control information; a memory circuit which receives as address input said control information in each said storing circuit, give input information transmission permission signal to one of said storing circuits, and output control signals; and a switch circuit which outputs said input information sent out upon said input information trans¬ mission permission signal to one of the said outgoing lines designated by said control signal from said memory circuit. 29. A self-routing switching system according to claim 28, wherein: said storing circuits are provided with buffers for respectively storing said input information and said control information of said input information; said switch circuit is comprised of a matrix switch which receives input information from said buffers and outputs the same to a corresponding outgoing line; and said memory circuit is comprised of an arbitration memory which combines the control information from said buffers to form address input and outputs, to one of said storing circuits, pair of said input informa¬ tion transmission permission signal and crosspoint control signal for selecting said matrix switch and sending the input information to a destination outgoing line.

Inventors: ABE SHUNJI, FUKUI TOSHIMASA, HAJIKANO KAZUO, HAYAMI HICHIRO, ISONO OSAMU, IWABUCHI EISUKE, MURAKAMI KOSO, NISHINO TETSUO, TACHIBANA TETSUO, ABE, SHUNJI, FUKUI, TOSHIMASA, HAJIKANO, KAZUO, HAYAMI, HICHIRO, ISONO, OSAMU, IWABUCHI, EISUKE, MURAKAMI, KOSO, NISHINO, TETSUO, TACHIBANA, TETSUO
Applicants: FUJITSU LTD, FUJITSU LIMITED
Application year: 1988
Main classification: H04L11
IPC codes: H04L12