IP Library Granted Patent US 9,608,929
Granted Patent B2
US 9,608,929 · App. 15/014,923 · Granted Mar 28, 2017

System and method for dynamic queue management using queue protocols

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 9,608,929
App. No.
15/014,923
Granted
Mar 28, 2017
Kind
B2
Abstract

A system and method for efficiently processing and managing data stored in a queue. A processing device may process the data stored in the queue. Queue protocols can be applied to the queue to efficiently process and manage data stored in the queue. Queue protocols may facilitate efficient use of processing resources that process the data stored in one or more queues. A queue protocol may include at least a first protocol for facilitating transfer of data in the queue to another queue processed by another processing device or a second protocol for inhibiting transfer of data in the queue to another queue.

Claims (56)

1. A computer-implemented method for effective queue management by dynamically providing additional resource information, the method comprising:

receiving, at an access management system, a first communication from an electronic device associated with a user, the first communication including first data representing a first request to associate the user with a first access right to a first resource;

calculating a position in a first queue for storing an identifier code in response to the received first communication, the identifier code corresponding to the first request, the first queue storing a plurality of identifier codes, each of the plurality of identifier codes corresponding to an additional request to associate an additional user with an additional access right to the first resource;

identifying a number of positions in the first queue before the identifier code is to be processed, processing the identifier code corresponding to enabling association of the user with the first access right;

determining a queue protocol from amongst a plurality of queue protocols, the queue protocol facilitating management of the plurality of identifier codes stored in the first queue;

accessing additional resource data from one or more data stores, the additional resource data representing a plurality of additional resources;

dynamically identifying a set of additional resources from the plurality of additional resources, the identification of the set of additional resources being based, at least in part, on the queue protocol, and

transmitting a second communication to the electronic device, the second communication including second data representing the identified set of additional resources, the transmission of the second communication enabling display of the set of additional resources on the electronic device.

2. The computer-implemented method of claim 1 , wherein a restriction limit is applied to the first resource, the restriction limit indicating a maximum number of access rights assignable to the first resource.

3. The computer-implemented method of claim 2 , wherein the determination of the queue protocol is influenced by at least one of a total number of identifier codes stored in the first queue, the number of identifier codes stored in the first queue before the identifier code is to be processed, a number of identifier codes remaining until the restriction limit has been reached, or a processing load for processing the plurality of identifier codes stored in the first queue.

4. The computer-implemented method of claim 1 , wherein the queue protocol includes third data representing one of a first protocol for motivating deletion of one or more identifier codes stored in the first queue or a second protocol for discouraging deletion of the one or more identifier codes stored in the first queue.

5. The computer-implemented method of claim 1 , wherein the first resource is not included in the set of additional resources, and wherein the set of additional resources includes a second resource.

6. The computer-implemented method of claim 5 , wherein enabling display of the set of additional resources comprises:

displaying a first indication of each of the set of additional resources on the first electronic device;

displaying a second indication for deleting the identifier code stored in the first queue; and

receiving a selection of the second resource from the set of additional resources, the selection of the second resource resulting in deleting the identifier code from the first queue and storing the identifier code in a second queue, the second queue corresponding to the second resource, the identifier code corresponding to a second request to associate the user with a second access right to the second resource.

7. The computer-implemented method of claim 4 , wherein dynamically identifying the set of additional resources comprises:

identifying a first set of additional resources from the plurality of additional resources when the queue protocol is the first protocol; and

identifying a second set of additional resources from the plurality of additional resources when the queue protocol is the second protocol.

8. A system, comprising:

one or more data processors; and

a non-transitory computer-readable storage medium containing instructions which, when executed on the one or more data processors, cause the one or more data processors to perform operations including:

receiving, at an access management system, a first communication from an electronic device associated with a user, the first communication including first data representing a first request to associate the user with a first access right to a first resource;

calculating a position in a first queue for storing an identifier code in response to the received first communication, the identifier code corresponding to the first request, the first queue storing a plurality of identifier codes, each of the plurality of identifier codes corresponding to an additional request to associate an additional user with an additional access right to the first resource;

identifying a number of positions in the first queue before the identifier code is to be processed, processing the identifier code corresponding to enabling association of the user with the first access right;

determining a queue protocol from amongst a plurality of queue protocols, the queue protocol facilitating management of the plurality of identifier codes stored in the first queue;

accessing additional resource data from one or more data stores, the additional resource data representing a plurality of additional resources;

dynamically identifying a set of additional resources from the plurality of additional resources, the identification of the set of additional resources being based, at least in part, on the queue protocol, and

transmitting a second communication to the electronic device, the second communication including second data representing the identified set of additional resources, the transmission of the second communication enabling display of the set of additional resources on the electronic device.

9. The system of claim 8 , wherein a restriction limit is applied to the first resource, the restriction limit indicating a maximum number of access rights assignable to the first resource.

10. The system of claim 9 , wherein the determination of the queue protocol is influenced by at least one of a total number of identifier codes stored in the first queue, the number of identifier codes stored in the first queue before the identifier code is to be processed, a number of identifier codes remaining until the restriction limit has been reached, or a processing load for processing the plurality of identifier codes stored in the first queue.

11. The system of claim 8 , wherein the queue protocol includes third data representing one of a first protocol for motivating deletion of one or more identifier codes stored in the first queue or a second protocol for discouraging deletion of the one or more identifier codes stored in the first queue.

12. The system of claim 8 , wherein the first resource is not included in the set of additional resources, and wherein the set of additional resources includes a second resource.

13. The system of claim 12 , wherein enabling display of the set of additional resources comprises:

displaying a first indication of each of the set of additional resources on the first electronic device;

displaying a second indication for deleting the identifier code stored in the first queue; and

receiving a selection of the second resource from the set of additional resources, the selection of the second resource resulting in deleting the identifier code from the first queue and storing the identifier code in a second queue, the second queue corresponding to the second resource, the identifier code corresponding to a second request to associate the user with a second access right to the second resource.

14. The system of claim 11 , wherein dynamically identifying the set of additional resources comprises:

identifying a first set of additional resources from the plurality of additional resources when the queue protocol is the first protocol; and

identifying a second set of additional resources from the plurality of additional resources when the queue protocol is the second protocol.

15. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause a data processing apparatus to perform operations including:

receiving, at an access management system, a first communication from an electronic device associated with a user, the first communication including first data representing a first request to associate the user with a first access right to a first resource;

calculating a position in a first queue for storing an identifier code in response to the received first communication, the identifier code corresponding to the first request, the first queue storing a plurality of identifier codes, each of the plurality of identifier codes corresponding to an additional request to associate an additional user with an additional access right to the first resource;

identifying a number of positions in the first queue before the identifier code is to be processed, processing the identifier code corresponding to enabling association of the user with the first access right;

determining a queue protocol from amongst a plurality of queue protocols, the queue protocol facilitating management of the plurality of identifier codes stored in the first queue;

accessing additional resource data from one or more data stores, the additional resource data representing a plurality of additional resources;

dynamically identifying a set of additional resources from the plurality of additional resources, the identification of the set of additional resources being based, at least in part, on the queue protocol, and

transmitting a second communication to the electronic device, the second communication including second data representing the identified set of additional resources, the transmission of the second communication enabling display of the set of additional resources on the electronic device.

16. The computer-program product of claim 15 , wherein a restriction limit is applied to the first resource, the restriction limit indicating a maximum number of access rights assignable to the first resource.

17. The computer-program product of claim 16 , wherein the determination of the queue protocol is influenced by at least one of a total number of identifier codes stored in the first queue, the number of identifier codes stored in the first queue before the identifier code is to be processed, a number of identifier codes remaining until the restriction limit has been reached, or a processing load for processing the plurality of identifier codes stored in the first queue.

18. The computer-program product of claim 15 , wherein the queue protocol includes third data representing one of a first protocol for motivating deletion of one or more identifier codes stored in the first queue or a second protocol for discouraging deletion of the one or more identifier codes stored in the first queue.

19. The computer-program product of claim 15 , wherein the first resource is not included in the set of additional resources, and wherein the set of additional resources includes a second resource.

20. The computer-program product of claim 19 , wherein enabling display of the set of additional resources comprises:

displaying a first indication of each of the set of additional resources on the first electronic device;

displaying a second indication for deleting the identifier code stored in the first queue; and

receiving a selection of the second resource from the set of additional resources, the selection of the second resource resulting in deleting the identifier code from the first queue and storing the identifier code in a second queue, the second queue corresponding to the second resource, the identifier code corresponding to a second request to associate the user with a second access right to the second resource.

Assignments (3)
SECURITY AGREEMENT Recorded Jan 4, 2021
From: LIVE NATION ENTERTAINMENT, INC.; LIVE NATION WORLDWIDE, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 054891/0552 →
SECURITY AGREEMENT Recorded May 20, 2020
From: LIVE NATION ENTERTAINMENT, INC.; LIVE NATION WORLDWIDE, INC.
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 052718/0016 →
SECURITY AGREEMENT Recorded Oct 31, 2016
From: LIVE NATION ENTERTAINMENT, INC.; LIVE NATION WORLDWIDE, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 040521/0186 →