In unobservable queueing systems, customers have several chances to leave the system and forgo their service from an agent. Typically customers may choose to leave by balking, which is based on the queue length or they may leave by reneging from the queue, which is based on the virtual waiting time and the patience of the customer. However, the current literature on unobservable queues assumes ...

We consider a single-server queue with Poisson arrivals, where holding costs are continuously incurred as a non-decreasing function of the queue length. The queue length evolves as a birth-and-death process with constant arrival rate λ = 1 and with state-dependent service rates μn that can be chosen from a fixed subset A of [0,∞). Finally, there is a non-decreasing cost-of-effort function c(·) ...

Wireless access points act as bridges between wireless and wired networks. Since the actually available bandwidth in wireless networks is much smaller than that in wired networks, there is a bandwidth disparity in channel capacity which makes the access point a significant network congestion point. The recently proposed active queue management (AQM) is an effective method used in wired network ...

This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant result of the analysis is the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue length...

In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority level that is assigned to each customer at his arrival. For this situation the following service disciplines are considered: gated, exhaustive, and globally gate...

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...

This paper deals with the tail hehavior of the stationary queue length and waiting time distributions for a GI/GIIe queueing system. There are c ~ 1 servers and each server may have a different service time distribution. Our results extend well known classical results for the GIIGI/l queue. Presentation of the key constructions and ideas of this new proof is the main goal of this paper. We also...

Mobile ad-hoc network is a network without infrastructure where every node can work as a router. Every node has protocols and services to request and provide services to other nodes with the congestion handling capability. Traditionally, the congestion handling is done through Transmission Control Protocol (TCP). This protocol sends congestion signal (drop incoming packets) when the node’s queu...

The revenue management literature for queues typically assumes that providers know the distribution of customer demand attributes. We study an observable1 queue that serves an unknown proportion of patient and impatient customers. The provider has a Bernoulli prior on this proportion, corresponding to an optimistic or pessimistic scenario. For every queue length, she chooses a low or a high...