Queueing models for police-fire merger analysis

Cities with under 100,000 in population expend a significant portion of their budgets on emergency services. One option that a number of these cities have considered for improving service and cutting costs is training personnel to handle both police and fire roles. In this paper we describe a hierarchy of models that we have used to assess the performance viability of a merger as well as to design specific deployment plans. The modeling environment is more complex than a traditional police or fire system. We need to model the response pattern of four or more patrol units along with the simultaneous dispatch of fire equipment from one or more fire stations. The major contribution of the paper is the manner in which a series of models is linked together to forecast a wide range of performance measures under differing dispatch assumptions. We use a queueing model of police patrol to calculate steady state probabilities and expected delays without preemption. We then model two types of preemptive dispatch strategies utilized in responding initially to a major fire by superimposing a binomial distribution on the basic queueing model. There is also a travel time simulation model to calculate conditional expected response time statistics. The queueing models and the travel time simulation are then combined to estimate unconditional expected values. Lastly, we describe a simulation model used to address transient performance issues that are of concern during a major fire.     

Fluid analysis of an input control problem

A two-station network with controllable inputs and sequencing control, proposed by Wein (Oper. Res. 38:1065–1078, 1990), is analyzed. A control is sought to minimize holding cost subject to a throughput constraint. In a Lagrangian formulation, input vanishes in the fluid limit. Several alternative fluid models, including workload formulations, are analyzed to develop a heuristic policy for the stochastic network. Both the fluid heuristic and Wein’s diffusion solution are compared with the optimal policy by solving the dynamic program. Examples with up to six customer classes, using Poisson arrival and service processes, are presented. The fluid heuristic does well at sequencing control but the diffusion gives additional, and better, information on input control. The fluid analysis, in particular whether the fluid priorities are greedy, aids in determining whether the fluid heuristic contains useful information.     

Queueing models for the analysis of communication systems

Queueing models can be used to model and analyze the performance of various subsystems in telecommunication networks; for instance, to estimate the packet loss and packet delay in network routers. Since time is usually synchronized, discrete-time models come natural. We start this paper with a review of suitable discrete-time queueing models for communication systems. We pay special attention to two important characteristics of communication systems. First, traffic usually arrives in bursts, making the classic modeling of the arrival streams by Poisson processes inadequate and requiring the use of more advanced correlated arrival models. Second, different applications have different quality-of-service requirements (packet loss, packet delay, jitter, etc.). Consequently, the common first-come-first-served (FCFS) scheduling is not satisfactory and more elaborate scheduling disciplines are required. Both properties make common memoryless queueing models (M/M/1-type models) inadequate. After the review, we therefore concentrate on a discrete-time queueing analysis with two traffic classes, heterogeneous train arrivals and a priority scheduling discipline, as an example analysis where both time correlation and heterogeneity in the arrival process as well as non-FCFS scheduling are taken into account. Focus is on delay performance measures, such as the mean delay experienced by both types of packets and probability tails of these delays.     

Coupling method for asymptotic analysis of queues with regenerative input and unreliable server

First we define a regenerative flow and describe its properties. Then a single-server queueing system with regenerative input flow and an unreliable server are considered. By applying coupling we establish the ergodicity condition and prove the limit theorem in the heavy traffic situation (traffic coefficient $\rho <1, \rho \uparrow 1$ ). The asymptotic analysis of the super-heavy traffic situation ( $\rho \ge 1$ ) is also realized.     

Quadratic control for linear periodic systems

We propose a new quadratic control problem for linear periodic systems which can be finite or infinite dimensional. We consider both deterministic and stochastic cases. It is a generalization of average cost criterion, which is usually considered for time-invariant systems. We give sufficient conditions for the existence of periodic solutions.Under stabilizability and detectability conditions we show that the optimal control is given by a periodic feedback which involves the periodic solution of a Riccati equation. The optimal closed-loop system has a unique periodic solution which is globally exponentially asymptotically stable. In the stochastic case we also consider the quadratic problem under partial observation. Under two sets of stabilizability and detectability conditions we obtain the separation principle. The filter equation is not periodic, but we show that it can be effectively replaced by a periodic filter. The theory is illustrated by simple examples.This work was done while this author was a visiting professor at the Scuola Normale Superiore, Pisa.     

Hamilton-Jacobi theory for periodic control problems

The general problem of periodic optimization is considered in this paper. The contribution consists in stating sufficient conditions for the optimality of a control satisfying the periodicity constraint. The result has been achieved by means of the classical Hamilton-Jacobi equation, suitably modified in order to consider the peculiar constraint of the problem. Finally, an interesting application of the theory to the case of linear, time-invariant systems is given.This work was supported by CNR (Consiglio Nazionale delle Ricerche), Rome, Italy.     

Sweep method in analysis optimal control for rendez-vous problems

This paper deals with determining the sufficient conditions of minimum for the class of problems in which the necessary conditions of optimum are satisfied in the strengthened form Legendre-Clebsch. To this paper, we shall use the sweep method which analysis the conditions of existence of the conjugated points on the optimal trajectory. The study we have done evaluates the command variation on the neighboring optimal trajectory. The sufficient conditions of minimum are obtained by imposing the positivity of the second variation. The results that this method offers are applied to the problem o the orbital rendez-vous for the linear case of the equations of movement.     

Comments on: Queueing models for the analysis of communication systems

The paper under discussion is a well-written exposition on the performance modeling of communication systems by discrete-time queueing systems, and their analysis. It basically consists of two parts: a review of the literature, focusing on the modelling of information streams and on scheduling disciplines (Sects. 2, 3), and a demonstration of some key methods for the analysis of discrete-time queueing systems, focusing on a particular two-class discrete-time queue with correlated arrivals and two priority classes (Sects. 4–6). In Sect. 1 of the present note, we make some introductory comments. In Sect. 2, realizing that the literature review in Bruneel et al. (TOP, 2014) is authoritative and extensive, we focus on a few adjacent topics which fall outside the scope of Bruneel et al. (TOP, 2014) but which in our view may also be of some interest. Finally, in Sect. 3, we discuss the analysis in Sects. 4–6 of Bruneel et al. (TOP, 2014).     

Rejoinder on: Queueing models for the analysis of communication systems

In this rejoinder, we respond to the comments and questions of three discussants of our paper on queueing models for the analysis of communication systems. Our responses are structured around two main topics: discrete-time modeling and further extensions of the presented queueing analysis.     

Limits of Bernstein-Bezier curves for periodic control nets

Ifn given control pointsb ₀,...b _n?1∈? ^d are repeated periodically byb _1+kn =b _j for allk∈?, the uniform limit of the Bernstein-Bezier polynomial curves of degreer with control pointsb ₀,…b _r forr»∞ is a Poisson curve (after a suitable reparametrization). This fact reveals some interesting self-similar structures in case of regularn-gons in the plane.     

Queueing models,block hessenberg matrices and the method of neuts

We introduce a numerical method to compute the stationary probability vector of queueing models whose infinitesimal generator is of block Hessenberg form. It is shown that the stationary probability vector is equal to the first column of the inverse of the coefficient matrix. Furthermore, it is shown that the first column of the inverse of an upper (or lower) Hessenberg matrix may be obtained in a relatively small number of operations. Together, these results allow us to define a powerful algorithm for solving certain queueing models. The efficiency of this algorithm is discussed and a comparison with the method of Neuts is undertaken. A relationship with the method of Gaussian elimination is established and used to develop some stability results.This work was supported in part by NSF Grant MCS-83-00438.     

Optimal regulation policies for a multipurpose reservoir with seasonal input and return function

Optimal regulation policies for a multipurpose reservoir are characterized analytically for the case where the input and return functions are subject to seasonal variations and the return function is piecewise linear, concave, and separable in reservoir volume and discharge. Efficient upper and lower bounds on optimal policies are derived for two important special cases. Necessary and sufficient conditions are obtained for a finite-time horizon optimal policy to be also optimal for the infinite-time horizon.This research was supported in part by the Office of Water Resources Research, Grant No. A-043-CAL, through the Water Resources Center, University of California.     

A convergent two-time method for periodic differential equations

Two timing, an ad hoc method for studying periodic evolution equations, can be given a rigorous justification when the problem is in standard form, u = ?f(t, u). First solve $\text{dw}\text{dσ}\text{= ?(I ? M) f(σ, w)}\text{for}\text{w(σ, v)}$, where M is the mean value operator and v is any initial value. Then w(σ, v) is periodic in σ but does not satisfy the original equation. Now, force a solution u(t), using nonlinear variation of constants, in the form w(σ, v(τ)), where σ = t is the fast time and τ = ?t is the slow time. With the resulting differential equation for v, one reads off from its nonconstant solutions thè approximate transient behavior of u(t) for times of order ?^?1. On the other hand, the equilibrium points (constant solutions) v₀ correspond to steady state (periodic solutions) of the original system. Interesting applications, such as to one-dimensional wave equations with cubic damping, can be given.     

Existence and optimal control for periodic parabolic equations with nonlocal terms

Motivated by models which have been proposed for some problemsin mathematical biology and fisheries management and elsewhere,we consider a nonlinear periodic parabolic problem and an associatedcost functional J. A key feature of our problem is the presenceof a nonlocal term which—as we show by direct example—rendersthe standard mono-tonicity methods invalid. We therefore employtopological methods to deal both with existence of solutionsand of minima of J over the Control set. Some considerationsare also presented on related systems and on the question ofuniqueness.     

Sliding mode control for uncertain chaotic systems with input nonlinearity

For the sliding mode controller of uncertain chaotic systems subject to input nonlinearity, the upper bound of the norm of uncertainties is commonly used to determine the controller parameter. However, this will cause serious chattering. In order to overcome this drawback, two new sliding mode controllers are proposed to ensure robust synchronization for a classes of chaotic systems with input nonlinearities and external uncertainty. Compared with the existing results, the proposed controllers can effectively reduce the chattering nearby sliding mode and improve the dynamic performance of the systems. Simulation results are provided to verify the proposed methods.     

Predictor control and suboptimal digital redesign for continuous-time systems with delayed input

This paper deals with the implementation of a predictor controllaw and the suboptimal digital redesign for a continuous-timeplant with a delayed input. It is shown that the closed-loopeigenvalues of the delayed system designed via a predicted-statefeedback controller are identical to those of the non-delayedsystem with the same gain matrix based on the non-predictedstate feedback. Thus, the well-developed design methods of linearquadratic regulators for continuous-time non-delayed systemscan be indirectly applied to delayed-input systems. Moreover,for practical implementation by digital computer, we derivea suboptimal digital redesign of the delayed-input system usingthe predictor control.     

Second-order two-scale method for bending behavior analysis of composite plate with 3-D periodic configuration and its approximation

This paper considers the bending behaviors of composite plate with 3-D periodic configuration.A second-order two-scale(SOTS)computational method is designed by means of construction way.First,by 3-D elastic composite plate model,the cell functions which are defined on the reference cell are constructed.Then the effective homogenization parameters of composites are calculated,and the homogenized plate problem on original domain is defined.Based on the Reissner-Mindlin deformation pattern,the homogenization solution is obtained.And then the SOTS’s approximate solution is obtained by the cell functions and the homogenization solution.Second,the approximation of the SOTS’s solution in energy norm is analyzed and the residual of SOTS’s solution for 3-D original in the pointwise sense is investigated.Finally,the procedure of SOTS’s method is given.A set of numerical results are demonstrated for predicting the effective parameters and the displacement and strains of composite plate.It shows that SOTS’s method can capture the 3-D local behaviors caused by3-D micro-structures well.