IP Library Granted Patent US 11,836,521
Granted Patent B2
US 11,836,521 · App. 18/175,496 · Granted Dec 5, 2023

Triggered queue transformation

Inventors: Debbie Hsu (Irvine, CA); Gary Yu (Plano, TX); Jonathan Philpott (Eastvale, CA); Suzanne Lai (West Hollywood, CA); Hong Zhou (Beverly Hills, CA)
Assignee: Live Nation Entertainment, Inc.
G06F9/4881G06F9/46G06F9/468G06F9/50G06F9/5038G06F2209/485G06F2209/506Y02D10/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,836,521
App. No.
18/175,496
Granted
Dec 5, 2023
Kind
B2
Abstract

Methods and systems disclosed herein relate generally to evaluating resource loads to determine when to transform queues and to specific techniques for transforming at least part of queues so as to correspond to alternative resources.

Claims (80)

1. A resource management system for processing queue tasks based upon resource structures, the resource management system comprising:

a processor configured to:

receive a plurality of requests for access rights of a resource;

generate a plurality of queue tasks corresponding to the plurality of requests, wherein each of the plurality of queue tasks corresponds to a respective request of the plurality of requests;

add the plurality of queue tasks in a first queue associated with the resource, wherein:

the first queue is processing with a first resource structure and a second resource structure, and

the processing of the first queue according to the first resource structure and the second resource structure indicates assignment of the access rights to the resource for a queue task of the plurality of queue tasks according to the first resource structure or the second resource structure;

execute evaluation of each queue task of the plurality of queue tasks to identify whether the queue task is to be processed according to the first resource structure or the second resource structure;

process a first set of queue tasks of the plurality of queue tasks in the first queue according to the first resource structure based on a result of the evaluation;

process a second set of queue tasks of the plurality of queue tasks in the first queue according to the second resource structure based on the result of the evaluation;

determine that a resource provisioning condition is satisfied based on data associated with the first queue, wherein the resource provisioning condition indicates requirement of provisioning of a new resource structure;

activate a third resource structure based on the resource provisioning condition is satisfied; and

transform a third set of queue tasks of the plurality of queue tasks to process according to the third resource structure.

2. The resource management system according to claim 1 , wherein the processor is further configured to transform the third set of queue tasks according to the third resource structure based on a priority order of the third set of queue tasks in the first queue.

3. The resource management system according to claim 1 , wherein the processor is further configured to dynamically define resource specifications of the third resource structure according to a size of the first queue.

4. The resource management system according to claim 1 , wherein:

the processor is further configured to deactivate the first resource structure and the second resource structure to stop accepting requests for the access rights of the resource, and

the first resource structure and the second resource structure is deactivated based on the third resource structure is activated.

5. The resource management system according to claim 1 , wherein the processor is further configured to:

monitor a size of a queue or a rate at which queue tasks are being added to the first queue; and

determine that the resource provisioning condition is satisfied based on the monitor.

6. The resource management system according to claim 1 , wherein:

the transform of the third set of queue tasks includes modifying a task factor associated with each of the third set of queue tasks, and

the task factor includes a constraint on a resource specification or identification of the resource, an access location of the resource, an access time period of the resource, or a value of an access right of the resource.

7. The resource management system according to claim 1 , wherein the processor is further configured to:

transform the third set of queue tasks from the first queue to a second queue;

identify a task factor of each of the third set of queue tasks that was removed from the first queue; and

modify the task factor according to the third resource structure.

8. The resource management system according to claim 1 , wherein, to process a queue task of the third set of queue tasks according to the third resource structure, the processor is further configured to:

query the third resource structure with a task factor associated with the queue task;

receive, as a result of the query, an identification of available access rights that match the task factor;

assign the available access rights to a device associated with the queue task; and

transmit available access right codes associated with the available access rights to the device.

9. The resource management system according to claim 1 , wherein, to determine that the resource provisioning condition is satisfied, the processor is further configured to:

identify a quantity of the plurality of queue tasks in the first queue;

compare the quantity of the plurality of queue tasks in the first queue to a queue length threshold; and

determine that the quantity of the plurality of queue tasks in the first queue exceeds the queue length threshold based on the compare.

10. A resource management method for processing queue tasks based upon resource structures, the resource management method comprising:

receiving a plurality of requests for access rights of a resource;

generating a plurality of queue tasks corresponding to the plurality of requests, wherein each of the plurality of queue tasks corresponds to a respective request of the plurality of requests;

adding the plurality of queue tasks in a first queue associated with the resource, wherein:

the first queue is processing with a first resource structure and a second resource structure, and

the processing of the first queue according to the first resource structure and the second resource structure indicates assignment of the access rights to the resource for a queue task of the plurality of queue tasks according to the first resource structure or the second resource structure;

executing evaluation of each queue task of the plurality of queue tasks to identify whether the queue task is to be processed according to the first resource structure or the second resource structure;

processing a first set of queue tasks of the plurality of queue tasks in the first queue according to the first resource structure based on a result of the evaluation;

processing a second set of queue tasks of the plurality of queue tasks in the first queue according to the second resource structure based on the result of the evaluation;

determining that a resource provisioning condition is satisfied based on data associated with the first queue, wherein the resource provisioning condition indicates requirement of provisioning of a new resource structure;

activating a third resource structure based on the resource provisioning condition is satisfied; and

transforming a third set of queue tasks of the plurality of queue tasks to process according to the third resource structure.

11. The resource management method according to claim 10 , further comprising transforming the third set of queue tasks according to the third resource structure based on a priority order of the third set of queue tasks in the first queue.

12. The resource management method according to claim 10 , further comprising dynamically defining resource specifications of the third resource structure according to a size of the first queue.

13. The resource management method according to claim 10 , further comprising deactivating the first resource structure and the second resource structure to stop accepting requests for the access rights of the resource, wherein the first resource structure and the second resource structure is deactivated based on the third resource structure is activated.

14. The resource management method according to claim 10 , further comprising:

monitoring a size of a queue or a rate at which queue tasks are being added to the first queue; and

determining that the resource provisioning condition is satisfied based on the monitoring.

15. The resource management method according to claim 10 , further comprising:

identifying a quantity of the plurality of queue tasks in the first queue;

comparing the quantity of the plurality of queue tasks in the first queue to a queue length threshold; and

determining that the quantity of the plurality of queue tasks in the first queue exceeds the queue length threshold based on the comparing.

16. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause a resource management system to perform operations including:

receiving a plurality of requests for access rights of a resource;

generating a plurality of queue tasks corresponding to the plurality of requests, wherein each of the plurality of queue tasks corresponds to a respective request of the plurality of requests;

adding the plurality of queue tasks in a first queue associated with the resource, wherein:

the first queue is processing with a first resource structure and a second resource structure, and

the processing of the first queue according to the first resource structure and the second resource structure indicates assignment of the access rights to the resource for a queue task of the plurality of queue tasks according to the first resource structure or the second resource structure;

executing evaluation of each queue task of the plurality of queue tasks to identify whether the queue task is to be processed according to the first resource structure or the second resource structure;

processing a first set of queue tasks of the plurality of queue tasks in the first queue according to the first resource structure based on a result of the evaluation;

processing a second set of queue tasks of the plurality of queue tasks in the first queue according to the second resource structure based on the result of the evaluation;

determining that a resource provisioning condition is satisfied based on data associated with the first queue, wherein the resource provisioning condition indicates requirement of provisioning of a new resource structure;

activating a third resource structure based on the resource provisioning condition is satisfied; and

transforming a third set of queue tasks of the plurality of queue tasks to process according to the third resource structure.

17. The computer-program product according to claim 16 , further comprising dynamically defining resource specifications of the third resource structure according to a size of the first queue.

18. The computer-program product according to claim 16 , further comprising deactivating the first resource structure and the second resource structure to stop accepting requests for the access rights of the resource, wherein the first resource structure and the second resource structure is deactivated based on the third resource structure is activated.

19. The computer-program product according to claim 16 , further comprising:

monitoring a size of a queue or a rate at which queue tasks are being added to the first queue; and

determining that the resource provisioning condition is satisfied based on the monitoring.

20. The computer-program product according to claim 16 , further comprising:

identifying a quantity of the plurality of queue tasks in the first queue;

comparing the quantity of the plurality of queue tasks in the first queue to a queue length threshold; and

determining that the quantity of the plurality of queue tasks in the first queue exceeds the queue length threshold based on the comparing.

Assignments (3)
SECURITY AGREEMENT Recorded Nov 17, 2023
From: LIVE NATION ENTERTAINMENT, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 065613/0867 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Nov 17, 2023
From: LIVE NATION ENTERTAINMENT, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS SUCCESSOR IN INTEREST TO U.S. BANK NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 065615/0001 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Nov 17, 2023
From: LIVE NATION ENTERTAINMENT, INC.
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS SUCCESSOR IN INTEREST TO U.S. BANK NATIONAL ASSOCIATION, AS NOTES COLLATERAL AGENT
Reel/Frame 065615/0257 →
Continuity (8)
Continuation 16901292 · Jun 15, 2020
Continuation 16298536 · Mar 11, 2019
Continuation 15871735 · Jan 15, 2018
Continuation 15633119 · Jun 26, 2017
Continuation 15380132 · Dec 15, 2016
Continuation 15158185 · May 18, 2016
Provisional Application 62332603 · May 6, 2016
Related Publication 20230221989A1 · Jul 13, 2023