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, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

The primary aim of this paper is to answer the question: what are the highest-order fiveor nine-point compact finite difference schemes? To answer this question, we present several simple derivations of finite difference schemes for the oneand two-dimensional Poisson equation on uniform, quasi-uniform, and non-uniform face-to-face hyper-rectangular grids and directly prove the existence or non-...

For Laplace’s equation, we discuss whether it is possible to construct a linear positive finite volume (FV) scheme on arbitrary unstructured grids. Dealing with the arbitrary grids, we state a control volume which guarantees a positive FV scheme with linear reconstruction of the solution. The control volume is defined by a property of the analytical solution to the equation and does not depend ...

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...