Message network for the transmission of digital telegrams with an address consisting of routing words

• US 4,049,906 A
• Filed: 04/21/1976
• Issued: 09/20/1977
• Est. Priority Date: 04/25/1975
• Status: Expired due to Term

• Current Assignee: Hasler AG
• Original Assignee: Hasler AG
• Inventors: Hafner, E., Mey, H.
• Primary Examiner(s): Robinson, Thomas A.
• Application Number:
  US05/679,074
• Time in Patent Office: 517 Days
• Field of Search: 178/2 R, 178/2 B, 178/2 C, 178/2 D, 178/2 E, 178/3, 178/50, 179/18 EA, 340/147 R, 340/147 T
• US Class Current: 178/2.00C
• CPC Class Codes: H04L 12/56 Packet switching systems

Abstract

A general digital message network for short address-coded telegrams having plural switching stations. In each switching station the outputs of the input stores are each connected to one of the inputs of a multiplexer. The inputs of the output stores are connected to the output of the multiplexer and the output stores are each connected to a comparator circuit with a fixed value store in which the routing word associated with the outgoing line of the output store is stored, in such a way that upon correspondence of the routing word in one of the fixed value stores with the routing word at a specific location of the address of the telegram in the associated output store, this telegram is transmittable onto the output line thereof.

Claims

1. A message network for the transmission of digital telegrams, comprising a plurality of switching stations (101-109) for the routing of said telegrams from any of said stations (101) on one of a plurality of selectable routes via any successive interconnected stations (101, 102, 103, 104), to any desired station (104), each of said telegrams including an address consisting of a logical stringing together of routing words (p,d,g,b) and said route being determined by the succession of the routing words of the address (p/d/g/b), in which in each station (101-109) each input line (14,15,16) is connected to an input store (1,2), for each output line (17,18,19) an output store (5,6) is provided and a routing word (i,a,d) is assigned, the routing words (i,a,d) associated with the output lines (17,18,19) of one station (104) being different from each other, in each station (101-109) the outputs of the input stores (1,2) are each connected to one of the inputs of a multiplexer (4), the inputs of the output stores (5,6) are connected to the output (10) of the multiplexer (4) and the output stores (5,6) are each connected to a comparator circuit (7;

67;

68) with a fixed value store (7;

68) in which the routing word (i,a,d) associated with the output line (17,18,19) of the output store (5,6) is stored, in such a way that upon correspondence of the routing word (i,a,d) in one of the fixed value stores (7;

     68) with the routing word at a specific location of the address of the telegram in the associated output store (5;

5.2), this telegram is transmittable onto the output line (17,18,19) thereof.

2. A message network as set forth in claim 1, in which each output store has a first register (5;

5.1, 5.2) which is connected to the comparator circuit (7;

67,

     68) with the fixed value store (7;

     68) and the input of which is connected to the output (10;

56.1-56.8) of the multiplexer (4), and has a second register (6;

6.1, 6.2) the output of which is connected to an output line (17, 18,

     19), and the storage elements of the first register (5;

5.1, 5.2), with the exception of those which correspond to the said location of the address of the telegram, are connected to the storage elements of the second register (6;

6.1), and in that upon correspondence of the routing word (i, a, d) in the fixed value store (7;

     68) with the routing word at the said location of the address of the telegram in the first register (5;

5.2), this telegram is transferrable without this routing word from the first register (5;

5.2) into the second register (6;

6.1, 6.2) and from this latter onto the output line (17, 18,

     19).

3. A message network as set forth in claim 2, in which the storage elements of the first register (5;

5.1, 5.2), with the exception of those which correspond to the first routing word of the address of the telegrams, are connected to store elements of the second register (6;

6.1), and in that upon correspondence of the routing word (i, a, d) in the fixed value store (7;

     68) with the first routing word of the address of the telegram in the first register (5;

5.2) this telegram is transferrable without its first routing word from the first register (5;

5.1, 5.2) into the second register (6;

6.1) and from this latter onto the output line (17, 18,

     19).

4. A message network as set forth in claim 3, in which the input store has two registers (1, 2) which are connected in parallel to one another and the one (1) of which is connected to the input line (14, 15, 16) and to a clock generator (y) for the input of the telegrams and the other (2) of which is connected to the multiplexer (4) and to another clock generator (x) for the shifting of the telegrams, and in that the clock frequency of the one clock generator (y) is equal to the transmission frequency and the clock frequency of the other clock generator (x) is higher than the transmission frequency.

5. A message network as set forth in claim 4, in which the inputs of the multiplexer (4), connected to the outputs of the input stores (1, 2), are connected periodically to the output (10) of the multiplexer (4).

6. A message network as set forth in claim 4, including a multiplexer control (35) responding to the content of the input stores (1, 2), in order to connect only those outputs of the input stores (1, 2) which contain a telegram for transmission from those stores to the output (10;

56.1-56.8) of the multiplexer (4).

7. A message network as set forth in claim 6, in which the input stores (1'"'"', 2'"'"', 1, 2) and output stores (5'"'"', 6'"'"', 5, 6) for local subscriber lines and transmission lines are constructed the same and are connected so as to enjoy the same rights to the multiplexer (4).

8. A method for operating the message network as claimed in claim 2, characterized in that the incoming telegrams, buffered in the input stores (1, 2) are called up after at the latest one telegram length duration by the multiplexer (4), in that the telegrams, in the sequence laid down by the multiplexer (4), simultaneously reach all the first registers (5) of the output stores (5, 6), in that simultaneously each comparator circuit (7, 67, 68) compares the routing word of the telegram address, associated with one of the output lines (17, 18, 19) of the switching station with the routing word (i, a, d) stored in the fixed value store (7, 68) and associated with the respective output line (17, 18, 19), and in that only upon correspondence of the two compared routing words the telegram is stored into the second register (6) of the corresponding output store (5, 6) for the following transmission via the output line (17, 18, 19) of this output store (5, 6) in such a way that the bits of the compared routing word are eliminated and the resulting gap is closed in seamless manner by the moving up of all the following telegram bits.