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 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 address in this paper the buffer allocation problem in general service, finite waiting room, multi-server queueing networks. Several instances are examined using an approximation method to estimate the performance of the queueing networks and an iterative search method is developed to find the optimal buffer allocation within the network. The coefficient of variation of the service time is s...

In the reordering buffer management problem a sequence of requests arrive online in a finite metric space, and have to be processed by a single server. This server is equipped with a request buffer of size k and can decide at each point in time, which request from its buffer to serve next. Servicing of a request is simply done by moving the server to the location of the request. The goal is to ...

The topological network design of general service, finite waiting room, multi-server queueing networks is a complex optimization problem. Series, merge, and split topologies are examined using an approximation method to estimate the performance of these queueing networks and an iterative search methodology to find the optimal buffer allocation within the network. The coefficient of variation is...

We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops working when the downstream buffer is full. We show that a properly normalized d-dimensional queue length...

Most of the real life multi server queuing systems have heterogeneous servers which means each service rates are different than each other. Analysis of such queuing system plays important role to improve performance. In this report, I have summarized analysis of heterogeneous multi server queuing system which has a finite and an infinite buffer. Average waiting time and average queue length are...

We consider a set of fluid On-Off flows that share a common server of capacity c and a finite buffer B. The server capacity is divided using Generalized Processor Sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long term average demand ρi. The buffer sharing is unrestricted as long as there is available space; if the buffer is full, the necessary a...

In this contribution, we investigate the performance of the output buffer of a video streaming server. We assume that the server encodes the video stream in a scalable way, i.e. the generated video packets contain a base layer ensuring a minimum of guaranteed quality and a stack of additional enhancement layers progressively improving the quality of video. When the output buffer gets congested,...

A single-server non-pre-emptive priority queueing system of a finite capacity with many types customers is analyzed. Inter-arrival times can be correlated and batch arrivals are allowed. Possible unreliability the server, implying loss customer or necessity its service from early beginning some phase service, taken into account. Initial priorities provided to various at arrival moment varied (i...