BMAP/G/1 queue with correlated arrivals of customers and disasters

We consider a single server queue with disasters where the arrivals of customers and disasters are correlated. When a disaster occurs, it removes all the customers in the system and there requires repair time for the system to be operated normally. The stationary queue length distribution at the embedded points and at an arbitrary time are presented.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

G-网络排队系统的研究新进展

在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展.     

On the Number of Lost Customers in Stationary Loss Systems in the Light Traffic Case

For the stationary loss systems M/M/m/K and GI/M/m/K, we study two quantities: the number of lost customers during the time interval (0,t] (the first system only), and the number of lost customers among the first n customers to arrive (both systems). We derive explicit bounds for the total variation distances between the distributions of these quantities and compound Poisson–geometric distributions. The bounds are small in the light traffic case, i.e., when the loss of a customer is a rare event. To prove our results, we show that the studied quantities can be interpreted as accumulated rewards of stationary renewal reward processes, embedded into the queue length process or the process of queue lengths immediately before arrivals of new customers, and apply general results by Erhardsson on compound Poisson approximation for renewal reward processes.     

Intertemporal service pricing with strategic customers

We study a two-period intertemporal pricing game in a single-server service system with forward-looking strategic customers who make their purchase decision based on current information and anticipated future gains. Subgame perfect Nash equilibrium (SPNE) prices are derived. A comparison between revenue-maximizing equilibrium prices and welfare-maximizing equilibrium prices is conducted and the impact on the system’s performance of misunderstanding customers’ type is evaluated.     

Bad luck when joining the shortest queue

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.     

The service system M/M R /∞ with impatient customers

An infinite server queue is considered where customers have a choice of individual service or batch service. Transient results have been obtained for the first two moments of the system size distribution. Waiting time distribution is important in system evaluation and steady state results are obtained.     

Optimal threshold analysis of segmentation methods for identifying target customers

In CRM (Customer Relationship Management), the importance of a segmentation method for identifying good customers has been increasing. For evaluation of different segmentation methods, Accuracy often plays a key role. This indicator, however, cannot distinguish two types of errors. The purpose of this paper is to overcome this pitfall by introducing two different indicators: Recall and Precision. Assuming that a promotion is addressed exclusively to the selected target customers, the financial effectiveness of the underlying segmentation method is expressed as a function of Recall and Precision. An optimization problem is then formulated so as to maximize the financial measure by finding the optimal threshold level in terms of the severeness for estimating the target set. By introducing a functional form which represents correctness and mistakes about the target set, the unique optimal solution is derived explicitly. The proposed approach is validated by using real customer purchase data.     

Invariance of stationary probabilities of states for network of multiserver queues

A queueing network consisting of multiserver nodes with different sources of customers is considered. We investigate stationary probability distributions of network states. Their invariance with respect to the functional form of distributions of input and service processes is established under fixed expectations of these distributions and service discipline when any entering customer has a preemptive resume discipline.     

Tail asymptotics for service systems with transfers of customers in an alternating environment

This study examines service systems with transfers of customers in an alternating environment. We model the service system as a two-server two-parallel queue (primary and auxiliary queues), that has various applications especially in manufacturing and healthcare systems. We establish a sufficient stability condition, and based on the censoring technique, we provide sufficient conditions under which the stationary distribution possesses an exactly geometric tail along the direction of the queue length in the primary queue.