We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is present...

A model of a switching component in a packet switching network is considered. Packets from several incoming channels arrive and must be routed to the appropriate outgoing port according to a service policy. A task confronting the designer of such a system is the selection of policy and the determination of the corresponding input buuer requirements which will prevent packet loss. One natural ch...

In this paper we present a randomized algorithm for the multipacket routing problem on an n×nmesh. The algorithm completes with high probability in at the most kn + o(kn) parallel communication steps, with a queue size of k + o(k). The previous best known algorithm [3] takes 5 4 kn+O( kn f(n) ) steps with a queue size of O(k f(n)) (for any 1 ≤ f(n) ≤ n). The algorithm that we will present is op...

We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T , either preemptively or non-preemptively. All switches are insta...

This paper studies maximum likelihood estimates as well as confidence intervals of an M/M/R queue with heterogeneous servers under steady-state conditions. We derive the maximum likelihood estimates of the mean arrival rate and the three unequal mean service rates for an M/M/3 queue with heterogeneous servers, and then extend the results to an M/M/R queue with heterogeneous servers. We also dev...

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival t...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

This paper studies two stochastic Models (A) and (B) with bulk production and bulk sales of products with catastrophe. The system has infinite storing capacity and the production and sales sizes are finite valued random variables with finite maximum production and sales sizes. When a catastrophe occurs the entire stocks are sold. Matrix partitioning method is used to study the models. In Model ...

 This paper deals with batch arrival unreliable queue with two phases of service and vacation under Bernoulli vacation schedule, which consist of a breakdown period and a delay period. For this model, we first derive the joint distribution of state of the server and queue size, which is one of the chief objectives of this paper. Secondly, we derive the pgf of the stationary queue size distribu...