AbstractIn this paper, a single server bulk service queuing system with interrupted vacation, request for Re-service and Balking is considered. At a service completion, if the server finds at least „a‟ customers waiting for service say ξ, he serves a batch of min (ξ ,b ) customers, whereb ≥ a. At the completion of an essential service, the leaving batch of customers may request for a re-service...

In this paper, we investigate the problem of assignment of K identical servers to a set of N parallel queues in a time slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server per time slot. Such multi-server queueing systems were widely applied in modeling th...

In this paper, we consider the following stability problem for a novel dynamical queue. Independent and identical tasks arrive for a queue at a deterministic rate. The server spends deterministic state-dependent times to service these tasks, where the server state is governed by its utilization history through a simple dynamical model. Inspired by empirical laws for human performance as a funct...

In many service systems, customers may choose to abandon the system if their wait is deemed excessive. In an observable queue, the server is always aware that an abandoning customer has left the queue. However, in unobservable queues, the fact that the customer has abandoned the system may be unbeknownst to the server. Not only are the abandoning customers unobservable to the server, the server...

A compound exponential-server timing channel consists of a number of infinite-buffer single-server queues in tandem. The message is coded in the sequence of arrival times to the first queue. We consider the performance of a structurally simple mismatch decoder that is the maximumlikelihood decoder for a single queue.

AblJract Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service-durations, in both queues, are 'drawn independently from the sarpe distril?uUon. A ~etup time is. incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holding c...

We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...