Abstract: One embodiment of the present invention provides apparatus and methods for queuing access by large numbers of Internet or other network-based users to networked systems and resources with limited capacity. In one example embodiment, a queuing system provides user access to network resources, such as that of a ticketing system. A ticket queue queues a request received from a client system. A request processing module causes the client system to repeatedly transmit messages to the system during a first period, and in response to determining that the client system has ceased transmitting messages during the first period, the request is remove from the queue and/or cause the request goes unfulfilled.

Abstract: One embodiment of the present invention provides apparatus and methods for queuing access by large numbers of Internet or other network-based users to networked systems and resources with limited capacity. In one example embodiment, a queuing system provides user access to network resources, such as that of a ticketing system. A computer system receives a first request for a first resource The first request is queued in computer readable memory. A determination is made that the first request for the first resource has been abandoned. A queued second request is identified, wherein the second request is similar to the first request. The second request is associated with the abandoned first resource.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: The present invention is related to electronically allocating finite or limited resources. In an embodiment, a computer system is configured to receive bids over a network from a first plurality of users for a limited number of units, the bids including associated bid amounts. A data store is operable to store the bid amounts. Program code is stored in computer readable memory and is configured to determine which bids are winning bids, determine a unit price for units associated with the winning bids, wherein the unit price associated with the winning bids is based on the lowest winning bid amount, and units can be tickets.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: One embodiment of the present invention provides apparatus and methods for queuing access by large numbers of Internet or other network-based users to networked systems and resources with limited capacity. In one example embodiment, a queuing system provides user access to network resources, such as that of a ticketing system. A ticket queue queues a request received from a client system. A request processing module causes the client system to repeatedly transmit messages to the system during a first period, and in response to determining that the client system has ceased transmitting messages during the first period, the request is remove from the queue and/or cause the request goes unfulfilled.

Abstract: One embodiment of the present invention provides apparatus and methods for queuing access by large numbers of Internet or other network-based users to networked systems and resources with limited capacity. In one example embodiment, a queuing system provides user access to network resources, such as that of a ticketing system. A ticket queue queues a request received from a client system. A request processing module causes the client system to repeatedly transmit messages to the system during a first period, and in response to determining that the client system has ceased transmitting messages during the first period, the request is remove from the queue and/or cause the request goes unfulfilled.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: Systems and methods are described for processing queue data and for providing queue messaging over a network. An illustrative queuing system includes a first queue configured to hold resource requests from a plurality of users, and program code stored in computer readable memory configured to determine or estimate whether a resource requested by a first resource request submitted by a first requester will be available when the first resource request will be serviced, and to transmit a message over a network to the first requester indicating that the requested resource will not be available when the queued request is serviced if it is estimated or determined that the requested resource will not be available when the first request is serviced.

Abstract: The present invention is related to electronically allocating finite or limited resources. In an embodiment, a computer system is configured to receive bids over a network from a first plurality of users for a limited number of units, the bids including associated bid amounts. A data store is operable to store the bid amounts. Program code is stored in computer readable memory and is configured to determine which bids are winning bids, determine a unit price for units associated with the winning bids, wherein the unit price associated with the winning bids is based on the lowest winning bid amount, and units can be tickets.

Abstract: The present invention relates to methods and systems for providing secure access control to a facility. An access control system comprises a scanner located adjacent to a venue entrance. A computer system is coupled to the scanner. The computer system is configured to receive a coded user identification data scanned from an admission ticket from a ticket bearer via the scanner, decode the coded user identification data, and transmit the decoded user identification to a terminal for display to a gate keeper so that the gate keeper can determine whether the ticket bearer is to be admitted. An optional turnstile is coupled to the computer system, wherein the computer system enables the turnstile rotation.