Abstract: In an asynchronous switching node, n1 input modules and n2 output modules are interconnected by an asynchronous cell switching network. The network routes a cell transmitted by an input module to an output module, in the case of a cell of a unicast flow; the network routes a cell transmitted by an input module to N output modules in the case of a cell of a multicast flow, by generating itself the N copied cells from the transmitted cell. A flow control mechanism is designed to share the bandwidth available for each pair of an input module and an output module, based on the bandwidth requests of unicast flows for each module pair. In each input module, the bandwidth request of each individual multicast flow is converted into N bandwidth requests associated with N equivalent virtual unicast flows associated with this multicast flow.

Abstract: A method is provided for mutually transferring control parameters between terminal modules interconnected by a data communications network. “Information” control parameters are transferred from “source” terminal modules to “destination” terminal modules using dedicated information messages; and “response” parameters are optionally transferred in return from the destination terminal modules to the source terminal modules, likewise using dedicated response messages. The mutual transfers of information messages between terminal modules should take place via distributed functions referred to as “distributed intermediate functions” for processing messages. Each of these functions is allocated to a set of destination terminal modules and to a set of source terminal modules.

Abstract: The invention relates to a method of controlling the service time of copied multicast cells in input modules of an asynchronous switching node. To minimize the time necessary to command the departure of all of N copied unicast cells, a queue (Qt) is chosen in the input module as a reference queue in which the service time (SDTref) of one of the N copied unicast cells is controlled and in the N—1 other queues a service time is selected closest to the service time instant of the reference queue.

Abstract: The invention relates to a method of controlling the service time of unicast cells and multicast cells in input modules of an asynchronous switching node which comprises n1 input modules and n2 output modules. The multicast cell are copied in the network between the input and the output modules. The service time (SDTm) of a multicast cell is controlled in the input module in such a way that the time is chosen in a reference queue (Qr) and is close to that time in the other queues (Qs, Qt).

Abstract: A system for determining an order of service of temporarily stored objects, at least one priority flag being attached to certain objects, includes a set of storage units disposed in a matrix organized into C subsets of elements, where C is the number of objects stored temporarily. Each subset corresponds to an object and all the subsets include the same number P of elements corresponding to P time positions. Each element includes a memory which can receive at least one time priority flag. A first time position selector determines, within the matrix, and from all the subsets, the element(s) marked by a particular time priority flag and corresponding to the time position having the lowest value.

Abstract: The invention relates to a system for asynchronously switching cells, each cell comprising a header field and a data field. At least some of the input modules comprise composite cell forming means, serving in particular to enable channel data blocks to be constructed each comprising a channel data to be transmitted indication extracted from the channel data received and at least one synchronous channel identifier associated with said channel data to be transmitted indication, and means for selectively multiplexing channel data blocks intended for a common destination, in the data field of at least one composite cell. At least some of said output modules comprise means for processing said composite cells, comprising means for extracting and recognizing said received channel data blocks by means of said associated synchronous channel identifiers, and means for transmitting to at least one outgoing link the channel data belonging to the various channels.

Abstract: In an asynchronous switching node, n1 input modules and n2 output modules are interconnected by an asynchronous cell switching network. The network routes a cell transmitted by an input module to an output module, in the case of a cell of a unicast flow; the network routes a cell transmitted by an input module to N output modules in the case of a cell of a multicast flow, by generating itself the N copied cells from the transmitted cell. A flow control mechanism is designed to share the bandwidth available for each pair of an input module and an output module, based on the bandwidth requests of unicast flows for each module pair. In each input module, the bandwidth request of each individual multicast flow is converted into N bandwidth requests associated with N equivalent virtual unicast flows associated with this multicast flow.

Abstract: The shared buffer control device can be used in a packet or cell switching unit having n1 inputs and n2 outputs and a shared buffer means for storing blocks of data from inputs. The blocks of data are extracted in order and directed to at least one output. The blocks of data are stored in and extracted from the buffer means in periodic cycles, each cycle including time slots in which a block of data received at an input can be stored in memory and a block of data previously store in memory can be extracted to a particular output. The shared buffer includes a plurality of shared sub-buffers which are controlled so that during at least some time slots the writing of a block of input data and the extraction to an output, or reading of a block of data are effected simultaneously in different shared sub-buffers.

Abstract: The invention relates to a method of mutually transferring control parameters between terminal modules interconnected by a data communications network. “Information” control parameters are transferred from “source” terminal modules to “destination” terminal modules using dedicated information messages; and “response” parameters are optionally transferred in return from said destination terminal modules to said source terminal modules, likewise using dedicated response messages. The invention proposes that the mutual transfers of information messages between terminal modules should take place via distributed functions referred to as “distributed intermediate functions” for processing messages. Each of these functions is allocated to a set of destination terminal modules and to a set of source terminal modules.

Abstract: The invention relates to a system for asynchronously switching cells, each cell comprising a header field and a data field. At least some of the input modules comprise composite cell forming means, serving in particular to enable channel data blocks to be constructed each comprising a channel to be transmitted indication extracted from the channel data received and at least one synchronous channel identifier associated with said channel to be transmitted indication, and means for selectively multiplexing channel data blocks intended for a common destination, in the data field of at least one composite cell. At least some of said output modules comprise means for processing said composite cells, comprising means for extracting and recognizing said received channel data blocks by means of said associated synchronous channel identifiers, and means for transmitting to at least one outgoing link the channel data belonging to the various channels.

Abstract: The management system is associated with a buffer memory used to store data blocks (BD), each BD belonging to a given category. In addition to operations of receiving and servicing the BD, the system controls premature elimination of a given BD or of a BD belonging to a given category, freeing of its location in the buffer memory and temporary preservation of its associated block identifier to prevent any rearrangement of the time relations between blocks. Category marking management units and BDs cleared for elimination management unit store, for each BD, the category to which it belongs and, for each category, the list of the BDs cleared for elimination belonging to that category.

Abstract: The invention relates to a method of controlling the service time of copied multicast cells in input modules of an asynchronous switching node.

Abstract: The invention relates to a method of controlling the service time of unicast cells and multicast cells in input modules of an asynchronous switching node which comprises n1 input modules and n2 output modules.

Abstract: The management system is associated with a buffer memory used to store data blocks (BD), each BD belonging to a given category. In addition to operations of receiving and servicing said BD, the system controls premature elimination of a given BD or of a BD belonging to a given category, freeing of its location in the buffer memory and temporary preservation of its associated block identifier to prevent any rearrangement of the time relations between blocks.

Abstract: For any pair of two distinct objects (i, j) and for each relationship that may exist between said two objects, the management apparatus includes a memory element RMP(i,j) for storing either the existence or the non-existence of said relationship. This memory element includes an input corresponding to a first object (i) and an input corresponding to a second object (j), which inputs are connected to two individual buses (CC(j), LC(i)) corresponding respectively to said two objects. These two inputs must receive two respective control signals simultaneously in order to write information in said element indicating either the existence or the non-existence of a relationship between these two objects.

Abstract: The addresses of an irregular group of outputs of an asynchronous switching node distributing cells dynamically to outputs constituting an irregular group cannot be related by any mathematical relationship. To distribute cells applied to inputs of the node as regularly as possible, the node includes translator circuits determining at the network input an internal routing label which identifies a regular subgroup of outputs, each of which may consist of only one output. To this end it uses an algorithm dependent on the rank of the input receiving the cell and the time at which the cell is received. This algorithm therefore achieves spatial decorrelation and temporal decorrelation of the cells. The asynchronous switching node can be used in ATM telecommunication networks, for example.

Abstract: Data is sent over a transmission link in consecutive variable length blocks in asynchronous transfer mode. Each block is either a data block if it contains data or an empty block if it does not. Each data block includes a header sub-block of a first type containing service data and at least one data sub-block of a second type containing data. Each empty block includes an empty sub-block of a third type. The sub-blocks of one of the three sub-block types have a length different from the respective lengths of the sub-blocks of the other two types.

Abstract: This system stores data blocks each comprising one or more data elements. It comprises a plurality of queues serving to interlink the data blocks in order to transfer them selectively to individual outlets that may belong to separate destinations and a management logic for these queues. There is a queue specific to each outgoing destination. A queue management logic comprises data block selection (OSQRCL) acting when a queued data block must be assigned to an individual outlet, which comprise (OQSC, OQPS, OQIC) identifying a queue of an outgoing destination to which this outlet belongs, by obtaining the address of a data block and assigning the selected data to the outlet in question (YJS) by initiating the transfer of this data block to this individual outlet (NCO).

Abstract: A novel packet-oriented multiple path self-routing switching network for switching asynchronous time-division multiplexed packets is characterized in that each switch unit of at least one upstream stage of the switching network includes means for defining an available state in which the downstream switch unit is available for routing packet traffic and for transmitting availability status information to upstream switch units when the downstream switch unit is in that available state, and is further characterized in that each upstream switch unit includes means for receiving availability status information for those outputs leading to a switch unit in the available state, and for prohibiting access to any output for which such availability status information is not received.

Abstract: A multiple path, self-routing switching network for switching asynchronous time division multiplex data cells includes input ports (pi1, pi64 . . . ), output ports (po1, po64 . . . ) and switching elements (TSi1, TSi16 . . . ) arranged in a number of stages of interconnected switching elements, each switching element having inlets and outlets and being constructed to transfer a data cell received at one of its inlets, to one or more of its outlets, according to routing data associated with said cells. Each switching element of at least one stage of the network has at least three outlets, arranged in groups of outlets of one or more determined outlets. Using routing data associated with a data cell received at any one of its inlets, the switching element (TSi1, TSi16 . . . ) identifies a set of one or more of said groups of outlets and to transfer said received cell to an outlet of each group of outlets of the selected set.