Branching-type polling systems with large setups

The present paper considers the class of polling systems that allow a multi-type branching process interpretation. This class contains the classical exhaustive and gated policies as special cases. We present an exact asymptotic analysis of the delay distribution in such systems, when the setup times tend to infinity. The motivation to study these setup time asymptotics in polling systems is based on the specific application area of base-stock policies in inventory control. Our analysis provides new and more general insights into the behavior of polling systems with large setup times. © 2009 The Author(s)

Waiting times in queueing networks with a single shared server

We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This model is very generic and finds many applications in computer systems, communication networks, manufacturing systems, and robotics. Special cases of the introduced network include well-known polling models, tandem queues, systems with a waiting room, multi-stage models with parallel queues, and many others. A complicating factor of this model is that the internally rerouted customers do not arrive at the various queues according to a Poisson process, causing standard techniques to find waiting-time distributions to fail. In this paper we develop a new method to obtain exact expressions for the Laplace-Stieltjes transforms of the steady-state waiting-time distributions. This method can be applied to a wide variety of models which lacked an analysis of the waiting-time distribution until now

Heavy-traffic analysis of k-limited polling systems

In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as the number of customers in a vacation system with Erlang-$k_2$ distributed vacations. The queue-length distribution of the critically loaded queue, after applying an appropriate scaling, is exponentially distributed. Finally, we show that the two queue-length processes are independent in heavy traffic

Positive and negative streamers in ambient air: measuring diameter, velocity and dissipated energy

Positive and negative streamers are studied in ambient air at 1 bar; they emerge from a needle electrode placed 40 mm above a planar electrode. The amplitudes of the applied voltage pulses range from 5 to 96 kV; most pulses have rise times of 30 ns or shorter. Diameters, velocities and energies of the streamers are measured. Two regimes are identified; a low voltage regime where only positive streamers appear and a high voltage regime where both positive and negative streamers exist. Below 5 kV, no streamers emerge. In the range from 5 to 40 kV, positive streamers form, while the negative discharges only form a glowing cloud at the electrode tip, but no streamers. For 5 to 20 kV, diameters and velocities of the positive streamers have the minimal values of d=0.2 mm and v \approx 10^5 m/s. For 20 to 40 kV, their diameters increase by a factor 6 while the voltage increases only by a factor 2. Above the transition value of 40 kV, streamers of both polarities form; they strongly resemble each other, though the positive ones propagate further; their diameters continue to increase with applied voltage. For 96 kV, positive streamers attain diameters of 3 mm and velocities of 4*10^6 m/s, negative streamers are about 20 % slower and thinner. An empirical fit formula for the relation between velocity v and diameter d is v=0.5 d^2/(mm ns) for both polarities. Streamers of both polarities dissipate energies of the order of several mJ per streamer while crossing the gap.Comment: 20 pages, 9 figures, accepted for J. Phys.

Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups

Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic alpha-beta search in games where good heuristic evaluations are difficult to obtain. In recent years, combining ideas from traditional minimax search in MCTS has been shown to be advantageous in some domains, such as Lines of Action, Amazons, and Breakthrough. In this paper, we propose a new way to use heuristic evaluations to guide the MCTS search by storing the two sources of information, estimated win rates and heuristic evaluations, separately. Rather than using the heuristic evaluations to replace the playouts, our technique backs them up implicitly during the MCTS simulations. These minimax values are then used to guide future simulations. We show that using implicit minimax backups leads to stronger play performance in Kalah, Breakthrough, and Lines of Action.Comment: 24 pages, 7 figures, 9 tables, expanded version of paper presented at IEEE Conference on Computational Intelligence and Games (CIG) 2014 conferenc