This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical  computations in the form of graphs are presented to show the par...

We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical MX/G/1 queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The sequence of service times is governed by a modulating process J(t). The state of J(·) at a service initiation t...

Switches in interconnection networks for highly parallel shared memory computer systems may be implemented with different internal buffer structures. For a 2×2 synchronous switch, previous studies have often assumed a switch composed of two queues, one at each output, each of which has unbounded size and may accept two inputs every clock cycle. Hardware implementations may actually use simpler ...

this paper analyzes renewal input state dependent queue with $n$- policy wherein the server takes exactly one vacation. using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. various performance measures has been presented. finally, some numerical  computations in the form of graphs are presented to show the par...

In this paper we consider M[X]/G(a, b)/1 queueing system with accessible service, server breakdown without interruption, multiple vacation and closedown time. The service rule is as follows: the server starts service only when a minimum number of customers ′a′ is available in the queue and the maximum service capacity is ′b′ units such that late entries are allowed to join a service batch, with...

We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with K customer classes, we show that the marginal queue length distribution for class k factorizes over the number of other customer types. The factorizing coefficients equal the queue length probabilities of a PS queue for typ...

In this note we present short derivations of the joint queue length distribution in the M/G/1 queue with several classes of customers and FIFO service discipline.

In this paper, we first review a localized ramp-metering strategy for freeways that achieves the goal of reducing the spatial and temporal span of traffic congestion, using locally available information. The control scheme is composed of a switching mainline-traffic responsive ramp-metering controller that adapts to the different traffic dynamics under different congestion conditions—free-flow ...

We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...

We use a discrete-time dynamical feedback system model of TCP/RED to study the performance of Random Early Detection RED for different values of control parameters. Our analysis shows that the queue length is able to keep stable at a given target if the maximum probability pmax and exponential averaging weight w satisfy some conditions. From the mathematical analysis, a new self-tuning RED is p...