The <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/∞ system revisited: finiteness,summability, long range dependence,and reverse engineering

We explore M/G/∞ systems ‘fed’ by Poissonian inflows with infinite arrival rates. Three processes – corresponding to the system's state, workload, and queue-size – are studied and analyzed. Closed form formulae characterizing the system's stationary structure and correlation structure are derived. And, the issues of queue finiteness, workload summability, and Long Range Dependence are investigated. We then turn to devise a ‘reverse engineering’ scheme for the design of the system's correlation structure. Namely: how to construct an M/G/∞ system with a pre-desired ‘target’ workload/queue auto-covariance function. The ‘reverse engineering’ scheme is applied to various examples, including ones with infinite queues and non-summable workloads. AMS Subject Classifications Primary: 60K25; Secondary: 60G55, 60G10     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

Algorithmic analysis of theMAP/PH/1 retrial queue

In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

The MAP/PH/N retrial queue in a random environment

We consider the MAP/PH/N retrial queue with a finite number of sources operating in a finite state Markovian random environment. Two different types of multi-dimensional Markov chains are investigated describing the behavior of the system based on state space arrangements. The special features of the two formulations are discussed. The algorithms for calculating the stationary state probabilities are elaborated, based on which the main performance measures are obtained, and numerical examples are presented as well.     

Stability analysis for stochastic jump systems with time-varying delay

This paper deals with the mean-square asymptotic stability of stochastic Markovian jump systems with time-varying delay. Based on a new stochastic inequality and convex analysis property, some novel stability conditions are presented. In the derivation, the information of the time-varying delay is retained and the estimation of it by the worst-case enlargement is not involved. Some special cases of the systems under consideration are also investigated. Illustrative examples are given to show the effectiveness of the proposed approach.     

Analysis of marine atmospheric turbulence effects on infrared imaging system by angle of arrival fluctuations

For the long-range infrared imaging system, the marine atmospheric turbulence degrades seriously the probability of object recognition and tracking. In this study, the angle of arrival fluctuations of an optical wave, which describes the distortion effects of marine atmospheric turbulence on an infrared optical imaging system, is investigated in detail both analytically and numerically. Analytic expressions of the angle of arrival fluctuations are derived for optical plane and spherical waves propagating through weak marine atmospheric turbulence with horizontal path, and they consider simultaneously finite turbulence inner scale, turbulence outer scale, wavelength, and aperture diameters. Numerical calculations are conducted to analyze the influence of marine weak turbulence on the infrared imaging. The results are useful for understanding the potential impact of deviations from the terrestrial turbulence.     

Validity of the quantum regression theorem for resonance fluorescence in a photonic crystal

Correlation functions of a driven two‐level system embedded in a photonic crystal are analyzed. The spectral density of the photonic bands near a gap makes this system non‐Markovian. The equations of motion for two‐time correlations are derived by two different methods, the quantum regression theorem and the fluctuation dissipation theorem, and found to be the same.     

On Short Time Asymptotic Behavior of Some Symmetric Diffusions on General State Spaces

For conservative symmetric diffusions on a general state space (X,m), the short time asymptotic behavior of tlog _X 1 _A T _t 1 _B dm is investigated, where T _t is the associated semigroup and A and B are measurable subsets of X. It is proved that the superior limit is dominated by the inferior limit up to some absolute constant. When ₂ of the associated Dirichlet form is lower bounded, it is shown that the limit exists for any A and B, and is described by the intrinsic metric between them. Applications to infinite-dimensional spaces and fractals are given.