Method and System for Positioning a Node
OwnerBuddy Njereinventor
Life of this patent
Estimating the term…
Abstract
The present invention relates to a method for re-positioning a node in a queue, wherein the queue comprises a plurality of nodes, and wherein the method comprises receiving, from the node, a request for re-positioning, and allocating each of a plurality of resources to at least some of the plurality of nodes. The present invention also relates to a system for performing the method and to a corresponding computer program product.
Claims15
A method for re-positioning a node in a queue, wherein the queue comprises a plurality of nodes, and wherein the method comprises:
- receiving, from the node, a request for re-positioning, and
- allocating each of a plurality of resources to at least some of the plurality of nodes.
The method according to the preceding claim, wherein each of the plurality of nodes in the queue is associated with a position, wherein the position relates, at least in part, to an order in which each of the plurality of resources is to be allocated to each of the plurality of nodes.
The method according to the preceding claim, wherein the plurality of nodes comprises a node associated with a first position, wherein the node associated with the first position corresponds to a node to which a next of the plurality of resources is allocated, wherein re-positioning the node comprises associating the first position with the re-positioned node, corresponding to the re-positioned node becoming the node to which the next of the plurality of resources is allocated.
The method according to any of the preceding claims, wherein the request comprises a value, wherein re-positioning the node is based, at least in part, on the value.
The method according to any of the preceding claims, wherein the method comprises determining if the request satisfies a re-positioning condition, wherein a result of the determination if the request satisfies a re-positioning condition corresponds to one of success or failure, wherein the method comprises, in response to the result of the determination if the request satisfies a re-positioning condition being success, re-positioning the node.
The method according to any of the 2 preceding claims, wherein the allocation threshold comprises a dynamic threshold, wherein the allocation threshold is configured to vary based, at least in part, on a number of resources yet to be allocated and/or wherein the allocation threshold is configured to vary based, at least in part, on a number of nodes in the queue.
A system for re-positioning a node in a queue, wherein the queue comprises a plurality of nodes, and wherein the system is configured to:
- receive, from the node, a request for re-positioning, and
- to allocate each of a plurality of resources to at least some of the plurality of nodes.
The system according to the preceding claim, wherein the system comprises:
- a communication component configured to receive the request, and
- a data processing component,
- wherein the communication component is configured to communicate with the data processing component.
The system according to the preceding claim, wherein the system, particularly the data processing component thereof, is configured to determine if the request satisfies a re-positioning condition.
The system according to any of the 3 preceding claims, wherein the system is configured to receive a plurality of requests, wherein each of the plurality of requests is received from one of the plurality of nodes.
The system according to any of the 4 preceding claims, wherein the system comprises any of:
- a queue capturing component configured to determine a length of the queue at any moment of time,
- a resource capturing component, wherein the resource capturing component is configured to determine a number of resources yet to be allocated at any moment of time, and
- a code scanning component configured to scan a readable code.
Dependencies are inferred from the claim text.