Methods and systems for reducing burst usage of a networked computer system

• US 9,614,733 B1
• Filed: 05/03/2016
• Issued: 04/04/2017
• Est. Priority Date: 05/23/1996
• Status: Expired due to Term

• Current Assignee: Live Nation Entertainment Incorporated
• Original Assignee: Live Nation Entertainment Incorporated
• Inventors: Sussman, Adam, Ross, Brendan, Bennett, Bob, Denker, Dennis, Karonis, Andrew, Brett, Kenton F.
• Primary Examiner(s): Luu, Le H
• Application Number:
  US15/145,268
• Publication Number:
  US 20170085429A1
• Time in Patent Office: 336 Days
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 30/0603 Catalogue ordering
• CPC Class Codes: H04L 41/0896 Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/1014 based on the content of a request
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests

Abstract

Methods and systems for reducing burst usage of a networked computer system are described herein. In an embodiment, resource requesters can request, within a time window, resources over a computer network before the resources are available. The resources can then be allocated in batch mode when the resources are available. Thus, resource requests do not have to be processed in real-time, and resource requests can be received before the resources are available.

Claims

1. A method of reducing burst usage in a networked computer system, the method comprising:

transmitting, over a network and to a plurality of computers, information regarding a first time period when resource requests for a first set of resources will be accepted, wherein each resource in the first set of resources is not to be allocated during the first time period;

receiving, over the network, a plurality of resource requests during the first time period, each resource request of the plurality of resource requests being from a requester electronic device and being for at least a portion of the resources in the first set of resources;

during a second time period beginning after the first time period ends, processing the plurality of resource requests in batch mode using a processing system, the processing further comprising;

assigning a priority to each resource request of the plurality of resource requests, the assignment of the priority being based on one or more criteria, and the assignment of the priority not being dependent on a time at which each of the plurality of resource requests was received;

allocating first resources to a first portion of a plurality of requesters based at least in part on the assigned priority and availability of requested resources, the plurality of requesters corresponding to the plurality of requester electronic devices;

transmitting, for each requester in the first portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding a first resource allocated to the requester;

allocating one or more alternate second resources to a second portion of the plurality of requesters, each requester of the second portion of the plurality of requesters having an assigned priority that is lower than each requester of the first portion of the plurality of requesters; and

transmitting, for each requester in the second portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding an alternate second resource allocated to the requester.

2. The method of reducing burst usage in a networked computer system as recited in claim 1, further comprising:

selecting the second period based at least in part on an anticipated utilization level of the processing system.

3. The method of reducing burst usage in a networked computer system as recited in claim 1, further comprising:

determining, based on a number of requests received during the first time period, that an end of the first time period is to be extended; and

receiving, over the network, a second plurality of resource requests during a time period between an initial end of the first time period and an extended end of the first time period, wherein assigning the priority includes ranking the plurality of resource requests and the second plurality of resource requests.

4. The method of reducing burst usage in a networked computer system as recited in claim 1, wherein each of the first resources is associated with a first date and each of the one or more alternate second resources is associated with a second date.

5. The method of reducing burst usage in a networked computer system as recited in claim 1, wherein the plurality of resource requests includes a request from a requester that includes time data indicating that either of a first time for a first resource or a second time for the first resource is acceptable, and that the first time is of a higher priority than the second time, and

wherein assigning the priority includes ranking the plurality of resource requests based on the time data included in the request.

6. The method of reducing burst usage in a networked computer system as recited in claim 1, wherein the assigned priority is based at least in part on historical resource request frequency information associated with each of at least some of the plurality of requesters.

7. The method of reducing burst usage in a networked computer system as recited in claim 6, wherein:

when first historical resource request frequency information corresponding to a first requester is equal to second historical resource request frequency information corresponding to a second requester, the assignment of the priority includes;

identifying a first geographical location associated with the first requester,

identifying a second geographical location associated with the second requester,

determining that the first geographical location is in closer proximity to a defined location than the second geographical location, and

in response to the determination that the first geographical location is in closer proximity to the defined location, assigning a higher priority to the first requester than to the second requester.

8. A system for reducing burst usage in a networked computer system, the system comprising:

a computing device;

non-transitory media with instructions stored thereon, which when executed by the computing device cause the computing device to perform operations including;

transmitting, over a network and to a plurality of computers, information regarding a first time period when resource requests for a first set of resources will be accepted, wherein each resource in the first set of resources is not to be allocated during the first time period;

receiving, over the network, a plurality of resource requests during the first time period, each resource request of the plurality of resource requests being from a requester electronic device and being for at least a portion of the resources in the first set of resources;

during a second time period beginning after the first time period ends, processing the plurality of resource requests in batch mode using a processing system, the processing further comprising;

assigning a priority to each resource request of the plurality of resource requests, the assignment of the priority being based on one or more criteria, and the assignment of the priority not being dependent on a time at which each of the plurality of resource requests was received;

allocating first resources to a first portion of a plurality of requesters based at least in part on the assigned priority and availability of requested resources, the plurality of requesters corresponding to the plurality of requester electronic devices;

transmitting, for each requester in the first portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding a first resource allocated to the requester;

allocating one or more alternate second resources to a second portion of the plurality of requesters, each requester of the second portion of the plurality of requesters having an assigned priority that is lower than each requester of the first portion of the plurality of requesters; and

transmitting, for each requester in the second portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding an alternate second resource allocated to the requester.

9. The system of reducing burst usage in a networked computer system as recited in claim 8, wherein the actions further include:

selecting the second period based at least in part on an anticipated utilization level of the processing system.

10. The system of reducing burst usage in a networked computer system as recited in claim 8, wherein the actions further include:

determining, based on a number of requests received during the first time period, that an end of the first time period is to be extended; and

receiving, over the network, a second plurality of resource requests during a time period between an initial end of the first time period and an extended end of the first time period, wherein assigning the priority includes ranking the plurality of resource requests and the second plurality of resource requests.

11. The system of reducing burst usage in a networked computer system as recited in claim 8, wherein each of the first resources is associated with a first date and each of the one or more alternate second resources is associated with a second date.

12. The system of reducing burst usage in a networked computer system as recited in claim 8, wherein the plurality of resource requests includes a request from a requester that includes time data indicating that either of a first time for a first resource or a second time for the first resource is acceptable, and that the first time is of a higher priority than the second time, and

wherein assigning the priority includes ranking the plurality of resource requests based on the time data included in the request.

13. The system of reducing burst usage in a networked computer system as recited in claim 8, wherein the assigned priority is based at least in part on historical resource request frequency information associated with each of at least some of the plurality of requesters.

14. The system of reducing burst usage in a networked computer system as recited in claim 13, wherein:

when first historical resource request frequency information corresponding to a first requester is equal to second historical resource request frequency information corresponding to a second requester, the assignment of the priority includes;

identifying a first geographical location associated with the first requester,

identifying a second geographical location associated with the second requester,

determining that the first geographical location is in closer proximity to a defined location than the second geographical location, and

in response to the determination that the first geographical location is in closer proximity to the defined location, assigning a higher priority to the first requester than to the second requester.

15. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform actions including:

transmitting, over a network and to a plurality of computers, information regarding a first time period when resource requests for a first set of resources will be accepted, wherein each resource in the first set of resources is not to be allocated during the first time period;

receiving, over the network, a plurality of resource requests during the first time period, each resource request of the plurality of resource requests being from a requester electronic device and being for at least a portion of the resources in the first set of resources;

during a second time period beginning after the first time period ends, processing the plurality of resource requests in batch mode using a processing system, the processing further comprising;

assigning a priority to each resource request of the plurality of resource requests, the assignment of the priority being based on one or more criteria, and the assignment of the priority not being dependent on a time at which each of the plurality of resource requests was received;

allocating first resources to a first portion of a plurality of requesters based at least in part on the assigned priority and availability of requested resources, the plurality of requesters corresponding to the plurality of requester electronic devices;

transmitting, for each requester in the first portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding a first resource allocated to the requester;

allocating one or more alternate second resources to a second portion of the plurality of requesters, each requester of the second portion of the plurality of requesters having an assigned priority that is lower than each requester of the first portion of the plurality of requesters;

transmitting, for each requester in the second portion of requesters, a communication over the network to the corresponding requester electronic device that provides information regarding an alternate second resource allocated to the requester.

16. The computer-program product as recited in claim 15, wherein the actions further include:

selecting the second period based at least in part on an anticipated utilization level of the processing system.

17. The computer-program product as recited in claim 15, wherein the actions further include:

determining, based on a number of requests received during the first time period, that an end of the first time period is to be extended; and

receiving, over the network, a second plurality of resource requests during a time period between an initial end of the first time period and an extended end of the first time period, wherein assigning the priority includes ranking the plurality of resource requests and the second plurality of resource requests.

18. The computer-program product as recited in claim 15, wherein each of the first resources is associated with a first date and each of the one or more alternate second resources is associated with a second date.

19. The computer-program product as recited in claim 15, wherein the plurality of resource requests includes a request from a requester that includes time data indicating that either of a first time for a first resource or a second time for the first resource is acceptable, and that the first time is of a higher priority than the second time, and

wherein assigning the priority includes ranking the plurality of resource requests based on the time data.

20. The computer-program product as recited in claim 15, wherein the assigned priority is based at least in part on historical resource request frequency information associated with each of at least some of the plurality of requesters.