Abstract: A control method is provided for controlling a load state of a physical link between two physical network nodes in a physical network. A physical link carries a plurality of virtual links, and a virtual link connects together two virtual nodes belonging to a virtual network. First and second metrics are associated with the virtual link. The control method includes the following steps implemented by one of the two physical network nodes: a step of detecting a load state of a physical link; a step of identifying a virtual link for which a present metric is the first metric; and a step of sending a command to the virtual node carried by the physical node and to which the identified virtual link is connected, the command requesting a modification of the present metric from the first metric to the second metric for the virtual link.

Abstract: A control method is provided for controlling a load state of a physical link between two physical network nodes in a physical network. A physical link carries a plurality of virtual links, and a virtual link connects together two virtual nodes belonging to a virtual network. First and second metrics are associated with the virtual link. The control method includes the following steps implemented by one of the two physical network nodes: a step of detecting a load state of a physical link; a step of identifying a virtual link for which a present metric is the first metric; and a step of sending a command to the virtual node carried by the physical node and to which the identified virtual link is connected, the command requesting a modification of the present metric from the first metric to the second metric for the virtual link.

Abstract: A technique is provided for delivering content to a user. The user sends at least one quality indicator to a first content-delivery device, referred to as a secondary device. The indicator relates to delivery of a portion of the content by a second content-delivery device, referred to as a primary device. When the secondary device detects an event that might affect the delivery of the content by the primary device to the user, on the basis at least of the quality indicators relating to at least a delivery of content by the primary device, it commands the user to transfer from the primary device to the secondary device in order to enable the secondary device to deliver portions of the content that have not been delivered by the primary device.

Abstract: A method for determination of topology of virtual networks comprises the following steps implemented by a physical node, physical nodes being connected by a physical network and designed to support virtual nodes of these virtual networks: determination of resource parameters defining a physical configuration of the physical network and a physical configuration specific to the physical node and determination of request parameters defining service requests relating to the virtual networks. The method further comprises, in the case of modification of at least one parameter belonging to the group comprising the resource parameters and the request parameters between a current point in time and a preceding point in time, the broadcast of at least the modified parameters within the physical network, the updating of the resource and request parameters as a function of the modified parameters and the determination of topologies for the virtual networks by means of the updated parameters.

Abstract: The invention relates to a tri-type memory device comprising a compression mechanism. According to the invention, the memory stores binary patterns that are associated with respective references. Data chains are analyzed by successive section of K bits (K>1) in order to extract one of the references when there is a match with a stored binary pattern associated with said reference. The memory is organized into several successive memory cell states, the analysis of the (i+1)-th section of a chain providing access to a cell of stage i?0. Each non-empty cell of a stage i?0 contains one of the following: a register-type analysis tracking pointer designating a register of 2K cells of stage i+1; a linear-type analysis tracking pointer designating a zone of one or two cells forming a reduced register of stage i+1; or a reference associated with a stored binary pattern.

Abstract: The invention relates to a tri-type memory device comprising a compression mechanism. According to the invention, the memory stores binary patterns that are associated with respective references. Data chains are analyzed by successive section of K bits (K>1) in order to extract one of the references when there is a match with a stored binary pattern associated with said reference. The memory is organized into several successive memory cell states, the analysis of the (i+1)-th section of a chain providing access to a cell of stage i?0. Each non-empty cell of a stage i?0 contains one of the following: a register-type analysis tracking pointer designating a register of 2K cells of stage i+1; a linear-type analysis tracking pointer designating a zone of one or two cells forming a reduced register of stage i+1; or a reference associated with a stored binary pattern.

Abstract: A Trie-type associative memory is used for an analysis of binary strings situated at defined locations of data packets. An analysis tree is established, which comprises stages associated with the locations, and paths each arriving at an action attributed on the basis of the values of the binary strings read from a data packet. The tree is then transcribed into the Trie memory.

Abstract: Different portions of a header of each packet containing protocol data are analyzed in succession from different gate registers of the TRIE memory. As a packet arrives, its header is stored in a buffer memory and a first portion of the stored header is analyzed. Each analysis of a portion of header produces either the forwarding reference associated with the packet or an intermediate reference containing a first code, making it possible to locate at an arbitrary location of the buffer memory a next portion to be analyzed, and a second code, making it possible to locate at an arbitrary location of the TRIE memory a gate register from which this next portion is to be analyzed. Having analyzed the first portion of a stored header, the subsequent portions thereof are analyzed in accordance with the first and second codes contained in the intermediate references produced in succession until the forwarding reference is produced.

Abstract: A Trie-type associative memory is used for an analysis of binary strings situated at defined locations of data packets. An analysis tree is established, which comprises stages associated with the locations, and paths each arriving at an action attributed on the basis of the values of the binary strings read from a data packet. The tree is then transcribed into the Trie memory.

Abstract: An associative memory of the TRIE type is organised in the form of registers of 2K cells having a portal register from which binary strings are analyzed in successive slices of K bits. Each non-empty cell contains either a pointer or a reference. This reference is issued after the analysis has followed a path formed by the cells designated by the successive slices of K bits in the registers designated by the pointers encountered in these cells in succession. The data is stored in the TRIE memory in response to commands to insert and delete binary patterns of variable length, each associated with a reference, so that when a bit string is analyzed, the reference issued is that associated with the longest of the binary patterns coinciding with the start of the string being analyzed.