Abstract: The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.

Abstract: The invention concerns a scheduler for sharing a resource comprising a storage unit for storing user deadlines, FIFO storage units, associated each with a first increment value (d(j)) and, for some of them (c(j, i), with a second increment value (d(i)), for storing user-identifiers. The scheduler comprises a management unit selecting one of the FIFO storage units to serve the user designated as next to serve for the resource, recycling his user-identifier, and a recycling decision unit for redirecting, in accordance with conditions, which include a comparison between the second increment value of the FIFO where the user is going and the first increment value from where the user is coming.

Abstract: The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.

Abstract: The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.

Abstract: The invention concerns a scheduler for sharing a resource comprising a storage unit for storing user deadlines, FIFO storage units, associated each with a first increment value (d(j)) and, for some of them (c(j, i), with a second increment value (d(i)), for storing user-identifiers. The scheduler comprises a management unit selecting one of the FIFO storage units to serve the user designated as next to serve for the resource, recycling his user-identifier, and a recycling decision unit for redirecting, in accordance with conditions, which include a comparison between the second increment value of the FIFO where the user is going and the first increment value from where the user is coming.

Abstract: The device comprises a memory (3) for storing several user share parameters and several amounts capable of advancing. A decision means (6) allocates a chosen service slice of the resource to a user selected as possessing the least advanced amount. It subsequently advances his amount according to a chosen increment. A memory link means (5) defines user queues of “FIFO” type, such that the user having the least advanced amount in a queue appears at the head of this queue. According to the invention, the memory (3) stores a limited number of values of increments. The memory link means (5) associates one of these values of increments with each user and allocates an increment value to each queue.

Abstract: A communication assembly is disclosed which is constituted by at least two nodes (A, B, C, D), the nodes (A, B, C, D) each being equipped with at least one port (1 to 3 of A, B, C, D), the ports belonging to distinct nodes (A, B, C, D) being connected by links (a, b, c, d, e, f). When the links or nodes are out of working order, one or more operational networks are constituted whose links connect the nodes in working order and do not bring about loops. The ports are divided in fixed ports (1, 2, 3 of A), in variable ports which are do are dominant (2, 3 of B; 2 of D), and in variable ports which are not dominant (1 of B; 1, 2, 3 of C; 1, 3 of D) laid out in a specific manner one with respect to the other.

Abstract: The invention concerns a network for communication between user equipments for the transfer of messages emitted by each user equipment to all the other user equipment. The network according to the invention has a tree-structured configuration (1-25) and operates with emission authorizations or tokens.