Probability in the Engineering and Informational Sciences
Cambridge University Press
About: Probability in the Engineering and Informational Sciences is an academic journal published by Cambridge University Press. The journal publishes majorly in the area(s): Markov chain & Queue. It has an ISSN identifier of 0269-9648. Over the lifetime, 1381 publications have been published receiving 20246 citations.
Topics: Markov chain, Queue, Queueing theory, Random variable, Independent and identically distributed random variables
Papers published on a yearly basis
TL;DR: A modified version of the methods uses a coupling to give strong support to the design principle: It is better with few but quick servers.
Abstract: In a system with one queue and several service stations, it is a natural principle to route a customer to the idle station with the distributionwise shortest service time. For the case with exponentially distributed service times, we use a coupling to give strong support to that principle. We also treat another topic. A modified version of our methods brings support to the design principle: It is better with few but quick servers.
TL;DR: A simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.
Abstract: We consider the following queuing system which arises as a model of a wireless link shared by multiple users. There is a finite number N of input flows served by a server. The system operates in discrete time t = 0,1,2,…. Each input flow can be described as an irreducible countable Markov chain; waiting customers of each flow are placed in a queue. The sequence of server states m(t), t = 0,1,2,…, is a Markov chain with finite number of states M. When the server is in state m, it can serve mim customers of flow i (in one time slot).The scheduling discipline is a rule that in each time slot chooses the flow to serve based on the server state and the state of the queues. Our main result is that a simple online scheduling discipline, Modified Largest Weighted Delay First, along with its generalizations, is throughput optimal; namely, it ensures that the queues are stable as long as the vector of average arrival rates is within the system maximum stability region.
TL;DR: In this article, the authors proposed an analytically tractable model of loading-dependent cascading failure that captures some of the salient features of large blackouts of electric power transmission systems.
Abstract: We propose an analytically tractable model of loading-dependent cascading failure that captures some of the salient features of large blackouts of electric power transmission systems. This leads to a new application and derivation of the quasibinomial distribution and its generalization to a saturating form with an extended parameter range. The saturating quasibinomial distribution of the number of failed components has a power-law region at a critical loading and a significant probability of total failure at higher loadings.
TL;DR: In this article, the authors discuss some properties of the reversed hazard rate function and compare them with the conventional hazard rate ordering for k-out-of-n systems with respect to the reverse hazard rate.
Abstract: In this paper we discuss some properties of the reversed hazard rate function. This function has been shown to be useful in the analysis of data in the presence of left censored observations. It is also natural in discussing lifetimes with reversed time scale. In fact, ordinary hazard rate functions are most useful for lifetimes, and reverse hazard rates are natural if the time scale is reversed. Mixing up these concepts can often, although not always, lead to anomalies. For example, one result gives that if the reversed hazard rate function is increasing, its interval of support must be (—∞, b) where b is finite. Consequently nonnegative random variables cannot have increasing reversed hazard rates. Because of this result some existing results in the literature on the reversed hazard rate ordering require modification.Reversed hazard rates are also important in the study of systems. Hazard rates have an affinity to series systems; reversed hazard rates seem more appropriate for studying parallel systems. Several results are given that demonstrate this. In studying systems, one problem is to relate derivatives of hazard rate functions and reversed hazard rate functions of systems to similar quantities for components. We give some results that address this. Finally, we carry out comparisons for k-out-of-n systems with respect to the reversed hazard rate ordering.