Bulk Service Queueing System Research Articles

CONTROL OF MULTIPRODUCT BULK SERVICE DIFFUSION/OXIDATION PROCESSES

This paper demonstrates how knowledge of future arrivals can be used to control bulk service diffusion and oxidation processes. The objective of the research reported herein is to reduce the average time that lots spend waiting to be processed. A review of the current literature reveals that several researchers have dealt with the control of bulk service queueing systems; however, only one has addressed the use of knowledge of future arrivals and it only considered the case of a single product and a single server. This research reexamines the single product-single server case, and men explores the multiple products-single server case. For both cases, a control strategy is devised and evaluated through the use of systems simulation. The steady-state performance of each control strategy is then compared to the steady-state performance of the theoretical optimal control strategy not considering the timing of any future arrivals (i.e. a Minimum Batch Size strategy). The experimental results indicate that the ...

Transient solution of a finite-capacityM/Ga,b/1 queueing system

In this article we consider a single-server, bulk-service queueing system in which the waiting room is of finite capacity. Arrival process is Poisson and all the arrivals taking place when the waiting room is full are lost. The service times are generally distributed independent random variables and the distribution is depending on the batch size being served. Using renewal theory, we derive the time-dependent solution for the system-size probabilities at arbitrary time points. Also we give expressions for the distribution of virtual waiting time in the queue at any time t.

Distribution of busy period for the bulk-service queueing system E k/M a,b/1

Using the Erlangian technique the busy-period equations for the single-server bulkservice system E k/M a,b/1. are solved to obtain the Laplace transform of the probability density function (pdf) of the busy period. The Laplace transform is expressed in terms of an easily computable real root of the characteristic equation. Expressions for the mean and variance of the busy-period distribution are given. Explicit results for the pdf of the busy period are obtained for the special systems M/M a,b/1 and E k/M a,a/1.

An analysis of the C-PODA protocol for a satellite data communication channel

The Contention-Based Priority Oriented Demand Assignment (C-PODA) protocol is analyzed in this paper. The average waiting time of a message is derived by applying results from bulk service queueing systems. Analytical results are validated by simulation and experimentation. The fairness problem associated with the C-PODA protocol is also studied and a fairness control algorithm is proposed.

Some results for the general bulk service queueing system

This paper deals with a general bulk service queueing system with one server, for which customers arrive in a Poisson stream and the service is in bulk. The maximum number of customers to be served in one lot is B (capacity), but the server does not start service until A (quorum, less than B) customers have accumulated; and the service time follows a general probability distribution. Probability generating functions of the distributions Pn and , under equilibrium, have been derived by using the supplementary variable technique. An expression has been derived for the expected value of the queue size and its relation with the expected value of the waiting time of a customer has been explored. A numerical case has been worked out on the assumption that bulk service follows a specified Erlangian distribution.