Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from Friedman's reduction method. Fundamental properties of tandem queues with finite buffer capacity are examined. We show that in general system service rate of a dual tan...

Equilibrium behavior of a store-and-forward network node with finite buffer capacity is studied via a network-of-queues model. The positive acknowledgment protocol is explicitly modeled and consumes part of the buffer pool. The principal results are the buffer overflow probability, the mean delays, and the distribution of queue lengths as functions of the buffer capacity and traffic levels. Int...

We present an analysis of the number of losses, caused by the buffer overflows, in a finite-buffer queue with batch arrivals and autocorrelated interarrival times. Using the batchMarkovian arrival process, the formulas for the average number of losses in a finite time interval and the stationary loss ratio are shown. In addition, several numerical examples are presented, including illustrations...

In this article we consider a mixed fork–join synchronization Markovian queueing network consisting of two input buffers, B 1 and B 2 , fed by arrivals from two populations. The first is a finite population of size K and second population is infinite. The first population feeds the first buffer and the second population feeds the second finite buffer. As soon as there is one part in each buffer...

In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptions, we derive an exact relation holding between the loss probability in the finite-buffer queue and the queue length distribution in the corresponding infinite-buffer queue. The exact relation is considered as an integ...

We consider online scheduling so as to maximize the minimum load, using a reordering buffer which can store some of the jobs before they are assigned irrevocably to machines. For m identical machines, we show an upper bound of Hm−1 + 1 for a buffer of size m − 1. A competitive ratio below Hm is not possible with any finite buffer size, and it requires a buffer of size Ω̃(m) to get a ratio ofO(lo...

AbsmcfA closed-form decomposition approximation for finding the data performance in voicddata queuing systems is presented. The approximation is based on Courtois’ decompositiodaggregation techniques and is applied to Senet hybrid multiplexing, movable boundary frame allocation schemes. The approximation is applied to both infinite and finite buffer systems. In the former case the app...