The formulas for calculating steady state results for the M/M/k queuing system are well known. Computational difficulties, however, can arise in using these formulas in situations in which the ratio of the arrival rate to the service rate is high. In this paper we consider a recursive approach for calculating steady state results which avoid such computational difficulties. As an additional ben...

Transit signal priority TSP is recognized as having the potential to improve transit service reliability at small cost to general traffic. The popular preference for TSP encounters the challenges of various and challenging test scenarios. According to the stochastic characteristics of traffic flow, the signal timing model was established for TSP at an isolated signal intersection, where the pas...

We consider a load-sharing problem for a multiprocessor system in which jobs have real-time constraints: if the waiting time of a job exceeds a given random amount (called the laxity of the job), then the job is considered lost. To minimize the steady-state probability of loss with respect to the load-sharing parameters, we propose to use the likelihood ratio derivative estimate approach, which...

Leks often attract predators as well as mates, yet most evolutionary models have assumed that sexual selection, not predation, drives lekking behavior. We explored the influence of predation on lek dynamics using a stochastic dynamic game model based on the lek-breeding greater sage grouse (Centrocercus urophasianus) and its principal avian predator, the golden eagle (Aquila chrysaetos). The mo...

ABSTRACT In this paper, we develop a supply network model for a service facility system with perishable inventory (on hand) by considering a two dimensional stochastic process of the form (L, X) =   0 )); ( ), ( (  t t X t L , where L (t) is the level of the on hand inventory and X (t) is the number of customers at time t. The inter-arrival time to the service station is assumed to be expone...

The delay bound in section 3.1 is a corollary of Theorem 10.1, and the fact that the packet-identity-aware definition is stronger than the guaranteed rate clock definition, as shown in the following corollary. We say that a node satisfy the guaranteed rate clock property [1] with rate Ö and latency if the departure time Ò of the Òth packet (numbered by order of arrival) is such that Ò Ò · , whe...