System and method for dynamic queue management using queue protocols
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/863
H04L-012/911
H04L-012/873
G06F-005/06
G06F-005/10
출원번호
US-0014923
(2016-02-03)
등록번호
US-9608929
(2017-03-28)
발명자
/ 주소
Sussman, Adam
Bennett, Robert
Denker, Dennis
출원인 / 주소
Live Nation Entertainment, Inc.
대리인 / 주소
Kilpatrick Townsend & Stockton LLP
인용정보
피인용 횟수 :
0인용 특허 :
181
초록▼
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 pr
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.
대표청구항▼
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
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, andtransmitting 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; andreceiving 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; andidentifying 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; anda 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, andtransmitting 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; andreceiving 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; andidentifying 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, andtransmitting 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; andreceiving 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.
Smith Barry Craig ; Balakrishnan Vinod ; Green Richard Wenman Pennefather, Apparatus and method of allocating flight inventory resources based on the current market value.
Lupien William A. (La Canada ; Flintridge CA) McCormack John P. (West Boxford MA) Schulman H. E. C. (Boston MA), Automated system for providing liquidity to securities markets.
Ahlstrom Mark L. (Minneapolis MN) Keller Bruce A. (Vadnais Heights MN) Storch Randy S. (Chicago IL), Computer reservation system with means to rank travel itineraries chosen in terms of schedule/fare data.
Salmon Bardwell C. (Weston MA) Borgman John D. (Acton MA) Holtey Thomas O. (Newton MA), Computer-assisted system for interactively brokering goods or services between buyers and sellers.
Rose Marshall T. ; Stein Lee H. ; Borenstein Nathaniel S. ; Lowery Carlyn M. ; New Darren ; Stefferud Einar, Computerized payment system for purchasing goods and services on the internet.
Stein Lee H. ; Stefferud Einar A. ; Borenstein Nathaniel S. ; Rose Marshall T., Computerized system for facilitating transactions between parties on the internet using e-mail.
Stein Lee H. ; Stefferud Einar A. ; Borenstein Nathaniel S. ; Rose Marshall T., Computerized system for making payments and authenticating transactions over the internet.
Walker Jay S. ; Lech Robert R. ; Van Luchene Andrew S. ; Sparico Thomas M. ; Jorasch James A. ; Schneier Bruce, Conditional purchase offer management system for event tickets.
Trippe Kenneth A. B. (P.O Box 5915 ; Ponce De Leon Blvd. ; Suite 16 Coral Gables FL 33146) Edgar Peter M. (P.O Box 5915 ; Ponce De Leon Blvd. ; Suite 16 Coral Gables FL 33146) Vollrath David (3085 Av, Cruise information and booking data processing system.
Eglen, Jan Alan; Eglen, Jeremy; Bakke, Justin; Dasbach, Garrick; Voils, Josh, Dynamic pricing of items based on category with which the item is associated.
Berent Thomas Gerard ; Hurst Dennis Wayne ; Patton Thomas Edward ; Tabernik Ty J. ; Warpool Julie Elizabeth ; Reig Donald C. ; Whittle William Howard, Electronic on-line motor vehicle auction and information system.
Fraser Richard (10 Glen Avon Dr. Riverside CT 06878), Interactive computer system to match buyers and sellers of real estate, businesses and other property using the internet.
Fraser Alexander G. (Bernardsville NJ) Perea Carlos A. (Somerset NJ) Weber Roy P. (Bridgewater NJ), Mediation of transactions by a communications system.
Walker Jay S. ; Schneier Bruce ; Jorasch James A., Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven cond.
Coates, Joshua L.; Bozeman, Patrick E.; Patterson, David A., Method and apparatus for accessing remote storage in a distributed storage cluster architecture.
Gobburu, Venkata T.; Narayanan, Krishnakumar; Challa, Nagesh; Gannage, Michel E., Method and apparatus for acquiring, maintaining, and using information to be communicated in bar code form with a mobile communications device.
Scott E. Sikora ; Nakul M. Lele ; Rajnish Tahiliani ; Ben L. Yip ; Henry Mingkeung Yeung ; Timothy Merrell, Method and apparatus for allocating mixed transaction type messages to resources via an integrated queuing mechanism.
Griffin Gene R. (Crofton MD) Stoll Sheryl K. (Severn MD) LaBarge Ralph S. (Gambrills MD) Seltzer Martin J. (Oyster Bay NY), Method and apparatus for providing travel destination information and making travel reservations.
Alaia Marc ; Becker David J. ; Bernard Anthony F. ; Heckmann Daniel C. ; Kinney ; Jr. Sam E. ; Meakem Glen T. ; Rago Vincent F. ; Reneau Jason ; Roberts Frederick W. ; Rupp William D. ; Stevens Rober, Method and system for controlling closing times of electronic auctions involving multiple lots.
Campbell Gregory L. ; Phillips Robert L. ; Zimmerman Jon P.,GBX ; Saleh Richard A.,GBX ; Grimes Richard C. ; Beskow Stefan L., Method and system for determining marginal values for use in a revenue management system.
Dutta,Rabindranath; Banerjee,Dwip N., Method and system for dynamic utilization mechanisms for facilities whose reservation status can change dynamically.
Charuk,James Michael; Capper,Russell Neill; Jumper,Samuel Waldon; Cafferky,Sean Allan, Method and system for managing real property transactions having internet access and control.
Brown,Michael Wayne; Dutta,Rabindranath; Paolini,Michael A., Method, system, and program for providing information on proximate events based on current location and user availability.
Kurauchi, Nobukazu; Ageishi, Narutoshi; Suzuki, Motoshi; Kajimoto, Kazuo, Resource management system and digital video reproducing/recording apparatus.
Husemann Dirk,CHX ; Kaiserwerth Matthias, Smart card mechanism and method for obtaining electronic tickets for goods services over an open communications link.
John,Ranjit; Menon,Satish N.; Thota,Laxmi; Wang,James; Muthukumarasamy,Jayakumar; Horen,Robert, System and method for highly-scalable real-time and time-based data delivery using server clusters.
Jay S. Walker ; Sanjay K. Jindal ; Bruce Schneier ; Toby Weir-Jones, System and method for managing third-party input to a conditional purchase offer (CPO).
Donner,Irah H.; Donner,Zachary J.; Donner,Jason J., System and method for reallocating and/or upgrading and/or selling tickets, other even admittance means, goods and/or services.
Hunter, Charles Eric; Ballou, Jr., Bernard L.; Summer, Robert D.; Sparks, Kelly C.; Sykes, Ollin B.; Hebrank, John H., System and method permitting customers to order products from multiple participating merchants.
Merrill William E. (Houston TX) Rhebergen John A. (Houston TX) Delgado Robert (Houston TX), System for displaying selected assembly-facility seating views.
Challa, Nagesh; Gobburu, Venkata T., System, method and apparatus for communicating information between a mobile communications device and a bar code reader.
Challa, Nagesh; Gobburu, Venkata T.; Gannage, Michel E., System, method, and apparatus for communicating information encoded in a light-based signal using a fob device.
McKenna William J. (Barrington IL) Silvers Kenneth W. (Frankfort IL) Nickerson Rand B. (Scarborough CAX) Welsh Russell J. (Toronto NJ CAX) Walker Harold R. (Edison NJ) Cullity Joseph A. (Jersey City , Television and market research data collection system and method.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.