CA1292541C - Hybrid time multiplex switching system with optimized buffer memory - Google Patents

Hybrid time multiplex switching system with optimized buffer memory

Info

Publication number
CA1292541C
CA1292541C CA000572071A CA572071A CA1292541C CA 1292541 C CA1292541 C CA 1292541C CA 000572071 A CA000572071 A CA 000572071A CA 572071 A CA572071 A CA 572071A CA 1292541 C CA1292541 C CA 1292541C
Authority
CA
Canada
Prior art keywords
block
blocks
cell
read
multiplexes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
CA000572071A
Other languages
French (fr)
Inventor
Michel Servel
Patrick Gonet
Joel Francois
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
France Telecom R&D SA
Original Assignee
Centre National dEtudes des Telecommunications CNET
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Centre National dEtudes des Telecommunications CNET filed Critical Centre National dEtudes des Telecommunications CNET
Application granted granted Critical
Publication of CA1292541C publication Critical patent/CA1292541C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00Packet switching elements
    • H04L49/10Packet switching elements characterised by the switching fabric construction
    • H04L49/104Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105ATM switching elements
    • H04L49/106ATM switching elements using space switching, e.g. crossbar or matrix
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems 
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5672Multiplexing, e.g. coding, scrambling

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

ABSTRACT OF THE DISCLOSURE

A switching system for switching synchronous and/or asynchronous data blocks between incoming and outgoing multiplexes. The asynchronous blocks are sporadically carried in the multiplexes. The cost of the system is reduced owing to the use of a single buffer memory whose cells memorize indifferently synchronous and asynchronous blocks. The number of cells is lower than the product of the number of incoming or outgoing multiplexes and the number of blocks per frame in the multiplexes. A buffer memory managing and write addressing circuit derives and memorizes the occupied or free condition of each of the buffer memory cells thereby permanently selecting the address of one of free buffer cells in which a data block is to be written. The occupied condition of a cell is signalled responsive to the write of an incoming data block into this cell, and the free condition of the cell is signalled responsive to the last read of the written block. A
written block may be read several times when it should be transmitted onto several addressee outgoing multiplexes.

Description

BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates to a system for switching data blocks between several incoming time-division multiplexes and several outgoing time-division multiplexes.
The blocks in each of the multiplexes may be synchronous circuit-mode blocks and/or asynchronous packet-mode blocks and are of a constant length. The synchronous blocks in a same communication are transmitted periodically, at a frame frequency of the multiplexes.
Asynchronous blocks in a same communication are transmitted sporadically in the multiplexes. The blocks result from prior octet packetization both for the circuit-mode communications and the packet-mode communications.
2. Description of ~he Prior Art :
On input to such a switching system, the data blocks in the incoming multiplexes are detected and are multiplexed in an incoming supermultiplex. The switching i8 independent of the actual data content in the blocks.
Nhen the multiplexes carry only synchronous blocks or only asynchronous blocks as described in the U.S. patent N 4J603,416?

issued July 29, 1986, the detected and multiplexed blocks are wrltten in a single buffer memory as and when they arrive, and are read contingent on ranks of time intervals in the addressee outgoing multiplexes and/or ranks of the addressee outgoing multiplexes into which the blocks are to be routed respectively.
When the multiplexes carry both synchronous blocks and asynchronous blocks, both the synchronous blocks and the asynchronous 3~

blocks in the supermultiplex are wri~ten progressively with their arrival into first and second buffer memories. The choice between synchronous blocks and asynchronvus blocks is made in read. The synchronous blocks are read-out from the first buffer memory contingent on the addressee periodic time intervals in the outgoing multiplexes to be occupied, and the asynchronous blocks are read-out from the second buffer memory contingent on the time intervals remaining unoccupied by the synchronous blocks in the outgoing multlplexes.
Whatever the type of switching system, ~he addresses of buffer memory cells where detected blocks should be written, are supplied cyclically by a time base, as with a buffer memory in an PCM
time-division switching system. Thus, for example, for three detected data blocks respectively spaced apart by two empty data blocks, referred to as blank blocks or slots and by five empty blocks in the incoming supermultiplex, the first data block is written in a buffer memory cell having an address k, where k is an integer lying between 1 and the number of block cells of the buffer memory, the second data block is written in a cell having address k+3, and the third data block is written in a cell having address k+9. Intermediate cells having addresses k+l, k+2, and k~4 to k+8 remain unoccupied and can only be occupied in the next addressing cycle if data blocks are supplied from the incoming supermultiplex at the same time as these cells are write addressed respectively.
This cyclic write addressing of a buffer memory basically offers the following drawbacks.

Z~

Aware that the data blocks to be written are distributed sporadically, the number of unoccupled cells in ~he buffer memory is relatively large on average. For a system which only switches asynchronous blocks, the capacity of the buffer memory does not depend on the average rate of detected blocks supplied from the supermultiplex, but on the greater average rate of the blocks in the incoming and outgoing multiplexes, so as ~o lose, where applicable, a minimum number of data blocks. For a hybrid system switching both synchronous and asynchronous blocks, the capacity of each of the two buffer memories is at least equal to the product of the number of time intervals in a multiplex frame and the number of incoming or outgoing multiplexes, i.e., at least equal to the number of time intervals in a frame of the supermultiplex, so as to enable periodical write of the synchronous blocks in a same communication.
Moreover, in a hybrid switching system, the average number of unoccupied cells is multiplied by two owing to the use of two buffer memories.
Consequently the cost of the switching system depends directly on the buffer memory, and hence on the capacity thereof.
~0 OBJECT OF THE INVENTION
-The main ob~ect of this invention is to reduce the buffer memory capacity in a data block switching system, notably of asynchronous or hybrid type. Accessorily, with this reduction it is possible to integrate the buffer memory with input means multiplying the blocks of the incoming multiplexes and output means demultiplexing the blocks read in buffer memory and transmitted into the outgoing multiplexesO

SUMMARY OF THE INVENTION
Accordingly, the present invention provides a swltching system for switching data blocks between a plurality of incoming multiplexes and a plurali~y of outgoing multiplexes, comprising :
input means Eor detecting data blocks in the incoming multiplexes thereby multiplexing detected blocks into multiplexed blocks, buffer means comprising block cells for memorizing said multiplexed blocks, write addressing means for deriving block cell addresses thereby writing said multiplexed blocks in write addressed block cells, read addressing means for memorizing the addresses of the write addressed block cells and arranging them dependent on addressee outgolng multiplexes to which the written blocks are designed thereby reading and multiplexing the written blocks into read blocks, and means for demultiplexing said read blocks and transmitting them to said addressee outgoing multiplexes9 said write addressing means comprising means for selecting the address of one of the block cells in said buffer means which are free when a data block has been detected thereby wrlting this detected block in said free selected cell, a free cell address selection being established contingent on block cell addresses which are supplied from said read addressing means to said selec~ing means when memorized blocks are read.
Thus, according to the invention, a buffer means cell in which a data block is to be written is nct write addressed cyclically but is chosen from the buffer mPans cells which are free at the time of the block write. The selecting means monitors permanently the busy or free condition of all the buffer means cells so as to continouously offer a ~z~

free cell address for a block to be written. The free cell address is replaced by an address of another free cell after write of the block.
The cell now occupied by the written block is then released on the first read of the block for a point-to-poin~ communication, or on the last read of the block for a multipoint communication. The released cell can be immediately re-used for the write of another incoming block, without waiting, as in the prior art, for a time base to produce the address of the released cell after a complete buffer means addressing cycle.
In these conditions, the capacity of the buffer means depends directly on the average rate of the data blocks in the incoming supermultiplex. Referring to the example evoked previously, if the cells having the addresses k to k+9 are selected in increasing order of addresses, the cells having the addresses k, k+l and k-~2 memorize said first, second and third detected data blocks and if amongst the cells with addresses 1 to k+l, only the cells having the addresses k and k+l are released before a fourth data block is supplied from the incoming supermultiplex, this fourth block is written in the cell having the address k.
2~ According to an aspect of the invention, a switching system is designed to switch data blocks also relating to multipoint communications. With a multipoint communication, a data block is read as many times as there are addressee outgoing multiplexes having to receive the data block. The buffer means cell in which the data block is written, is released on the last read of the block, i.e. 9 after nbm reads, where nbm denotes the number of addresæee outgoing multiplexes.

Z~ ~

For this purpose, the write addressing means comprises means for indicating the numbers of outgoing multiplexes to which data blocks memorized in buffer means cells are still to be ~ransmitted, respectively, the number relating to a cell memorizing a block being equal to a predetermined number of addressee outgoing multiplexes for the block when the block is written in the cell, and being decremented by one unity in response to each read address of each cell supplied from the read addressing means, release of said cell having memorized said block being signalled by the indlcating means to the selecting means as soon as said number reaches zero.
According to a preferred embodiment described in detail in the remainder of the description, a switching system is hybrid type and comprises, in a known manner, input means for detecting said data blocks in said frames of said incoming multiplexes and multiplexing detected data blocks into detected and multiplexed blocks, first buffer means for memorizing said detected and multiplexed blocks in first block cells, second buffer means for memorizing said detected and multiplexed blocks in second block cells, output means for multiplexing synchronous and asyn&hronous blocks memorized in said first and second buffer means and transmitting them contingent on their destinations to said outgolng mul~iplexes thereby forming said frames in said outgoing multiplexes, :12~

write means for deriving block cell addresses thereby writing each of said detected and multiplexed blocks in firs~ and second cells, first read means receiving said addresses of said first cells in which are written said synchronous blocks for reading each of said memorized synchronous blocks, by correspondence between said address of said first cell in which said synchronous block is written and at least an identification number of an outgoing multiplex time interval to be oc~upied by said synchronous block, and several second read means respectively assigned to said outgoing multiplexes and addressed by said write means, and receiving the addresses of said second cells in which are written and memorized asynchronous blocks for reading each of said memorized asynchronous blocks, by correspondence between the address of the second cell in which said asynchronous block is written and an identification number of the addressee outgoing multiplex.
In accordance with a main feature of the invention, the hybrid switching system is characterized in that said first and second buffer means comprise a single buffer memory having block cells capable of memorizing indifferently synchronous blocks and asynchronous blocks detected and multiplexed, and said write means comprises means for selecting a write address of one of block cells of said buffer memory which are free when a data block has been detected thereby writing this detected block in said free selected cell, a free cell address selection being established contingent on block cell addresses which are supplied from said first and second read means when memorized synchronous and asynchronous blocks are read in said buffer memory respectively.
It thus appears that a hybrid switching system embodying the invention comprises a buffer memory having a capacity less than half the set of two buffer memories included in the prior switching systems. This considerably reduces the cost of the switching system.
The cost is reduced all the more when the single buffer memory can be integrated notably wlth input and output rotation matrixes included respectively in the input and output means. It is recalled that these rotation matrices making simultaneous block octet permutations offer the advantage, as compared to conven~ional serial-to-pàrallel and parallel-to-serial conversion multiplexing and d~multiplexing means, of processing data blocks of multiplexes with very high bit rates, notably for video communications.
The reduction in the capacity of the buffer memory also solves interconnection overload problems inside the system, and owing to the integration, optimizes the operating speeds notably concerning the write and read of the buffer memory cells.
BRIEF DESCRIPTION OF THE DRAWING
The foregoing and other ob~ects, features and advantages of the invention will be apparent from the following detailed description of several preferred embodiments of the invention with reference to the corresponding accompanying drawings in which :
- Fig.l shows a hybrid frame in an incoming or outgoing multipl0x ;
- Fig.2 is a block-diagram of a hybrid switching system embodying the invention ;

- Fig,3 is a detailed block-diagram of a buffer memory read addressing and control circuit, and a read-block transfer control circuit, both included in the hybrid system ;
- Fig.4 shows in detail a first transfer con~rol circuit relating to first octets in read blocks and interconnected between the buffer memory and an output rotation matrix in the hybrid system ;
- Fig.5 shows ano~her transfer circuit in detail ; and - Fig.6 is a detailed block-diagram of a buffer memory managing and write addressing circuit included in the hybrid system.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
An incoming or outgoing time multiplex in the switching system embodying the invention has a frame structure such as shown in Fig.1, which is referred to in the remainder of the specification. The multiplex carries 16-octet blocks occupying consecutive time intervals. For example, when the multiplex has a rate of 280 Mbit/s, an octet block is transmitted during 0.457 ~s, corresponding to an octet period of 28.57 ns.
In practice, the frame of the multiplex is hybrid, i.e., includes both synchronous data blocks from circuit-mode transmission channels carrying speech for example, and asynchronous data blocks from packet-mode transmission channels. By definition, the synchronous blocks occupy time intervals having predetermined ranks in the frame, such as second interval IT1, whereas the asynchronous blocks, so-called packet blocks, occupy, in a practically sporadic fashion, the other time intervals, such as intervals IT2, IT3 in the frame.
Moreover, several asynchronous blocks in the same communication or message to be retransmitted in one or several outgoing multiplexes can _ g _ z~

be contained in the same frame, some consecutively, others time spaced. This results in that certain asynchronous blocks in a frame can be empty of data and will be subsequently called "blank blocks".
Blank blocks nevertheless have a predetermined pattern of bits which cannot be imitated in the packet blocks so as to serve as packet synchronization.
According to the frame structure illustrated in Fig.1, a frame contains 69 16-octet blocks occupying time intervals ITO to IT68 ;
nevertheless any other sizing of the frame, with a number of blocks such as 64, 65, .... 72, which may be different from a power of 2 is possible. A first interval ITO in the frame contains a frame synchronization block, also known as frame alignment or framing block or word, having the following pattern : 0000111100110011...00110011.
Furthermore it is possible to assign only a part of this first interval ITO, for example the half, to the alignment pattern 000011110011...0011, and the other half may be assigned to other information. A blank block9 so-called packet synchronous block, such as that of interval IT2, has the following pattern 0000111101010101,.01010101, in which the first octet is identical to that of the frame synchronization block corresponding to "OF" in hexadecimal code and forms a synchronization label followed by pairs of filling bits "01". An asynchronous block, such as the one in interval IT3, contains a first octet forming a label of the block and 15 data octets. The label of an asynchronous block constitutes an identifier of a packet communication in which a predetermined number of bits are assigned to the multiplex identification and to the identification of transmission channels outgoing from the switching z~

system and possibly other subsequent secondary switching systems.
Thus, the asynchronous blocks in the same communication have a same specific label which will be substitued for any other label when switching in the switching system, thereby routing the block to another main or secondary switching system.
As shown in Fig.2, the hybrid switching system is designed to switch data blocks from sixteen incoming multiplexes EO to E15 to sixteen outgoing multiplexes SO to S15. The system basically includes, on input side to a primary buffer memory MT3 16 input circuits CEO to CE15 and an input rotation matrix MRE, on output side from buffer memory MT, 16 transfer circuits CTRO to CTR15, an output rotation matrix MRS and 16 parallel-to-serial converters p/sO to p/s15 firstly, and means for ensuring tha write and read of packets in the buffer memory according to the communications requested, such as a write control memory MCE, a label translation memory MTR, a read addressing and control circuit CAL, and a buffer memory managing and write addressing circuit CAE, secondly.
The switching system also comprises a time base BT including a local clock with a frequency that is an lnteger multiple of the ~0 multiplex rate. In particular, the time base BT contains frequency dividers and counters to produce, by a first output, a clock signal H
at the octet frequency in the multiplexes ; by four outputs BTO to BT3, 4-bit multiplex address words e every 16 periods of the signal H
and, through an inverter circuit INV, a word e complementary of e ;
and by outputs BTO to BT3 and seven other outputs BT4 to BT10 an outgoing time interval addres~ word AITS with 11 bits . I'he words e and AITS are transmitted to the octet frequency H. The time base . .

ZS ~

operates on a frame cycle of 69x16=1104 time intervals corresponding to the multiplexing of 16 multiplexes, at a rate of 69 incoming time intervals or blocks per multiplex and per frame period, so as to form read addresses of a flrst read control memory MCL1, which is designed for the read control of data blocks written in the bufEer memory, as will be seen further on. The words e and e vary successively from 0 to 15 and from 15 to 0 and form addresses of ~he incoming and outgoing multiplexes respectively. The word AITS vary from 0 to 1103.
The basic task of the input circui~s CE0 ~o CE15 is to synchronize the frames in the incoming multiplexes E0 ~o E15 before their synchronous multiplexing. In fact, the labels in the data blocks of the incoming multiplexes are not a priori applied simultaneously on input to circuits CE0 to CE15. This synchronization is completed by that of the asynchronous blocks, i.e., by their alignment subsequent to sporadic detections of blank blocks. Moreover, circuits CE0 to CE15 are designed to produce to 7-bit rank numbers of the blocks in each of the frames of each incoming multiplex by detection of the frame synchronization blocks, and to extract from frames the blank blocks which are not transmitted on output from the input circuits.
Each of the input circu~ts CE0 to CE15 chiefly comprises a frame control and synchronous circuit for signalling the start of each block, indicating the block ranks in the frames and recover an octet frequency, and a serial-to-parallel converter, a queue FIF0 and a logic queue addressing circuit, described in detail in U.S. patent N
4,603,416. Thus each input circuit CE0 to CE15 includes a queue of words with 8+7+1=16 parallel bits which each consists of an octet, a packet rank packet when the octet is a first packet octet, and a block z~

start indication bit. The data octets and the packet ranks are transmitted by circuits CEO to CE15 to matrix MRE through 8-wire buses dO to dl5 and 7-wlre buses NO to N15, respectively. Nevertheless, as according to Fig.5 of U.S. patent N 4,603,416, the octets with the same rank in the frames of buses dO to dl5 are delivered sequentially at the rate of the octet clock H ; in particular this shift resulting from a parallel-diagonal conversion, so-called "paragonal" conversion, requires that the labels be shifted from a bus dO to dl5 to the next bus dl to dl5, dO, with a duration equal to that of the octet period.
This shift is obtained via a cyclic selection circuit AIG, such aæ a demultiplexer having an input to ætate "1", which receives the words e supplied by the time base BT and derives signals having the frequency of the blocks and delayed successively by an octet period.
Rotation matrixes MRE to MRS play a similar function to those described in U.S. patent N 4,603,416. Rotation matrixes MRE and MRS
have rotation control inputs to which are applied the words e and e varying cyclically from O to 15 and from 15 to O and which implicitly identify the ranks of the incoming and outgoing multiplexes, respectively.
In the matrix MRE, the rotation takes place on 8+7=15 bits so as transmit firstly, in a first 7-wire output bus DS, ~he block ranks in synchronism with the first octets of the multiplexed blocks that are transmltted by a second 8-wire bus DO, secondly, the 16 octets of each block in sixteen 8-wire buses DO to D15 forming an incoming supermultiplex connected to the buffer memory. If i denotes the rank of an octet in a packet block, and ; the rank of an incoming multiplex, where i and ; are integers lying between O and 15, then the ~zs~

octet with rank i in a block delivered from the bus dj is transmitted by the bus Di and succeeds to the octet having rank i~1 in this same block and transmitted by the output bus D(i-1), after one octet period of signal H. All the octets with rank i in blocks of the same rank in the time shifted frames of buses dO to dl5 are transmitted by bus Di, the octet in bus dj succeeding to the octet in bus d(j-1). As will be seen subsequently, the output rotation matrix performs the reverse operation so as to "de-diagonali~e" the blocks outgoing from the buffer memory.
The buffer memory MT contains 16 buffer sub-memories MTO to MT15.
Bus DO is linked to 8 first inputs of a label multiplexer MET1 through an 8-parallel-stage label register RETI. Eight outputs from the multiplexer METI apply first octets to data inputs of the first buffer sub-memory MTO. The first memori~ed octets are first octets of synchronous blocks coming directly from bus DO and new labels of asynchronous blocks read-out in the translation memory MTR. The register RETI compensates for the label translation time when a synchronous block is to be written in buffer memory MT. The other output buses D1 to D15 of matrix MRE are linked directly to data inputs of sub-memories MT1 to MT15 respectively.
As is shown in Fig.2, associated to each of sub-memories MTO to MT15 are a write address reglster RAEO to RAE15, a read address register RALO to RAL15, and an address multiplexer MXO to MX15 linked to outputs of the two latter registers and transmitting the write and read addresses to the sub-memory at the rhythm of clock H. Reglsters RAEO to RAE15 are series-connected to a free cell write address bus ade from clrcuit CAE. Nevertheless, ao as to preserve the delay due to re~ister RTI, the wrlte of the first two octets of each block issimultaneous so that the output of register RAE0 is connected directly to the input of register RAE2, register RAE1 being inexistent.
Likewise, registers RAL0 to RAL15 are series-connected to a block read address bus ADL from circuit CAL. All the previous registers receive the octet signal H so as to write or read the octets in a same data block during sixteen successive octet periods, in accordance with the "paragonal" shift of the block octets in buses D0 to D15 of the incoming super~ultiplex. The write and read addressing of the sub-memories are deduced in the same way, in dependence of a write address ade and a read address ADL respectively. Thus, although the incoming blocks in the buffer memory are presented in diagonal form, they are nevertheless written in orthogonal space form in the sub-memories.
The buffer sub-memories MT0 to MT15 respectively memorize the sixteen octets of a data block. As the selection of a 1-octet sub-cell in each of the sub-me~ories, i.e., a 16-sub-cell cell in memory MT is dynamic, and as a cell that has ~ust been released can be immediately re-used to write another incoming block, it suffices that the memory MT be dimensioned to 64 blocks per frame and by multiplex to obtain a very low probability of block loss due to undersizing of memory MT.
Thus, each of the sub-memories MT0 to MT15 contains 64x16=1024 1-octet cells, a number which is substantially lower than the number of blocks per frame equal to 1104.
The eight data outputs of each of the buffer sub-memories MT0 to MT15 are linked to a respective 8-wire input bus F0 to F15 of the output rotation matrix MRS via respective transfer circuits CTR0 to CTR15. The transfer circuits are each linked to two output wires ofcircuit CAL transmitting S/A and SY signals designed to enter frame synchronization blocks and blank blocks into the outgoing multiplexes.
Eight-wire output buses GO to G15 from matrix MRS transmit data blocks for multiplexes SO to S15 via parallel to-serial converters p/sO to p/s15 respectively. The data blocks in the different buses GO to G15 have labels shifted by one octet period from one bus to the next, as in input buses dO to dl5.
A description is now made successively of the block and label ~rite controlling m2ans MCE~MTR and circuit CAL.
As also illustrated in Fig.2, a switching control unit UCC is linked by a bus BUS to data and write addressing inputs of memories MCE and MTR and the first memory MCLl included in circuit CAL. The switching control unit UCC monitors the circult-mode and packet-mode communications running through the switching system, as a function of signalling blocks detected in the incoming multiplexes and identified by specific labels. Contingent on further communications to be set up or communications to be released, unit UCC modifies the content of the three memories MTR, MCE and MCLl. Memories MCE and MCLl together with a second memory MCL2 included in circuit CAL are RA~I memories and each contains an addressable cell number at least equal to the number of data blocks per frame in the multiplexes, i.e., at least 69x16=1104 cells. Secondly, the memory MTR containæ as many cells as there are virtual circuits addressable by the various labels, i.e., for sixteen multiplexes and one 8-bit label, 16x2 =4096 cells. Each of the cells in memories MCE, MTR and MCLl contains 4+1=5 bits, 16~8=24 bits, 11+2=13 bits respectively.

ZSI~

The write control memory MC~ is read addressed by ll-bit addresses each comprising a first 4-bit part formed by a word e identifying the rank of an incoming multiplex and provlded from time base BT, and a second 7-bit part formed by the rank of a block in a frame of the incoming multiplex and delivered by bus DS of matrix MRE.
Each cell in memory MCE contains one bit s/a indicating whether the block to be written in buffer memory is assigned to a synchronous communication (s) to which s/a="l", or to an asynchronous communication (a) for which s/a="0", together with four significant bits indicating the binary code number nbms of outgoing multiplexes S0 to S15 in which the block to be written should be transmitted when the communication is synchronous. It is observed that reciprocally, blocks from several incoming multiplexes E0 to E15 can be transmitted in a same outgoing multiplex, according to the principles of a multipoint communication. Thus, for example, if a synchronous block is to be transmitted to three outgoing multiplexes such as multiplexes Sl, S4 and S9, the number nbms indicates the value 3="0011".
The parallel bits of the number nbms read in memory MCE are applied to the four inputs of an OR gate Ps whose output is linked to a first input of a multiplexer MXsa, and to four first inputs of a multiplexer ~B, members Ps, MXsa and MNB being included in circuit CAE shown in Fig.6. Bit s/a is applied firstly, on a selection input of multiplexer METI thereby transmitting a new label of synchronous block read in memory MTR when s/a="0", secondly, to a write control input of a second read control memory MCL2 and to lnverting control inputs of sixteen 2-input AND gates PAO to PA15 included in circuit - ,, , .. - . .~ .

~ZZ';~Z~ ?~L

CAL (Fig.3), and to the selection inputs o~ multiplexers MXsa and MNs included in circuit CAE (Fig.6).
Translation memory MTR is loaded with a new label to be assigned to the asynchronous blocks of a communlcation by unit UCC, when setting up thiæ communicatlon. This new label is read by a 12-bit address comprislng a first 4-bit part formed by a word e identifying the rank of the incoming multiplex carrying the blocks of this asynchronous communication, and a second 8-bit part consisting of the label of these blocks transmitted by output bus D0 from input rotation matrix MRE. In practice, each cell of memory MTR comprises a new 8-bit label to be applied to the second inputs of multiplexer METI for insertion as header in the blocks of the communication, and a 16-bit word only including one or several bits a~ high state "1" whose ranks in the 16-bit word correspond to the ranks of the outgoing multiplexes S0 to S15 to which the blocks of the asynchronous communication are routed. The bits of the 16-bit words are applied respectively to second inputs of gates PA0 to PA15 (Fig.3).
Now referring to Fig.3, the read addressing and control circuit CAL contains sixteen FIFO queues FS0 to FS15, a queue read enabling demultiplexer TR, the sixteen gates PA0 to PA15 for selectively authorizing writes in the queues, the first read control memory MCL1, a multiplexer~MFS for the addresses read in the queues, a multiplexer MGS for selecting an empty queue, together wi~h a transfer control circuit GST that comprises a two-input multiplexer MLS and two 16-stage shift registers RGV1 and RGV2, for reading frame synchronization blocks and blank blocks ln the transfer circuits CTR0 to CTR15. Circuit CAL furthermore comprises a second read control ~?2S;~L

memory MCL2, an address multiplexer MA2 for memory MCL2, and a block read address multiplexer ~IALI.
The first read control memory MCL1 contains at least 16x69=1104 usable 13-bit cells which are cyclically read for each frame period responsive to the 11-bit words AITS supplied by the tlme base. Each word AITS identifies firstly the rank of an outgoing multiplex S0 to S15 corresponding to the 4-bit word e, secondly by 7 other bits the rank of time interval to be occupied by a block in the outgoing multiplex. Each of the cells in memory MCL1 contains one 11-bit word AITR identifying the 4 -bit rank of the incoming multiplex and ~he 7-bit rank of the time interval in this multiplex that is occupied by an incoming block whose first octet should be read in buffer sub-memory MT0 at the time corresponding to the read addressing of the cell by the corresponding word AITS. In other words, memory MCL1 makes correspond, for each frame period, the address AITS of a time interval of an outgoing multiple~ i.e., an octet address in an outgoing bus F0 to F15 of one of the buffer sub-memories MT0 to MT15, to the address AITE of a time interval of an incoming multiplex, i.e., the address of an incoming octet in an incoming bus D0 to D15 of one of the buffer sub-memories, this incoming octet having to be read when addressing the time interval of the outgoing multiplex. As already stated~ memory MCL1 is linked through bus BUS to the switching control unit UCC so as to write the addresses of the incoming time intervals contingent on these different correspondences between the incoming and outgolng time intervals, and hence in dependency on the routings of the communications detected when setting up communications. The read addresses of the incoming time intervals AITE are applied to first inputs of multiplexer M~2.
With each address of incoming time interval AITE, a bit S/A
indicating the synchronous, S/A="l", or synchronous, S/A="0", type of the block contained in the incoming time interval, and a synchronization enabling bit ST which is at state "1" only when the associated read addres~ AITS corresponds to a synchronization block of outgoing multiplex frame, are also written, in the corre~ponding cell of memory MCLl. Thus sixteen cells in memory MCLl contain a bit ST at state "1", the other cells in memory MCLl containing a bit ST at state "0". The outgoing block bits S/A read from memory MCLl are successively applied to an inhibition input of demultiplexer TR, to a selecti~n input of multiplexer MALI, to a selection input of multiplexer MLS, to a serial lnput of shift register RGVl and to a first input of a two-input OR gate ESA. An output of gate ESA is linked to first inputs of an OR ga~e PVE and and AND gate EAL included in circuit CAE (Fig.6). Bits ST read from memory MCLl are successively applied to a direct data input of multiplexer MLS.
The second read control memory MCL2 also contains at least 1104 cells. Each cell of memory MCL2 contains a 10-bit word identifying an address ade of a cell in buffer sub-memories MTO to MT15 where an incoming block is written. The addresses ade are transmitted to memory MCL2, in the same way as to write address register RAEO (Fig.2), by an available cell address memory ~D included in circuit CAE (Fig.6).
Memory MCL2 is addressed by multiplexer MA2, firstly write on each first octet half-period by an incoming block ll-bit address transmitted by both link e of time base BT and outgoing bus DS from - 20 ~

rotation memory MRE, like the read addressing of memory MCE (Fig.2), secondly read on each second octet half-period by an lncoming time interval address AITE read in memory MCL1. I~ is observed that the write addresses e+DS applied to multiplexer MA2 form incoming time interval addresses but which are permanently arranged according to the cyclic and constant order of the time-division multiplexing of the incoming intervals in matrix MRE, whereas the addresses AITE read from memory MCL1 depend on the switching to be implemented and are completely disordered.
Thus memory MCL2 ensures an address conversion, i.e., a correspondence between the rank of an incoming time interval in the frame of multiplexes D0 to D15 and the address of the cell of buffer memory MT in which the incoming block occupying the incoming time interval is written. In fact, given that as embodied by the invention, the cells of the buffer memory are not assigned to predetermined incoming time intervals, or respectively to the incoming multiplexes, it is necessary, on the write of a block notably synchronous, to memorize the address ade of the buffer memory cell memorizing this incoming block. Thus, this address ade is written into memory MCL2 in response to rank e+DS of the incoming block, and is read from memory NCL2 in response to the rank of the outgoing time interval AITE which is to be occupied by the incoming block, a rank which activates read of incoming block rank AITE in memory MCLl. In practice, the memorization of the buffer memory cell addresses in memory MCL2 is only used for the synchronous blocks and is enabled by bits s/a='11"
delivered by memory MCE (Fig.2) and applied to a write enabling input Z5~

of memory MCL2. The buffer memory cell read addresqes for the asynchronous incoming blocks are managed by queues FSO to FS15.
O~ueues FSO to FS15 are FIFO ("First-In, First-Out") type, and have data inputs connected to the 10-wire output bus of the available cell address memory MAD delivering the cell write addresses ade. Write control inputs of queues FSO to FS15 are connected respectively to outputs of addressing gates PA0 to PA15, whereas read control inputs of the queues are connected respectively to the sixteen outputs of the multiplexer TR that receives the words e from time base BT, via the 1~ inverter circuit INV. 10-wire buses outgoing from queues FSO to FS15 are applied to inputs of multiplexer MFS and are selected by the words e received on the selection input of multiplexer MFS. The 10-wire output bus from memory MCL2 and the 10-wire output bus of multlplexer MFS are connected respectively to first and second inputs of the cell read address multiplexer MALI and are selected by bits S/A read in memory MCL1. The output bus of multiplexer MALI delivering read addresses ADL of buffer memory cells is connected to the inputs of the first read address register RALO (Fig.2) and also to second inputs of two address multiplexers MAEL and MAE included in circuit CAE (Fig.6).

Empty condition outputs of queues FS0 to FS15 are connected respectively to sixteen inputs of multiplexer MGS and are selected by the words e applied to four selection lnputs of multiplexer MGS. The output of multiplexer MGS supplies a bit FNV at s~ate "1"
corresponding to a non-e~pty queue selected by words e. Bit FNV is transmltted to a second input of the OR gate ESA and to a data inverting input of multiplexer MLS. The output of multiplexer MLS ls connected to the serial input of the second shift register RGV2.

The write and read operations of queues FS0 to FS15 are similar to those descrlbed in U.S. patent N 4,603,416. Queue FSj i9 assigned to the outgoing multiplex Sj so as to store the addresses ade of the cells of buffer memory MT in which asynchronous blocks are written and designed for multiplex Sj, and so as to read these addresses, at a rate of one address every sixteen octet periods on average, to read the blocks written as long as the queue contains at least one address.
As already stated, knowing that memory MCL2 is in fact used to read synchronous blocks, the write and read of a queue are only authorized when the corresponding bit s/a applied to the inverting inputs of ~ND
gates PA0 to PA15 and the corresponding bit s/a applied to the inhibition input of demultiplexer TR and to the selection input of multiplexer MALI are respectively to low state "0". In write, queue FS~ stores a new address ade when the bit of rank ~ in the 16-bit words supplied by the translation memory MTR, simultaneously with the new label of the asynchronous block to be written, is at state "1"
which opens the AND gate PA~ amongst the gates PA0 to PA15. Then the address ade of the cell in which the asynchronous block was written, ls read from queue FS~ in response to a word e equal to blnary coded number ~ expressed by a "1" only on the output from multiplexer TR
connected to the read input of queue FS~. The read addressing cycle of the queues depends on the complementary words e corresponding to the addresses of the outgoing multiplexes decreaslng from 15 to 0 so as ~o enable the "de-diagonali~ation" in the output rotation matrix MRE, whose principle iæ illustrated in Figs.6 and 7 of the ~.S. patent N4,603,416. According to the number of cell addresses contained in the queue FS~, the address of the asynchronous block just written will be read prac~ically immediately or offIine. The read cell addr~ss isthen transmitted to the second inputs of register MALI ln order to read the block itself.
It is observed that the addresses ade written in the queues are not supplied cyclically by time base BT, but by the buffer memory managing and write addressing circuit CAE thereby optimizing the memorization time of the blocks in the buffer memory.
Multiplexer MGS, every sixteen octet periods, sounds the condition of queues FS0 to FS15 so as to insert a blank block in outgoing multiplexes S0 to S15 when the corresponding queues are empty, with the exception of the time intervals corresponding to the insertion of the outgoing synchronization blocks indicated by bits ST="1". The different insertions of blank and synchronization blocks are made in transfer circuits CTR0 to CTR15 under the control of circuit GST.
As shown in Fig.~ J transfer circuit CTR0 includes eight multiplexers Z00 to Z07 having first and third parallel data inpu~s receiving respectively bits of rank 0 to 7 in the first octets of the outgoing blocks from buffer sub-memory MT0. In the same way, each of the other transfer circuits CTR1 to CTR15, such as circuit CTRi shown in Fig.5 for i varying from 1 to 15, includes eight parallel multiplexers ZiO to Zi7 having first and third data inputs receiving respectively the bits of rank 0 to 7 in the rank-i octets of the outgoing blocks from buffer sub-memory MTi. Second and fourth data inputs of the multiplexers included in transfer circuits CTR0 to CTR15 are connected to two read-only-memories, of wired memory type, having stored the patterns of a blank block and a frame synchronisat~on - 2~ -.

312~Z~ ~

block, respectively. Thus in transfer circuit CTR0, the second andfourth inputs of multiplexers Z00 to Z03 are at state "0", and the second and fourth inputs of multiplexers Z0~1 to Z07 are at state "1"
in accordance with the label of the blank and synchronlzation blocks "00001111". In the other transfer circuits, such as circuit CTRi, the second inputs of multlplexers ZiO, Zi2, Zi4 and Zi6 are at state "0", and the second inputs of multiplexers Zil, Zi3, Zi5 and Zi7 are at state "I" in accordance with the filling octets "01010101" of a blank block, whereas the fourth inputs of multiplexers ZiO, Zil, Zi4 and Zi5 1~ are at state "0", and the fourth inputs of multipl~xers Zi2, Zi3, Zi6 and Zi7 are at state "1" in accordance with synchronization octets "00110011".
As shown in Fig.3, regi6ters RGVl and RGV2 included in transfer control circuit GST receive respectively the bits S/A and synchronization bits SY, the latter being derived by multiplexer MLS.
The sixteen parallel outputs of register RGVl are connected respectively to first selection inputs of the multiplexers in the transfer circuits CTR0 to CTR15, and the sixteen parallel outputs of register RGY2 are connected respectively to second selection inputs of the multiplexers in circuits CTR0 to CTR15. Bits S/A and SY are shifted in registers RGVl and RGV2 by one stage in response to an octet clock pulse H, whereby a couple of bits S/A and SY controls the successive transfers of the sixteen octets of a block for sixteen octet periods ~ to an 8-wire input bus F0 to F15 of matrix MRS.
The transfers of the four types of block, i.e., "asynchronous"
blocks such as packet-mode blocks and blank blocks, and "synchronous"

s~

blocks such as circuit-mode blocks and synchroniza~ion blocks, are governed according to table I below :

TABLE I
multiplexers Z selections 0 FNV STlnputs S/A SY
packet 1 x 0 blank block 0 x 1 0 circuit x 0 2 1 0 sync. frame x 1 3 In eable I, a cross "x" may be a "1" or "0". Thus a blank block is transferred on output when at a selectlon time "e"=~ of an outgoing multiplex S;, queue FS~ is empty and S/A i8 at state "0", whereas a frame synchronization block is transferred to the outgoing multiplex S; when memory MCL1 delivers bits S/A="1" and ST="1" subsequent to a read address AITS=";".
Now referring to Fig.6, the buffer memory managing and write addressing circuit CAE basically comprises a cell release memory NLC
and an available cell address memory NAD. Memories MLC and MAD include respectively 1024 4-bit cells and 1024 10-bit cells which are respectively assigned to monitoring the 1024 one-octet sub-cells of buffer sub-memory MT0, and more generally, the 1024 16-sub-cell cells in memory MT, i.e., 1024 data block cells.
For eac~ buffer memory block cell, the respective cell in memory MLC memorizes the updated number of times which should be read a data block written in the buffer memory cell. Initially, when the data S~L

block is written~in, the cell of memory MIC stores the number ofoutgoing multiplexes to which the block should be transmitted, then on each read of this block, the stored number is decremented by one unity until it reaches zero so as to release the buffer memory cell for the write of another block via memory MAD, as will be seen later.
As shown ~n Fig.6, memory MLC is associated firstly to a sum~ator-encoder SOM and a numbers multiplexer MNB to lnitially store the outgoing multiplex numbers associated to the writtPn blocks, secondly to a decrementation circuit DEC and to a zero test circuit TZ
1~ for said multiplex numbers so as to modify said numbers. Memory MLC is also associated to other multiplexers and logic gates for suitable write and read addressings contingent on the writP and read times of the buffer memory cells notably.
The first inputs of multiplexer MNB receive the outgoing multiplex 4-bit numbers nbms associated to the synchronous blocks to be written and supplied from the write control memory MCE (Fig.2).
Four second inputs of multiplexer NNB are connected to the outputs of summa~or-encoder SOM having sixteen inputs connected respectively to the outputs of queue write addressing gates PAO to PA15. The selection input of the number multiplexer MNB receives the bits s/a transmitted by memory MCE. The four outputs of multiplexer MNB are connected to the four data inputs of the release memory MLC, via first inputs of a multiplexer M~ which are selected during first octet half-periods H/2.
When a synchronous block is to be written in buffer memory, the number nbms of outgoing multiplexes to which the synchronous block is to be transmitted, is selected in multiplexer M~B by s/a="l" and written in memory MLC. When an asynchronous block is to be written in buffer ~25'~

memory, the ~umber nbma of outgoing multiplexes to which theasynchronous block is to be transmitted, is deduced in summator-encoder SOM, from the sum of bits "1" supplied to the outputs of gates PAO to PA15 write addressing queues FS0 to FS15 associated to said outgoing multiplexes. The number nbma is selected in multiplexer MNB by s/a="0" and is written in memory MLC.
To write such a number of outgoing multiplexes, nbms or nbma, the write and read address multiplexer MAEL receives on first inputs, a block cell write 10-bit address ade supplied from outputs ACS+ALS of memory MAD and corresponding to an unoccupied block cell in buffer memory MT in which the data block is to be written. Such a write addressing is done during a first octet half-period, multiplexers MD
and MAEL, like two other multiplexers MBE and MAE in circuit CAE, having selection inputs recelving the octet block signal H supplied by time base BT.
The previous write is authorized thanks to initial write enabling means comprising the 4-input OR gate Ps, a 16-input OR gat~ Pa, and a multiplexer MXsa. The inputs of the OR ga~e Ps receive the 4-bit numbers read in the write control memory MCE, and applies a "1" to a first input of multiplexer MXsa when the outgoing multiplex number nbms for synchronous block is at least equal to "1". The inputs of the OR gate Pa are connected respectively to the outputs of gates PAO to PA15 (Fig.3) and, as a result, applies a "1" to a second input of multiplexer MXsa when at least one oE the gates PA0 to PA15 write addresses a queue and hence when the outgoing multiplexes number nbma for synchronous block read in the translation memory MTR is at least equal to 1. The first and second inputs of multiplexer MXsa are 5 ~

selected by the states of bits s/a, ~ t and "0", respectively. Theoutput of multiplexer MXsa i8 connected to a first input of OR gate PVE whose output is connected to a write enabling input of memory MLC.
Thus the writes of numbers nbms and nbma at least equal to 1 read from memories MCE and MTR are enabled in memory MLC, respectively when s/a="l" and 8 /a="0".
In read, the release memory MLC is addressed by 10-parallel bit read address ADL transmitted by the output of ~ultiplexer MAlI (Fig.3) and applied to the first inputs of multiplexer MAEL. This read address IO ADL of buffer memory block cell is equal to the write address of the same block ade and ls transmitted each time ~he previous written block has to be read, such a read being reiterated contingent on the updated corresponding number nbma of outgoing multiplexes.
The number of outgoing multiplexes nbm read from memory MLC is firstly decremented by one unity in decrementation circuit DEC.
Circuit DEC has four inputs connected to the data outputs of memory MLC, four number outputs connected to the inputs of an OR gate OAL and test circuit TZ, and a sign output connected to a reset input of circuit TZ. Four outputs of circuit TZ are connected to the data inputs of memory ~LC via second inputs of multiplexer MD. Subsequent to the decrementation of the number nbm read in memory MLC, circult DEC transmits the binary code number (nbm-l) together with a sign bit SIG. In test circuit TZ, the sign bit SIG equal to "1" or to "0" when (nbm-l) is positive or negative, is compared to '~0". If SIG="l", the number (nbm-l) greater than or equal ~o ~ero i9 not modified and is written in the same cell of memory MLC having address ADL ; such a write is effected in the event of the write block in buffer memorg being read again, or else ls read for the last time ; this write isauthorized through the OR gate ESA (Fig.3) connected to the second input of ~he OR gate PVE, in response to a synchronous block read for which S/A="1" or to an asynchronous block read for which the corresponding queue is not empty. It is noted that address ADL is also used as write address of the number (nbm-l). If SIG="0", the number (nbm-1) is equal to -1, and the test circuit re-writes in memory MLC
the number nbm=0 ; this means that the number read nbm was already equal to zero and that thus, no block already written is to be subsequently read in the buffer memory cell with address ADL.
The available cell address memory MAD forms a circuit for memorizing the buffer memory-MT block cell conditions and for deriving free cell addresses ADL. The memory MAD basically includes a matrix of 1024 one-bit cells and a buffer memory cell address encoding circuit.
The cells of the matrix are respectively assigned to the block cells of buffer memory MT and each memorize one availability condition bit of the respective cell of the buffer memory. The condition bit is at high state "1" when the buffer memory cell is free and thus ready to store a data block from an incoming multiplex. The condition bit is at ~0 low state "0" when the cell of the buffer memory is occupied by a written data block which is to be read one or several times contingent on the respective updated number, nbms or nbma, memorized in memory MCL. The encoding circuit in memory MAD is connected to the outputs of all the cells of the matrix so as to select one of the cells of the matrix having a condition bit "1", according to a predetermined cell priority order, and thus permanently derive the address of a free matrix cell selected equal to the write address ade of thc respective block cell of the buffer memory.
The condition bl~s are transmitted to a data input DE of all ~he matrix cells in memory MAD by an inverting output of multiplexer ~E.
The matrix cells are write-addressed by multiplexer MAE whose outputs are connected to 10 wrlte address inputs ACS+ALS of a double column and row decoder of the matrix included in memory MAD. Each write is authorized by a bit "1" applied to a write enabling inpu~ ECR of memory MAD by a two-input OR gate PAE. A first input of OR gate PAE
together with a first input of multiplexer MBE are connected to the output of multiplexer MXsa. A second inpu~ of gate EAL is connected to an output of the A~D gate EAL havlng an inverting input ehat i8 connected to the outpu~ of the OR gate OAL and to a second input of multiplexer MBE, and having a direct input that is connected to the output of OR gate ESA (Fig.3). As already stated, the first ten inputs and the second ten inputs of the write address multiplexer MAE are connected respectively to outputs ACS+ALS of memory MAD and to the outputs of multiplexer MALI (Fig.3).
During a first octet half-period ~/2, when a data block i8 to be written in a free cell of buffer memory MT having address ade supplied by outputs ACS+ALS from memory MAD, whatever the respective number, nbms or nbma, written in memory MLC and hence the output condition of gates OAL and EAL, the first inputs of multiplexer MBE and the write authorization gate PAE receive a bit "1" through multiplexer MXsa, if the number nbms for synchronous block read from memory MCE ls at least equal to 1, or if at least one of the sixteen bits represen~ing the number nbma for asynchronous block read ln memory MTR is at state "1".

~Z~2~

The address ade then addresses the respective cell in the matrix ofmemory MAD via multiplexer MAE to writ~ the new "0" condition bit in this cell, via the first input of multiplexer MBE. Subsequsnt to this write, outputs ACS+ALS deliver a new free cell address for a future data block to be written.
Then as long as the respective number nbms or nbma which is decremented on each read of the data block does not reach zero, the gate EAL remains closed, and no change in the condition bit in the respective matrix cell of memory MAD occurs. In fact gate PAE remains closed, although an address ADL of this cell is applied to the second inputs of m~ltiplexer MAE.
During a second octet clock perlod H/2, when the respective number nbms or nbma read and decremented in circuit DEC reaches zero, subsequent to a last read of the data block, the output of gate OAL
switches to state "0", which opens gate EAL and applies a "1" state bit to input DE of memory MAD via the second input of multiplexer MBE.
This "1" state bit is written in the respective cell of the matrix addressed by address ADL that is transmitted via the second inputs of multiplexer MAE. This write is enabled by the direct input of gate EAL
at state "1" and hence by the second input of gate PAE at state "1", when S/A="l" for a synchronous block, or when the respective queue FSO
to FS15 i8 not empty, which is expressed by FNV="l". The "1" condition bit indicating the non-occupation of the cell having address ADL and ~ust released will not be modified until the selection thereof by the encoding circuit in memory MAD for the write of another data block in buffer memory MT.

92~

Although the above description refers to a hybrid switching system switchlng synchronous and asynchronous blocks, such a system, or a simplified similar system, can be only used to switch synchronous blocks, or else asynchronous blocks, whereas the multiplexes carry synchronous blocks or asynchronous blocks only.
Por a sys~em switching synchronous block only, memory MTR and queues FS0 to FS15 together with associated circuits PA0 to PA15, TR, ~S, MGS, and the circuits having inputs selected by bits s/a and S/A
can be suppressed. Knowing that on average, the memorization time of a synchronous block between its ~ite time triggered by its rank e+DS
and its last read time controlled by address AITS of the corresponding outgoing time interval is less than a half-frame period, the capacity of buffer memory MT can be reduced by half, i.e., (64/2)x16=512 block cells.
For an asynchronous block switching system only, memory MCE and memory MCL2 together with associated multiplexer MA2 and the circuits having inputs selected by bits s/a and S/A can be suppressed. For lengths of address queue having a capacity of 64 10-bit addresses, as this number can be less than the number of blocks per frame in a multiplex, a maximum addressing of (64x16)-1024 asynchronous blocks designed for 16 outgoing multiplexes S0 to S15 during a frame, offers a very low probability. In practice, the capacity of the buffer memory may then be reduced by a factor of at least 4, i.e., a capaci~y of (64/4)x16=256 block cells, whilst preserving a capacity vf 64 10-bit addresses per queue.

5~

Naturally these different reductions in buffer memory capacity are envisaged thanks to the memory cell release process implemented by the buffer memory managing and write addressing circuit CAE (Fig.6).
Finally, according to other embodiments, when the switching system switches synchronous and/or asynchronous data blocks only for point-to-point communicatlons, correspondlng to numbers nbms and nbma always equal to 1, the release memory MLC and associated circuits Ps, Pa, SOM, MNB, MD, PVE, MAEL, DEC, TZ, OAL and EAL are suppressed.

Claims (8)

1 - System for switching data blocks between a plurality of incoming multiplexes and a plurality of outgoing multiplexes, comprising :
input means for detecting data blocks in said incoming multiplexes thereby multiplexing detected blocks into multiplexed blocks, buffer means comprising block cells for memorizing said multiplexed blocks, write addressing means for deriving block cell addresses thereby writing said multiplexed blocks in write addressed block cells, read addressing means for memorizing the addresses of the write addressed block cells and arranging them dependent on addressee outgoing multiplexes to which the written blocks are designed thereby reading and multiplexing the written blocks into read blocks, and means for demultiplexing said read blocks and transmitting them to said addressee outgoing multiplexes, said write addressing means comprising means for selecting the address of one of said block cells in said buffer means which are free when a data block has been detected thereby writing this detected block in said free selected cell, a free cell address selection being established contingent on block cell addresses which are supplied from said read addressing means to said selecting means when memorized blocks are read.
2 - System as defined in claim 1, through which a data block in an incoming multiplex is transmissible to several addressee outgoing multiplexes, and wherein said write addressing means comprises means for indicating numbers of outgoing multiplexes to which data blocks memorized in buffer means cells are still to be transmitted, respectively, said number relating to a cell memorizing a block being equal to a predetermined number of addressee outgoing multiplexes for said block when the block is written in said cell, and being decremented by one unity in response to each read address of said cell supplied from said read addressing means, release of said cell having memorized said block being signalled by said indicating means to said selecting means as soon as said number reaches zero.
3 - System for switching synchronous data blocks and asynchronous data blocks between plural incoming multiplexes and plural outgoing multiplexes, each of said incoming and outgoing multiplexes including frames, each of said frames consisting of a first time interval occupied by a synchronization block and time intervals occupied sporadically by data blocks, said system comprising :
input means for detecting-said data blocks in said frames of said incoming multiplexes and multiplexing detected data blocks into detected and multiplexed blocks, first buffer means for memorizing said detected and multiplexed blocks in first block cells, second buffer means for memorizing said detected and multiplexed blocks in second block cells, output means for multiplexing synchronous and asynchronous blocks memorized in said first and second buffer means and transmitting them contingent on their destinations to said outgoing multiplexes thereby forming said frames in said outgoing multiplexes, write means for deriving block cell addresses thereby writing each of said detected and multiplexed blocks in first and second cells, first read means receiving said addresses of said first cells in which are written said synchronous blocks for reading each of said memorized synchronous blocks, by correspondence between said address of said first cell in which said synchronous block is written and at least an identification number of an outgoing multiplex time interval to be occupied by said synchronous block, and several second read means respectively assigned to said outgoing multiplexes and addressed by said write means, and receiving said addresses of said second cells in which are written and memorized asynchronous blocks for reading each of said memorized asynchronous blocks, by correspondence between the address of the second cell in which said asynchronous block is written and an identification number of addressee outgoing multiplex, and said system being characterized in that said first and second buffer means comprise a single buffer memory having block cells capable of memorizing indifferently synchronous blocks and asynchronous blocks detected and multiplexed, and said write means comprises means for selecting a write address of one of block cells in said buffer memory which are free when a data block has been detected thereby writing this detected block in said selected free cell, a free cell address selection being established contingent on block cell addresses which are supplied from said first and second reading means when memorized synchronous and asynchronous blocks are read in said buffer memory respectively.
4 - System as defined in claim 3, wherein said selecting means includes a circuit having 1-bit cells respectively assigned to said block cells of said buffer memory for memorizing availability conditions, free and busy, of said buffer memory cells thereby permanently deriving an address of the buffer memory free cell address contingent on said free conditions, means for writing said busy condition in a 1-bit cell corresponding to said selected free block cell address as soon as a detected data block is to be written into said buffer memory, said selected free cell address being memorized in said first read means when said data block to be written is a synchronous block, and in said second read means assigned to addressee outgoing multiplexes of said block and addressed by said write means when said data block is an asynchronous block, and means for writing said free condition in a 1-bit cell corresponding to an address of block cell where a data block is read for the last time and which is supplied from said first read means when said read data block is a synchronous block, and from said second read means when said data block read is an asynchronous block,
5 - System as defined in claim 3, wherein said first read means comprises a first memory for memorizing identification numbers of time intervals occupied by said detected data blocks in said incoming multiplexes thereby providing, during a frame period of outgoing multiplexed data blocks from said buffer memory, said time interval identification numbers arranged contingent on identification numbers of time intervals in said outgoing multiplexes to be occupied respectively by said read data blocks, and a second memory in which are written said addresses of buffer memory cells in which are written said asynchronous blocks, contingent on identification numbers of time intervals of these blocks in incoming multiplexes provided by said input means, and in which are read said cell addresses contingent on said identification numbers of the arranged time intervals provided by said first memory.
6 - System as defined in claim 3, through which a data block in an incoming multiplex is transmissible to several addressee outgoing multiplexes, and wherein said write means comprises means for updating numbers of outgoing multiplexes to which data blocks memorized in said buffer memory are still to be transmitted, respectively, said number relating to a buffer memory cell memorizing a data block being equal to a predetermined number of addressee outgoing multiplexes for said block when said block is written in said cell, and being decremented by one unity in response to each read address of said cell supplied from said first read means when said block is a synchronous block, and from said second read means when said block is an asynchronous block, release of said cell having memorized said block being signalled by said updating means to said selecting means as soon as said number reaches zero.
7 - System as defined in claim 6, wherein said updating means comprises a number memory having number cells respectively assigned to said block cells of said buffer memory for memorizing said updated numbers, means for writing said predetermined addressee multiplex number relating to a selected free cell in said buffer memory, when a data block is written in said cell, means for reading said updated number relating to a buffer memory cell in response to the address of this cell supplied from said first read means when a synchronous block is read in said cell and from said second read means when an asynchronous block is read in said cell, means for decrementing said read updated number by one unity in response to the supplied address of said cell, said number being decremented until it reaches zero subsequent to a plurality of decrementations equal to the respective predetermined number, means for writing said read updated number after each of the decrementations in the number cell assigned to said buffer memory cell, and means connected to said decrementing means for indicating to said selecting means the nullity of said updated number thereby releasing said buffer memory cell in which said data block has been read a number of times equal to said respective predetermined number.
8 - System as defined in claim 3, wherein the number of block cells in said buffer memory is less than the product of the number of time intervals in a multiplex frame by the number of said incoming multiplexes.
CA000572071A 1987-07-24 1988-07-14 Hybrid time multiplex switching system with optimized buffer memory Expired - Lifetime CA1292541C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR8710034 1987-07-24
FR8710034A FR2618624B1 (en) 1987-07-24 1987-07-24 HYBRID TIME MULTIPLEX SWITCHING SYSTEM WITH OPTIMIZED BUFFER MEMORY

Publications (1)

Publication Number Publication Date
CA1292541C true CA1292541C (en) 1991-11-26

Family

ID=9353192

Family Applications (1)

Application Number Title Priority Date Filing Date
CA000572071A Expired - Lifetime CA1292541C (en) 1987-07-24 1988-07-14 Hybrid time multiplex switching system with optimized buffer memory

Country Status (12)

Country Link
US (1) US4884264A (en)
EP (1) EP0300876B1 (en)
JP (1) JP2605365B2 (en)
KR (2) KR890003168A (en)
CN (1) CN1013541B (en)
AT (1) ATE81240T1 (en)
AU (1) AU615205B2 (en)
CA (1) CA1292541C (en)
DE (1) DE3875003T2 (en)
ES (1) ES2035337T3 (en)
FI (1) FI97011C (en)
FR (1) FR2618624B1 (en)

Families Citing this family (65)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2865692B2 (en) * 1989-02-22 1999-03-08 株式会社日立製作所 Switching system and configuration method thereof
US5365519A (en) * 1991-03-05 1994-11-15 Hitachi, Ltd. ATM switch1ng system connectable to I/O links having different transmission rates
US6330240B1 (en) 1987-04-24 2001-12-11 Hitachi, Ltd. ATM cell switching system
USRE36751E (en) * 1987-07-15 2000-06-27 Hitachi, Ltd. ATM switching system connectable to I/O links having different transmission rates
USRE36716E (en) * 1987-07-15 2000-05-30 Hitachi, Ltd. Switching system for switching cells having error detection apparatus
FR2623954B1 (en) * 1987-11-27 1993-11-19 Alcatel Cit ELEMENT FOR SWITCHING DATA TRANSMITTED BY ASYNCHRONOUS TIME MULTIPLEXING
US5285445A (en) * 1987-12-17 1994-02-08 U.S. Philips Corporation Switching network and switching network control for a switching node in a wideband transmission system
US5233603A (en) * 1988-04-21 1993-08-03 Nec Corporation Packet switch suitable for integrated circuit implementation
FR2635243B1 (en) * 1988-08-05 1994-01-14 Lmt Radio Professionnelle PACKET SWITCHER FOR ASYNCHRONOUS DATA TRANSFER IN A DIGITAL TRANSMISSION NETWORK
JPH0758963B2 (en) * 1989-01-27 1995-06-21 日本電気株式会社 Cell exchange device
FR2643532B1 (en) * 1989-02-17 1991-05-10 France Etat METHOD FOR RESERVING RATES AND TIME SWITCHES OF ASYNCHRONOUS PACKETS
JP2865706B2 (en) * 1989-05-31 1999-03-08 株式会社日立製作所 Switching system
US5271006A (en) * 1989-07-19 1993-12-14 Hitachi, Ltd. Frame aligner and method and system for control thereof
WO1991002420A1 (en) * 1989-08-09 1991-02-21 Alcatel N.V. Communication switching element and method for transmitting variable length cells
US5475680A (en) * 1989-09-15 1995-12-12 Gpt Limited Asynchronous time division multiplex switching system
CA2028329C (en) * 1989-10-23 2000-01-18 Hideaki Yamanaka Cell exchanging apparatus
US7610452B1 (en) * 1989-10-31 2009-10-27 Canon Kabushiki Kaisha Data processing system wherein data is stored in a memory and an external storage in parallel
FR2660818B1 (en) * 1990-04-06 1992-06-19 France Telecom FRAME SWITCHER FOR ASYNCHRONOUS DIGITAL NETWORK.
US5379295A (en) * 1990-07-31 1995-01-03 Nec Corporation Cross-connect system for asynchronous transfer mode
GB9019340D0 (en) * 1990-09-05 1990-10-17 Plessey Telecomm An asynchronous transfer mode switching arrangement providing broadcast transmission
JPH04137993A (en) * 1990-09-28 1992-05-12 Fujitsu Ltd Sub rate time switch
US5260937A (en) * 1990-10-29 1993-11-09 Dsc Communications Corporation Power conserving technique for a communications terminal time slot interchanger
US5144619A (en) * 1991-01-11 1992-09-01 Northern Telecom Limited Common memory switch for routing data signals comprising ATM and STM cells
FR2674084B1 (en) * 1991-03-13 1993-12-24 Michel Servel DEVICE FOR TRIGGERING MULTIPLE TIMERS.
FR2674648B1 (en) * 1991-03-29 1993-05-28 Majos Jacques CIRCUIT FOR MANAGING NUMBERS OF ACCESS TO LOGICAL RESOURCES.
US5168492A (en) * 1991-04-11 1992-12-01 Northern Telecom Limited Rotating-access ATM-STM packet switch
JPH07112181B2 (en) * 1991-04-18 1995-11-29 松下電器産業株式会社 Data multiplexing circuit
US5361255A (en) * 1991-04-29 1994-11-01 Dsc Communications Corporation Method and apparatus for a high speed asynchronous transfer mode switch
EP0519563A3 (en) * 1991-06-21 1997-08-27 Koninkl Philips Electronics Nv System for converting synchronous time-division-multiplex signals into asynchronous time-division data packets
US5291486A (en) * 1991-08-19 1994-03-01 Sony Corporation Data multiplexing apparatus and multiplexed data demultiplexing apparatus
DE4130317A1 (en) * 1991-09-12 1993-03-18 Standard Elektrik Lorenz Ag METHOD AND DEVICE FOR CONVERTING THE DATA STRUCTURE OF MESSAGES IN A PACKET BROADCASTING SYSTEM
US5535197A (en) * 1991-09-26 1996-07-09 Ipc Information Systems, Inc. Shared buffer switching module
EP0537382A1 (en) * 1991-10-15 1993-04-21 ALCATEL BELL Naamloze Vennootschap Packet transfer control arrangement and related method
US5398235A (en) * 1991-11-15 1995-03-14 Mitsubishi Denki Kabushiki Kaisha Cell exchanging apparatus
US5351243A (en) * 1991-12-27 1994-09-27 Digital Equipment Corporation Monitor for packets on a communications network
GB9200331D0 (en) * 1992-01-08 1992-02-26 Plessey Telecomm Atm/stm switching arrangement
SE9201861L (en) * 1992-06-17 1993-12-20 Ellemtel Utvecklings Ab Circuit-switched selector comprising a switching memory and a control memory
US5504741A (en) * 1993-02-15 1996-04-02 Mitsubishi Denki Kabushiki Kaisha Data queuing apparatus and ATM cell switch based on shifting and searching
FR2711465B1 (en) * 1993-10-20 1996-01-12 Boyer Pierre Input queuing system designed in particular to be connected to the inputs of a spatial type switching matrix without blocking.
US5757801A (en) * 1994-04-19 1998-05-26 Multi-Tech Systems, Inc. Advanced priority statistical multiplexer
US5682386A (en) 1994-04-19 1997-10-28 Multi-Tech Systems, Inc. Data/voice/fax compression multiplexer
EP0685949A3 (en) * 1994-06-03 2002-07-10 Philips Patentverwaltung GmbH Packet transmission system
US5615126A (en) * 1994-08-24 1997-03-25 Lsi Logic Corporation High-speed internal interconnection technique for integrated circuits that reduces the number of signal lines through multiplexing
EP0742976A1 (en) * 1994-12-01 1996-11-20 Koninklijke Philips Electronics N.V. A communication system, a private automatic branch exchange, and a line card
US6493347B2 (en) 1996-12-16 2002-12-10 Juniper Networks, Inc. Memory organization in a switching device
US5960191A (en) * 1997-05-30 1999-09-28 Quickturn Design Systems, Inc. Emulation system with time-multiplexed interconnect
US6404735B1 (en) 1998-04-30 2002-06-11 Nortel Networks Limited Methods and apparatus for distributed control of a multi-class network
US6667956B2 (en) 1998-05-01 2003-12-23 Nortel Networks Limited Multi-class network
US6580721B1 (en) * 1998-08-11 2003-06-17 Nortel Networks Limited Routing and rate control in a universal transfer mode network
US6876678B1 (en) * 1999-02-04 2005-04-05 Cisco Technology, Inc. Time division multiplexing method and apparatus for asynchronous data stream
KR100326711B1 (en) * 1999-06-22 2002-03-12 이계안 Battery for an electromobile
CA2706654C (en) * 2003-02-20 2014-01-28 Nortel Networks Limited Circulating switch
US7602771B1 (en) 2004-12-30 2009-10-13 Nortel Networks Limited Two-dimensional circulating switch
US20090006156A1 (en) * 2007-01-26 2009-01-01 Herbert Dennis Hunt Associating a granting matrix with an analytic platform
JP4688822B2 (en) * 2005-06-15 2011-05-25 パナソニック株式会社 External device access apparatus and system LSI
CN1859051B (en) * 2005-11-04 2011-01-05 华为技术有限公司 Method and system for transmitting time division multiplex service
US8504598B2 (en) 2007-01-26 2013-08-06 Information Resources, Inc. Data perturbation of non-unique values
US9262503B2 (en) 2007-01-26 2016-02-16 Information Resources, Inc. Similarity matching of products based on multiple classification schemes
US8160984B2 (en) 2007-01-26 2012-04-17 Symphonyiri Group, Inc. Similarity matching of a competitor's products
US20090006788A1 (en) * 2007-01-26 2009-01-01 Herbert Dennis Hunt Associating a flexible data hierarchy with an availability condition in a granting matrix
US20090006309A1 (en) 2007-01-26 2009-01-01 Herbert Dennis Hunt Cluster processing of an aggregated dataset
EA019871B1 (en) 2008-06-02 2014-06-30 Филип Моррис Продактс С.А. Smoking article with transparent section
US7916295B2 (en) * 2008-09-03 2011-03-29 Macronix International Co., Ltd. Alignment mark and method of getting position reference for wafer
US9607690B2 (en) 2015-01-19 2017-03-28 Queen's University At Kingston High sum-rate write-once memory
US11637685B2 (en) * 2021-08-31 2023-04-25 Samsung Display Co., Ltd. System and method for transition encoding with flexible word-size

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CH577253A5 (en) * 1974-05-17 1976-06-30 Ibm
FR2513472B2 (en) * 1980-03-20 1986-08-01 Labo Cent Telecommunicat PACKET SWITCH FOR A PACKET SWITCHED NETWORK
FR2526613A1 (en) * 1982-05-10 1983-11-10 Bodros Christian Packet-circuit switch for bidirectional multiplex system - includes buffer memory holding integer number of words for multiplex lines
FR2538976A1 (en) * 1982-12-29 1984-07-06 Servel Michel SYSTEM FOR SWITCHING SYNCHRONOUS PACKETS OF FIXED LENGTH
FR2538984A1 (en) * 1982-12-30 1984-07-06 Devault Michel SWITCH FOR MULTIDEBIT DIGITAL NETWORK WITH ASYNCHRONOUS TIME SWITCH ADAPTED TO VIDEOCOMMUTATIONS
FR2549673B1 (en) * 1983-07-19 1989-06-30 Thomson Csf Mat Tel ELEMENTARY SWITCH FOR AN AUTOSCUTTER USING AN ASYNCHRONOUS MULTIPLEXING TECHNIQUE
IT1159480B (en) * 1983-08-04 1987-02-25 Cselt Centro Studi Lab Telecom VARIABLE BAND DISTRIBUTED SWITCHING NODE WITH DYNAMIC MANAGEMENT OF HYBRID WEFT
GB8328396D0 (en) * 1983-10-24 1983-11-23 British Telecomm Multiprocessor system
GB2162022B (en) * 1984-07-17 1988-03-02 Stc Plc Data transmission system
US4612636A (en) * 1984-12-31 1986-09-16 Northern Telecom Limited Multiple channel depacketizer
FR2611411B1 (en) * 1987-02-27 1989-04-21 Francois Joel HYBRID TIME MULTIPLEX SWITCHING SYSTEM

Also Published As

Publication number Publication date
DE3875003T2 (en) 1993-02-25
FR2618624A1 (en) 1989-01-27
FR2618624B1 (en) 1992-04-30
EP0300876B1 (en) 1992-09-30
FI883434A (en) 1989-01-25
US4884264A (en) 1989-11-28
JP2605365B2 (en) 1997-04-30
KR970007254B1 (en) 1997-05-07
AU1979388A (en) 1989-01-27
KR890003168A (en) 1989-04-13
CN1013541B (en) 1991-08-14
DE3875003D1 (en) 1992-11-05
ES2035337T3 (en) 1993-04-16
FI97011C (en) 1996-09-25
JPH021655A (en) 1990-01-05
EP0300876A1 (en) 1989-01-25
FI883434A0 (en) 1988-07-20
CN1033343A (en) 1989-06-07
ATE81240T1 (en) 1992-10-15
FI97011B (en) 1996-06-14
AU615205B2 (en) 1991-09-26

Similar Documents

Publication Publication Date Title
CA1292541C (en) Hybrid time multiplex switching system with optimized buffer memory
US4926416A (en) Method and facilities for hybrid packet switching
EP0471344B1 (en) Traffic shaping method and circuit
US6463057B1 (en) ATM cell switching system
EP0299473B1 (en) Switching system and method of construction thereof
US5307343A (en) Basic element for the connection network of a fast packet switching node
CA1319184C (en) Buffer queue write pointer control circuit notably for self-channelling packet time-division switching system
US4752777A (en) Delta network of a cross-point switch
CA2038121C (en) Atm exchange with copying capability
EP0195589B1 (en) Switching system for transmission of data
EP1045558B1 (en) Very wide memory TDM switching system
US4821258A (en) Crosspoint circuitry for data packet space division switches
EP0492025B1 (en) High-speed multi-port FIFO buffer circuit
JPH022767A (en) Packet exchanger
JPH06209328A (en) Recovery of correct cell sequence and output device thereof
US4969149A (en) Switching network for a switching system
US6101190A (en) Switching system and method for asynchronous transfer mode exchange for multimedia service
WO2007078824A2 (en) Self-steering clos switch
US4922485A (en) System for changing priority of packets of data
US5721833A (en) Push-out of low priority signals from switch buffers
US20030120894A1 (en) Method of addressing sequential data packets from a plurality of input data line cards for shared memory storage and the like, and novel address generator therefor
JP3500511B2 (en) An input queuing system for connecting to the inputs of a space division switching matrix.
JP2001060967A (en) Packet switch device
US20010028652A1 (en) ATM cell switching system
US5546393A (en) Asynchronous transfer mode data cell routing device for a reverse omega network

Legal Events

Date Code Title Description
MKLA Lapsed