Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
SYSTEM AND METHOD FOR UNIFORM ALLOCATION OF RESOURCES AMONGST A PLURALITY OF RECIPIENTS
Document Type and Number:
WIPO Patent Application WO/2022/064520
Kind Code:
A1
Abstract:
The present invention relates to a system (100) and method for a micro-rewards distribution system. a method of uniform allocation of resources amongst a plurality of recipients, the method comprising positioning a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle, and shifting positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle. The invention also discloses a system (100) for uniform allocation of resources amongst a plurality of recipients, the system (100) comprising a processor (101) and a memory (108) coupled with the processor (101), wherein the memory (108) stores programmed instructions executed by the processor (101) to position a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle and shift positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

Inventors:
VERMA DEEPTESH (IN)
Application Number:
PCT/IN2021/050930
Publication Date:
March 31, 2022
Filing Date:
September 22, 2021
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
VERMA DEEPTESH (IN)
International Classes:
G06Q30/02; G06Q10/06
Foreign References:
JP2008090804A2008-04-17
Attorney, Agent or Firm:
MENEZES, Shalini Sitaraman (IN)
Download PDF:
Claims:
Claims:

1. A method of uniform allocation of resources amongst a plurality of recipients, the method comprising: positioning a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle; and shifting positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

2. The method as claimed in claim 1 , wherein the resources are rewards associated with referral of a product or a service and the plurality of recipients are users associated with referral of the product or the service.

3. The method as claimed in claim 1, wherein each node of the plurality of nodes are moved in a clockwise or an anti-clockwise manner.

4. The method as claimed in claim 1 , wherein the predefined number of steps range from one to n-1, wherein n denotes number of the vertices.

5. The method as claimed in claim 1, wherein after positioning three nodes at the vertices of the triangle, a new base is added to position new nodes, and a maximum number of the new nodes positioned at the new base is 1+L, and wherein L denotes a level of the new base.

6. The method as claimed in claim 5, wherein the positions of the nodes positioned into one or more levels completely occupied with nodes are shifted.

7. A system (100) for uniform allocation of resources amongst a plurality of recipients, the system comprising: a processor (101); and a memory (108) coupled with the processor (101), wherein the memory(108) stores programmed instructions executed by the processor (101) to: position a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle; and shift positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

8. The system (100) as claimed in claim 7, wherein the resources are rewards associated with referral of a product or a service and the plurality of recipients are users associated with referral of the product or the service.

9. The system (100) as claimed in claim 7, wherein each node of the plurality of nodes are moved in a clockwise or an anti-clockwise manner.

10. The system (100) as claimed in claim 7, wherein the predefined number of steps range from one to n-1, wherein n denotes number of the vertices.

11. The system (100) as claimed in claim 7, wherein after positioning three nodes at the vertices of the triangle, a new base is added to position new nodes, and a maximum number of the new nodes positioned at the new base is 1+L, and wherein L denotes a level of the new base.

12. The system (100) as claimed in claim 11, wherein the positions of the nodes positioned into one or more levels completely occupied with nodes are shifted.

Dated this 22nd day of September 2021

Description:
System And Method For Uniform Allocation Of Resources Amongst A Plurality Of Recipients

CROSS-REFERENCE TO RELATED APPLICATIONS AND PRIORITY

[001] The present application claims priority from Indian provisional specification number 202021041327 dated September 23 rd 2020.

Description

TECHNICAL FIELD

[002] The present invention relates to resource allocation. More particularly invention relates to a computer implemented system and method for distribution of resources in a given system.

BACKGROUND OF THE INVENTION

[003] Allocation of resources is an important feature of any multi-user platform. Any computing and business environment uses one or more forms of resource allocation. Allocation of CPU time, hard disk space, memory space such as RAM is a common feature of computing environment.

[004] To attract more customers, many businesses generate rewards in the form of customer reward or loyalty points. Any purchases made at these businesses are then awarded to the user periodically. Bonus points may additionally be accumulated based on the user's actions in response to offers made by the business.

[005] Thus resource allocation is of prime importance- be it in cloud computing, memory space or allocation of loyalty and bonus points to capture a customer set. Conventional examples of resource allocation in the computer industry are commands given in operating systems to manually allocate resources such as the RAM. For manual allocation the user must keep track of the total available RAM space at any given point of time and compute the allocation before manually allocating it.

[006] Portions of hard disk space can also be allocated manually. However the problem remains the same i.e. the user must keep track of the space allotted to one system and accordingly reduce the total disk space available or adjust it against the disk space allotted to other systems.

[007] Resource allocation also includes physical resources such as loyalty points.

Traditionally existing customer reward and loyalty programs are of two types- customer reward points and MLM (multilevel marketing scheme).

[008] Customer reward points are extremely straightforward. A customer who is registered under the loyalty program with a business, purchases goods or services and gets a percentage of the purchase price as reward points which can be redeemed at a later date.

[009] For example, a customer registered under the loyalty program purchases a flight ticket gets “loyalty” miles added to his account which is a percentage of the cost of the flight ticket. Once sufficient “loyalty miles” are accumulated, the client may exchange it for a ticket- in whole or in part.

[010] The second prevalent method is MLM (multilevel marketing) scheme. MLM, also called pyramid/network/referral marketing has been around for a long time. The common feature of MLM is that the compensation plans stems from only two potential revenue streams- one from the commission of sales made by the participants directly to their retail customers and the second from commission based on the wholesale purchases made by other distributors below the participant who recruit those other participants into the MLM.

[Oi l] MLM salespeople are, therefore, expected to sell products directly to end-user retail consumers by means of relationship referrals and word of mouth marketing, but most importantly they are incentivized to recruit others to join the company’s distribution chain as fellow salespeople so that these can become down line distributors.

[012] In the first case, the method of awarding the customer reward points is a direct function of the revenue generated from the customer for that particular business. In the second case, the maximum reward points is garnered by the person at the top of the pyramid from ali the customers in the pyramid structure beneath him. The customers at the bottom of the pyramid do not have much incentive to recruit others as the majority of prospective customers in that geographical area have already been recruited leading to lesser revenue for the person at the bottom of the pyramid structure.

[013] Existing methods for allocation of resources in terms of computer resources discloses displaying a representation of a portion of the resource that is allocated to an existing process on a display and, in response to manipulating the representation, dynamically changing the proportion of the others.

[0014] Current art involves methods that are time-consuming, error prone and cumbersome. What is lacking in the art is a method and system of allocating resources in a pyramid structure such that not just the user at the top of the pyramid but ail the users at bottom of the pyramid and levels in between benefit from the resources allocated.

SUMMARY OF THE INVENTION

[0015] The present disclosure relates to a system (100) and method for uniform allocation of resources amongst a plurality of recipients. In particular the present invention discloses a method of uniform allocation of resources amongst a plurality of recipients, the method comprising of positioning a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle, shifting positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

[016] The present invention further discloses a system (100) for uniform allocation of resources amongst a plurality of recipients, the system comprising a processor (104) and a memory (108) coupled with the processor (101), wherein the memory (108) stores programmed instructions executed by the processor (101) to position a plurality of nodes corresponding to the plurality of recipients at vertices and along a base of a triangle and shift positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

DESCRIPTION OF FIGURES

[017] The foregoing summary, as well as the following detailed description of preferred embodiments, are better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there is shown in the drawings exemplary constructions of the invention; however, the invention is not limited to the specific methods and system disclosed. In the drawings:

[018] Fig. 1 illustrates a network implementation of a system (100) for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

[019] Fig. 2 illustrates a block diagram of the system architecture for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

[020] Fig. 3 illustrates a user network in a system for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

[021] Fig. 4a illustrates a triangle of users in a system for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

[022] Fig. 4b illustrates the same set of users rotated clockwise and counter clockwise in a system for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

[023] Fig. 5 illustrates an added level of users in a system for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure. [024] Fig. 6 illustrates an added level of users rotated around in a system for uniform allocation of resources amongst a plurality of recipients in accordance with an embodiment of the disclosure.

DETAILED DESCRIPTION

[025] Some embodiments of this disclosure, illustrating all its features, will now be discussed in detail. The words "comprising," "having," "containing," and "including," and other forms thereof, are intended to be equivalent in meaning and be open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items. It must also be noted that as used herein and in the appended claims, the singular forms "a," "an," and "the" include plural references unless the context clearly dictates otherwise.

[026] V arious modifications to the embodiment will be readily apparent to those skilled in the art and the generic principles herein may be applied to other embodiments of a system and method for uniform allocation of resources amongst a plurality of recipients. However, one with ordinary skill in the art will readily recognize that the disclosure for the present invention is not intended to be limited to the embodiments described, but is to be accorded the widest scope consistent with the principles and features described herein.

[027] The techniques described herein may be implemented in one or more computer programs executing on (or executable by) a programmable computer including any combination of any number of the following: a processor, a storage medium readable and/or writable by the processor (including, for example, volatile and non-volatile memory and/or storage elements), plurality of input units, and plurality of output devices. Program code may be applied to input entered using any of the plurality of input units to perform the functions described and to generate an output displayed upon any of the plurality of output devices.

[028] Each computer program within the scope of the claims below may be implemented in any programming language, such as assembly language, machine language, a high-level procedural programming language, or an object-oriented programming language. The programming language may, for example, be a compiled or interpreted programming language. Each such computer program may be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a computer processor.

[029] Method steps of the invention may be performed by one or more computer processors executing a program tangibly embodied on a computer -readable medium to perform functions of the invention by operating on input and generating output. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, the processor receives (reads) instructions and data from a memory (such as a read-only memory and/or a random access memory) and writes (stores) instructions and data to the memory. Storage devices suitable for tangibly embodying computer program instructions and data include, for example, all forms of non-volatile memory, such as semiconductor memory devices, including EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROMs. Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (application-specific integrated circuits) or FPGAs (Field-Programmable Gate Arrays). A computer can generally also receive (read) programs and data from, and write (store) programs and data to, a non -transitory computer-readable storage medium such as an internal disk (not shown) or a removable disk.

[030] Although the present disclosure is explained considering that the system (100) is implemented on a server, it may be understood that the system (100) may also be implemented in a variety of computing systems, such as a laptop computer, a desktop computer, a notebook, a workstation, a mainframe computer, a server, a network server, a cloud-based computing environment as shown in Fig. 1. It will be understood that the system (100) may be accessed by multiple users through one or more user devices 102-1, 102-2... 102-N, collectively referred to as user devices (102) hereinafter, or applications residing on the user devices 102. In one implementation, the system (100) may comprise the cloud-based computing environment in which a user may operate individual computing systems configured to execute remotely located applications. Examples of the user devices (102) may include, but are not limited to, a portable computer, a personal digital assistant, a handheld device, and a workstation. The user devices (102) are communicatively coupled to the system (100) through a network (103).

[031] The present disclosure relates to a system and method for uniform allocation of resources amongst a plurality of recipients.

[032] A network implementation of a system (100) system and method for uniform allocation of resources amongst a plurality of recipients is shown in Fig. 1 and Fig. 2 according to an embodiment of the disclosure. The system (100) is configured such that each node has exactly two directly connected base/child nodes. The system (100) discloses one common User Network Triangle for the entire resource allocation user base. The users are slotted into the triangle based on registration date/time/serial number or other parameter. In the same embodiment, based on the number of levels, user nodes/bases are varied. The level number and count of users at that level are the same. E.g. Level 4 has 4 users, Level 10 has 10 users. Once a level is filled to its maximum capacity the next user node is entered in the incremental level. Until a level is filled to its maximum capacity, the level above it (which is considered to be complete) will be considered for rotation.

[033] Referring to Eig. 2, according to an embodiment of the disclosure, the system (100) comprises a User (102), a server (104) comprising of an application server (105), a database server (106) and a backup server (110), a user interface (109), memory (108) and a processor (101).

[034] The user interface (109) may include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like. The I/O interface user may allow the system (100) to interact with the user directly or through the client devices 102. Eurther, the user interface (109) may enable the system (100) to communicate with other computing devices, such as web servers and external data servers (not shown). The user interface (109) can facilitate multiple communications within a wide variety of networks and protocol types, including wired networks, for example, LAN, cable, etc., and wireless networks, such as WLAN, cellular, or satellite. The user interface (109) may include one or more ports for connecting a number of devices including assistive technology devices or adaptive products used by people with disability to one another or to another server.

[035] The memory (108) may include any computer-readable medium and computer program product known in the art including, for example, volatile memory, such as static random access memory (SRAM) and dynamic random access memory (DRAM), and/or non-volatile memory, such as read only memory (ROM), erasable programmable ROM, flash memories, hard disks, optical disks, and magnetic tapes.

[036] In the same embodiment of system and method for uniform allocation of resources amongst a plurality of recipients, while rotating the user network shown in Figure 3, only 2 nodes/bases are seen in level 3 and the triangle is not complete resulting in rotation only for user triangle up to level 2 being considered. The tree up to the completed level of rotation is called an earning triangle. The rotation always occurs in the clockwise or anticlockwise or both directions, starting from the first node of the highest complete level.

[0037] In the principal embodiment a method for uniform allocation of resources amongst a plurality of recipients is disclosed wherein the method comprises positioning a plurality of nodes corresponding to the plurality of recipients at vertices and along sides of a triangle, shifting positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

[038] In another embodiment, the method for uniform allocation of resources amongst a plurality of recipients discloses that resources are rewards associated with referral of a product or a service and the plurality of recipients are users associated with referral of the product or the service.

[039] In yet another embodiment, the method for uniform allocation of resources amongst a plurality of recipients discloses each node of the plurality of nodes are moved in a clockwise or an anti-clockwise manner.

[040] In another embodiment the method for uniform allocation of resources amongst a plurality of recipients is disclosed, wherein the predefined number of steps range from one to n-1, wherein n denotes number of the vertices.

[041] In yet another embodiment, the method for uniform allocation of resources amongst a plurality of recipients is disclosed wherein after positioning three nodes at the vertices of the triangle, a new base is added to position new nodes, and a maximum number of the new nodes positioned at the new base is 1+L, and wherein L denotes a level of the new base.

[042] In another embodiment the method for uniform allocation of resources amongst a plurality of recipients is disclosed, wherein the positions of the nodes positioned into one or more levels completely occupied with nodes are shifted.

[043] In a principal embodiment a system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein the system (100) comprises of a processor (101), and a memory (108) coupled with the processor (101), wherein the memory (108) stores programmed instructions executed by the processor (101) to position a plurality of nodes corresponding to the plurality of recipients at vertices and along sides of a triangle and to shift positions of the plurality of nodes by moving each node of the plurality of nodes by a predefined number of steps after a predefined time period, wherein a node positioned at an apex of the triangle receives a resource allocated to itself and resources allocated to other nodes present at one or more bases of the triangle.

[044] In one embodiment the system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein the resources are rewards associated with referral of a product or a service and the plurality of recipients are users associated with referral of the product or the service.

[045] In another embodiment the system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein each node of the plurality of nodes are moved in a clockwise or an anti-clockwise manner.

[046] In another embodiment the system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein the predefined number of steps range from one to n-1, wherein n denotes number of the vertices.

[047] In yet another embodiment the system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein after positioning three nodes at the vertices of the triangle, a new base is added to position new nodes, and a maximum number of the new nodes positioned at the new base is 1+L, and wherein L denotes a level of the new base.

[048] In another embodiment the system for uniform allocation of resources amongst a plurality of recipients is disclosed wherein the positions of the nodes positioned into one or more levels completely occupied with nodes are shifted.

[049] In another embodiment of the invention these rotated triangles (Fig 4a) will be considered for resource allocated to a user node. The same triangle is considered for next rotation, till anew maximum level is filled in the original user network. (Fig.4b)

[050] In another embodiment of the invention, (Fig. 5 and 6) on the next rotation a new maximum level is obtained, which would change the rotation scheme and refer to the original one instead of the old rotated one.

[051] In one embodiment, a reward of a user node would be calculated by considering the last rotated network triangle. The system considers from 1 to infinite or specific levels for user earnings.

[052] In one embodiment, the system will encounter a situation while assigning a active node group where few users are not eligible for that particular resource. As the system has one common triangle for the entire user base, in this case the percentage of resource allocated to that user will be skipped for subsequent parent users.

[053] In view of the foregoing, it will be appreciated that the present disclosure provides a method and system for uniform allocation of resources amongst a plurality of recipients. The preceding description has been presented with reference to various embodiments. Still, it should be understood that the foregoing relates only to the exemplary embodiments of the present invention, and that numerous changes may be made thereto without departing from the spirit and scope of the invention