Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

THE MYTH OF NUCLEAR DETERRENCE

Nuclear deterrence is sometimes treated as a known quantity—a definite thing that keeps us safe and ensures our security. It has also often been used as a justification for possessing nuclear weapons. Nuclear deterrence, however, is based on an unexamined notion: the belief that the threat to destroy cities provides decisive leverage. An examination of history (including recent reinterpretations of the bombing of Hiroshima) shows that destroying cities rarely affects the outcome of wars. How is it possible that an action that is unlikely to be decisive can make an effective threat? Recent work on terrorism suggests that attacks against civilians are often not only ineffective but also counterproductive. And a review of the practical record of nuclear deterrence shows more obvious failures than obvious successes. Given this, the record of nuclear deterrence is far more problematic than most people assume. If no stronger rationale for keeping these dangerous weapons can be contrived, perhaps they should be banned.     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

The BWC protocol mandate for failure

The stage may be set for what could be a historic turning point in America's reliance on nuclear weapons to meet its fundamental national security interests. Proponents of a refurbished nuclear stockpile and infrastructure are convinced that nuclear weapons will remain central to U.S. security interests, yet they admit that there is no national consensus on the need for and role of nuclear weapons. Nuclear opponents are gravely concerned that to the extent nuclear refurbishment creates a global perception that nuclear weapons remain essential instruments, it will eviscerate nuclear nonproliferation measures precisely at a time when nuclear ambitions are growing. Moreover, opponents see deterrence through advanced conventional weapons as decisively more credible than any nuclear alternative. With hopes of elevating discourse to the national level, this article examines the key current arguments pro and con within the specialist community and forecasts changes in the U.S. nuclear arsenal over the next decade. It concludes with a brief prognosis on prospects for complete nuclear disarmament.     

PART II: CONTINUING TO QUESTION THE RELIABILITY OF NUCLEAR DETERRENCE

Responding to Derrin Culp's critique, the author argues that distinguished nuclear theorists may be wrong because groups of experts have been wrong in the past, that city attacks are central to nuclear deterrence theory because killing civilians en masse is what nuclear weapons do best, and that understanding how effective city attacks would be in war is crucial to understanding how well they would work as threats. Moreover, while it is undeniable that nuclear deterrence works some of the time, this simply is not good enough. Because any failure of nuclear deterrence could end in catastrophic nuclear war, nuclear deterrence must be perfect or almost perfect. This is a very difficult standard to reach.     

A robust queueing network analyzer based on indices of dispersion

We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing. The algorithm allows nonrenewal external arrival processes, general service-time distributions and customer feedback. The algorithm is based on a decomposition approximation, where each flow is partially characterized by its rate and a continuous function that measures the stochastic variability over time. This function is a scaled version of the variance-time curve, called the index of dispersion for counts (IDC). The required IDC functions for the external arrival processes can be calculated from the model primitives or estimated from data. Approximations for the IDC functions of the internal flows are calculated by solving a set of linear equations. The theoretical basis is provided by heavy-traffic limits for the flows established in our previous papers. A robust queueing technique is used to generate approximations of the mean steady-state performance at each queue from the IDC of the total arrival flow and the service specification at that queue. The algorithm's effectiveness is supported by extensive simulation studies.     

What you should know about queueing models to set staffing requirements in service systems

One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Keep the change: Counterinsurgency,Iraq, and historical understanding

This article explores the historical reasoning behind counterinsurgency thinking, particularly as applied to Iraq, using Douglas Porch's book, Counterinsurgency: Exposing the Myths of the New Way of War as a reference point. It argues that the classic historical analogies of counterinsurgency theory were inapt in dealing with the conflict in Iraq, and that the historical reasoning behind counterinsurgency more generally deserves greater scrutiny. Not only are the analogies of questionable applicability, but the evidence of causation in prior conflicts is ultimately unproveable. In the end, Counterinsurgency theory and the US Army's Field Manual 3-24 on Counterinsurgency were politically useful during the ‘Surge’, beginning in 2007, but remain intellectually and historically problematic.     

Approximations for heavily loaded G/GI/n + GI queues

Motivated by applications to service systems, we develop simple engineering approximation formulas for the steady‐state performance of heavily loaded G/GI/n+GI multiserver queues, which can have non‐Poisson and nonrenewal arrivals and non‐exponential service‐time and patience‐time distributions. The formulas are based on recently established Gaussian many‐server heavy‐traffic limits in the efficiency‐driven (ED) regime, where the traffic intensity is fixed at ρ > 1, but the approximations also apply to systems in the quality‐and‐ED regime, where ρ > 1 but ρ is close to 1. Good performance across a wide range of parameters is obtained by making heuristic refinements, the main one being truncation of the queue length and waiting time approximations to nonnegative values. Simulation experiments show that the proposed approximations are effective for large‐scale queuing systems for a significant range of the traffic intensity ρ and the abandonment rate θ, roughly for ρ > 1.02 and θ > 2.0. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 187–217, 2016