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: The main challenge to cognitive radio is the emergence of primary users, which can be considered as the service interruptions in a queuing system. The service interruption can incur significant delays for secondary users' data packets which are considered as secondary customers. Therefore, a secondary customer needs to decide whether to join the queue or leave for other means of transmission. It is shown that the individually optimal strategy for joining the queue is characterized by a threshold of queue length. When the current queue length is above this threshold, the secondary customer should leave; otherwise it should join the queue. The socially optimal threshold of queue length is also obtained and is numerically shown to be smaller than the individually optimal one, which implies that the individually optimal strategy does not yield the socially optimal one. To bridge the gap between the individually and socially optimal strategies, a pricing mechanism is proposed to toll the service of each secondary customer, thus equalizing the two optimal strategies. When the channel statistics are unknown, an online learning procedure, based on the Kiefer-Wolfowitz algorithm, is proposed. The proposed algorithms are then demonstrated using numerical simulations.

Abstract: In this paper, we consider the random access of nodes having energy harvesting capability and a battery to store the harvested energy. Each node attempts to transmit the head-of-line packet in the queue if its battery is nonempty. The packet and energy arrivals into the queue and the battery are all modeled as a discrete-time stochastic process. The main contribution of this paper is the exact characterization of the stability region of the packet queues given energy harvesting rates for the two-node slotted ALOHA system. By stability, we refer the ability of a system to keep the queues in a bounded region, or more precisely, the existence of the limiting distribution for the joint queue length process. The analysis is non-trivial even for the two-node case because it involves the interaction between nodes of having both the packet queue and the battery. The result is obtained for both scenarios in which the capacity of batteries is infinite and also finite.

Abstract: The present disclosure describes methods and systems of allowing entities to create virtual queues that correspond to actual queue in an electronic queue-managing system, and allowing individuals to join the virtual queues using electronic devices (e.g., cell phone technology, wireless network communication technology). The queue-managing system updates the virtual queues based on information from an entity. The queue-managing system also sends messages and notifications of updated status of the virtual queues to the user periodically, automatically or in response to the user's request.

Abstract: A system and method for managing multiple queues of non-persistent messages in a networked environment are disclosed A particular embodiment includes: receiving a non-persistent message at a gateway process, the message including information indicative of a named queue; mapping, by use of a data processor, the named queue to a queue node by use of a consistent hash of the named queue; mapping the message to a queue process at the queue node; accessing, by use of the queue process, a list of subscriber gateways; and routing the message to each of the subscriber gateways in the list

Abstract: The present disclosure describes a method for managing theme park ride lines by providing an identifying device to a guest, the device configured to uniquely identify the guest, using the identifying device to ascertain an amount of time a guest spends at a predetermined location and reducing the amount of time a guest spends in a line queue for a predetermined ride by the amount of time the guest spends at the predetermined location. A system for managing theme park ride lines is also provided.

Abstract: Methods, systems, apparatus and non-transitory computer readable-media are described for creating and/or maintaining a playback queue of media content. In one aspect, a computer-implemented method of providing playback of media content includes receiving a request from a mobile communications device associated with a user to browse a media archive. A user selection of a category and a request to initiate management of a playback queue are received. A media listing is generated responsive to the received request. A user selection of one or more items of media content from the generated media listing is received. One or more playback queue options for the user selected items of media content are presented. A user selection of one of the presented one or more playback queue options is received. The user selected items of media content are manipulated to update the playback queue responsive to the received user selected playback queue option.

Abstract: Analysis of AQM queues with queue size based packet droppingQueueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management AQM algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that include some commonly used blocking probabilities dropping functions.

Abstract: A method for verifying software includes monitoring a resource queue and a job queue, determining whether the resource queue and the job queue contain entries, and if both the resource queue and the job queue contain entries, then applying a scheduling policy to select a job, selecting a worker node as a best match for the characteristics of the job among the resource queue entries, assigning the job to the worker node, assigning parameters to the worker node for a job creation policy for creating new jobs in the job queue while executing the job, and assigning parameters to the worker node for a termination policy for halting execution of the job. The resource queue indicates worker nodes available to verify a portion of code. The job queue indicates one or more jobs to be executed by a worker node. A job includes a portion of code to be verified.

Abstract: One embodiment of the present invention provides a switch that includes a transmission mechanism configured to transmit frames stored in a queue, and a queue management mechanism configured to store frames associated with the queue in a number of sub-queues which allow frames in different sub-queues to be retrieved independently, thereby facilitating parallel processing of the frames stored in the sub-queues.

Abstract: Embodiments of the invention relate to message queuing. In one embodiment, a request from an application for retrieving a message from a queue is received. The queue is stored across multiple nodes of a distributed storage system. A preference with respect to message order and message duplication associated with the queue is identified. A message sequence index associated with the queue is sampled based on the preference that has been identified. The message is selected in response to the sampling. The message that has been selected is made unavailable to other applications for a given interval of time, while maintaining the message in the queue. The message is sent to the application.

Abstract: Disclosed is a system and mechanism that virtualizes a physical queue in a retail establishment. Customers using this system have the ability to indicate they would like to pay now (i.e., enter the virtual queue) using a button on their mobile device, and then they continue shopping until the mobile device informs them to proceed to a checkout counter. In addition, the system implements features that address users waiting in the queue. One feature is about transactions within the queue. This means that customers can buy priority using their mobile device, while waiting. Another feature is targeted advertisement and recommendation of products, leading to increased impulsive purchases.

Abstract: This paper investigates the queuing system of a cognitive user who is trying to communicate, using spectrum sharing methods, over a channel reserved to a licensed user. For the cognitive user to use the channel, its transmission power should satisfy the outage probability requirement of the primary user. In this environment, the cognitive user is found to have an M/G/1 queue model, where the queue service rate is equal to the cognitive channel capacity. Some queue performance measures are investigated. These include the first two moments of the service time process, mean waiting and transit times, mean number of waiting and transit packets, mean duration of server busy period, and mean number of packets served during a busy period. We also investigate the effects of changing some of the communication environment parameters on the queue behavior.

Abstract: The management of airport surface operations to provide shared situational awareness and to control taxi times through the use of ‘virtual queues’ has become an important component of Air Traffic Management (ATM) research and development in both Europe and the United States. Airport Collaborative Decision Making (CDM) has been implemented at a number of airports in Europe, and multiple departure metering concepts have now been tested in the US National Airspace System (NAS). This paper provides a review and comparison of the different airport surface departure management concepts, and describes one such concept in detail that has been evaluated operationally in the field in the US, the Collaborative Departure Queue Management (CDQM) concept. CDQM has been developed and evaluated by the Federal Aviation Administration (FAA) under the Surface Trajectory Based Operations (STBO) project. This paper provides a description of the operational field evaluation of CDQM that was conducted in Memphis, Tennessee, during 2009 and 2010. An analysis of the effectiveness, accuracy and benefit of CDQM in managing departure operations during the field evaluation is presented. CDQM was found to provide reduced taxi times, and resultant reduced fuel usage and emissions, while maintaining full use of departure capacity. Keywords-airport surface traffic management; departure queue management; scheduling algorithms; collaborative decision making; equitable rationing of capacity

Abstract: Two major goals of queue management are flow fairness and queue-length stability However, most prior works dealt with these goals independently. In this paper, we show that both goals can be effectively achieved at the same time. We propose a novel scheme that realizes flow fairness and queue-length stability. In the proposed scheme, high-bandwidth flows are identified via a multilevel caching technique. Then, we calculate the base drop probability for resolving congestion with a stable queue, and apply it to individual flows differently depending on their sending rates. Via extensive simulations, we show that the proposed scheme effectively realizes flow fairness between unresponsive and TCP flows, and among heterogeneous TCP flows, while maintaining a stable queue.

Abstract: There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD) TCP, in a small buffer regime, we argue that stability should also be a desirable feature for network performance. The queue management schemes we study are Drop Tail and Random Early Detection (RED). For Drop Tail, the analytical arguments are based on local stability and bifurcation theory. As the buffer size acts as a bifurcation parameter, variations in it can readily lead to the emergence of limit cycles. We then present NS2 simulations to study the effect of changing buffer size on queue dynamics, utilization, window size and packet loss for three different flow scenarios. The simulations corroborate the analysis which highlights that performance is coupled with the notion of stability. Our work suggests that, in a small buffer regime, a simple Drop Tail queue management serves to enhance stability and appears preferable to the much studied RED scheme.

Abstract: A task management methodology for system having multiple processors and task queues adapts a queuing topology by monitoring a queue pressure and adjusting the queue topology from a selection of at least two different queue topologies. The queue pressure may be periodically monitored and queues with different granularities selected. The methodology reduced contention when there is high pressure on the queues while also reducing overhead to manage queues when there is less pressure on the queues.

Abstract: We investigate the asymptotic behavior of the steady-state queue length distribution under generalized max-weight scheduling in the presence of heavy-tailed traffic. We consider a system consisting of two parallel queues, served by a single server. One of the queues receives heavy-tailed traffic, and the other receives light-tailed traffic. We study the class of throughput optimal max-weight-α scheduling policies, and derive an exact asymptotic characterization of the steady-state queue length distributions. In particular, we show that the tail of the light queue distribution is heavier than a power-law curve, whose tail coefficient we obtain explicitly. Our asymptotic characterization also shows that the celebrated max-weight scheduling policy leads to the worst possible tail of the light queue distribution, among all non-idling policies. Motivated by the above ‘negative’ result regarding the max-weight-α policy, we analyze a log-max-weight (LMW) scheduling policy. We show that the LMW policy guarantees an exponentially decaying light queue tail, while still being throughput optimal.

Abstract: In one of many possible embodiments, a system includes a plurality of queues configured to share an amount of bandwidth, the amount of bandwidth being allocated between the queues in accordance with a plurality of queue weighting factors associated with the queues The system further includes an admission control subsystem configured to dynamically adjust the queue weighting factors when a predefined condition has been satisfied In certain embodiments, the admission control subsystem is configured to adjust the queue weighting factors based on a ratio of bandwidth provisioned on the plurality of queues In certain embodiments, each of the queues is associated with a different class of service

Abstract: Queue management is a valuable but underutilized technique which could be used to minimize the negative impacts of queues during oversaturated traffic conditions. One of the main obstacles of applying queue management techniques along signalized arterials is the unavailability of a robust and sufficiently accurate method for measuring the number of vehicles approaching a signalized intersection. The method based on counting vehicles as they enter and exit a specific detection zone with check-in and check-out detectors is unreliable because of the likely systematic under or over counting and the resulting cumulative errors. This paper describes the application of the Adaptive Neuro-Fuzzy Inference System (ANFIS) in the development of a new fuzzy logic-based approach for estimating the Number of Vehicles in a Detection Zone (NVDZ) by using detector time-occupancy data (instead of detector counts). Microscopic simulation results are used to evaluate the accuracy of the NVDZ estimates. Tests were carried out to determine the transferability of a tuned Fuzzy Inference System (FIS) and to check the sensitivity of the calibrated FIS to detection coverage, the location of the detection zone relative to the signalized (bottleneck) intersection, the length of the detection zone, and different signal timings at the bottleneck intersection. Results show that the NVDZ estimation based on fuzzy logic seems to be a feasible approach. Although the primary objective of developing the NVDZ estimation technique has been queue management, other applications such as ramp metering and incident detection could potentially use the same technique.

Abstract: We consider the problem of resource allocation in downlink OFDMA systems for multi service and unknown environment Due to users' mobility and intercell interference, the base station cannot predict neither the Signal to Noise Ratio (SNR) of each user in future time slots nor their probability distribution functions In addition, the traffic is bursty in general with unknown arrival The probability distribution functions of the SNR, channel state and traffic arrival/density are then unknown Achieving a multi service Quality of Service (QoS) while optimizing the performance of the system (eg total throughput) is a hard and interesting task since it depends on the unknown future traffic and SNR values In this paper we solve this problem by modeling the multiuser queuing system as a discrete time linear dynamic system We develop a robust H∞ controller to regulate the queues of different users The queues and Packet Drop Rates (PDR) are controlled by proposing a minimum data rate according to the demanded service type of each user The data rate vector proposed by the controller is then fed as a constraint to an instantaneous resource allocation framework This instantaneous problem is formulated as a convex optimization problem for instantaneous subcarrier and power allocation decisions Simulation results show small delays and better fairness among users

Abstract: This paper focuses on improving the queuing system of bank based on BPR. Firstly, the bottleneck problems of bank queuing is analyzed as well as the concept, classification and methodologies of BPR (business process reengineering). Secondly, the bank businesses are investigated and analyzed. Thirdly, the queuing system of certain bank is optimized based on BPR by enterprise dynamic simulation. Finally, the simulated results are discussed and the optimized result is concluded.

Abstract: During the last years, the interest in Delay/Disruption Tolerant Networks has been significantly increased, mainly because DTN covers a vast spectrum of applications, such as deep-space, satellite, sensor and vehicular networks. Even though the Bundle Protocol seems to be the prevalent candidate architecture for delay-tolerant applications, some practical issues hinder its wide deployment. One of the functionalities that require further research and implementation is DTN queue management. Indeed, queue management in DTN networks is a complex issue: loss of connectivity or extended delays, render occasionally meaningless any pre-scheduled priority for packet forwarding. Our Queue-management approach integrates connectivity status into buffering and forwarding policy, eliminating the possibility of stored data to expire and promoting applications that show potential to run smoothly. Therefore, our approach does not rely solely on marked priorities but rather on active networking conditions. We present our model analytically and compare it with standard solutions. We then develop an evaluation tool by extending ns-2 modules and, based on selective scenarios primarily from Space Communications, we demonstrate the suitability of our model for use in lowconnectivity/ high-delay environments.

Abstract: A method for queuing data packets is described. Upon receipt of a data packet, e.g., at an egress buffer of a node, a position within an output queue at which to place the data packet is determined. The queue position for the data packet can be determined based on various criteria, e.g., the type of the data packet and a time associated with its subsequent transmission, and timing aspects associated with the data packets which are already stored in the queue.

Abstract: Almost all service experiences require customers to wait in a queue at some point during the service encounter. Although waiting is a natural part of many services, for most customers, waiting is an annoyance. One of the most recent and innovative ways of making the wait invisible is through the application of virtual queues. Disney is a leader in this queuing advancement which allows customers to participate in other activities while they wait for an appointed time at their desired activity. In the past, queuing systems were modeled and studied as a means to minimize the negative aspects of service waits. However, in today’s service environment, technology has provided businesses with the ability to create captured audiences through virtual queues. In fact, a powerful opportunity now exists for service firms to strategically co-brand products. In our work, we first explore queuing in the services industry. We then investigate Disney’s queuing advancement – FASTPASSTM. Strategies for co-branding services are discussed as opportunities to increase sales volumes and profit margins.

Abstract: The classical M/M/1 queue is considered with vacations, in which the server works with different service rates rather than completely stops service during the vacation period. Service times during vacation period, service times during service period and vacation times are all exponentially distributed. An exact transient system size probability distributions and other system characteristics are derived in closed form and also obtained the time-dependent system size probability in the absence of working vacation. Further we deduce the stationary distributions from time-dependent system size probabilities. A numerical illustration is provided by considering various parameters.