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...

We consider a feedback finite fluid queue with downward jumps, where the net flow rate and the jump size for the fluid are controlled by a background Markov chain with a finite state space. The finite means that the fluid queue has a finite buffer. The feedback means that the transition structure of the background process may change when the buffer content becomes empty or full. In this paper, ...

This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant result of the analysis is the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue length...

A buffer is a main-memory area used to reduce access to disks. The buffer holds pages from secondary storage files. A process requesting a page causes a fault if the page is not in the buffer: the requested page is read into the buffer. If no buffer space is available, a page in the buffer is replaced by the requested one. The solution of many relational queries (e.g. joins) require the repeate...

We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...

We design and analyze an approximation method for advection-diffusion-reaction equations where the (generalized) degrees of freedom are polynomials of order k 0 at mesh faces. The method hinges on local discrete reconstruction operators for the diffusive and advective derivatives and a weak enforcement of boundary conditions. Fairly general meshes with polytopal and nonmatching cells are suppor...

We present a new smoothness indicator that evaluates the local smoothness of a function inside of a stencil. The corresponding weighted essentially non-oscillatory (WENO) finite difference scheme can provide the fifth convergence order in smooth regions. The proposed WENO scheme provides at least the same or improved behavior over the classical fifth-order WENO scheme [9] and other fifth-order ...