PALM-MARTINGALE CALCULUS, QUEUES WITH VACATIONS, BATCH MARKOVIAN ARRIVAL PROCESSES,SERVER SET-UP Using Palm-martingale calculus, we derive the workload characteristic function and queue length moment generating function for the BMAP IGl/1 . queue with server vacations. In the queueing system under study, the server may start a vacation at the completion of a service or at the arrival of a custo...

We study a discrete-time deterministic server queue with infinite buffer and with packet arrivals that depend on a multidimensional Markov process. Using the generating functions approach we give a means for obtaining the boundary conditions vector for the case where the value zero is a multiple eigenvalue of the problem. We also derive recursive form expressions for the direct determination of...

New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n n array, one of them runs in the optimal 2 n ? 2 steps. It has maximum queue length 32. Another algorithm runs in near-optimal time, 2 n + O(1) steps, with a maximum queue length of only 12.

We consider queuing systems with coupled processors, where the service rate at each queue varies depending on the set of queues in the system with non-zero queue lengths. In general, such queuing systems are very difficult to analyze and steady state queue length distributions are known only for two-queue systems. The coupled-processors model arises naturally in the study of several systems whe...

Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, whereas it is known that web server farms are better modeled as Processor Sharing (PS) server farms. We provide the first approximate analysis of JSQ in the PS server farm model for general job size distributions, obta...

In a single server polling system, the server visits the queues according to a routing policy and while at a queue serves some or all of the customers there according to a service policy. A polling (or scheduling) policy is a sequence of decisions on whether to serve a customer, idle the server, or switch the server to another queue. The goal of this paper is to nd polling policies that stochas...

Queue computers use a FIFO data structure for data processing. The essential characteristics of a queue-based architecture excel at satisfying the demands of embedded systems, including: compact instruction set, simple hardware logic, high parallelism, and low power consumption. The size of the queue is an important concern in the design of a realizable embedded queue processor. We introduce th...

These days’ enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly performing sub-systems, when the service demand and throughput are not synchronized. A poorly performing sub-system may become a serious performance bottlenec...

The paper provides the upand down-crossing method to study the asymptotic behavior of queue-length and waiting time in closed Jackson-type queueing networks. These queueing networks consist of central node (hub) and k single-server satellite stations. The case of infinite server hub with exponentially distributed service times is considered in the first section to demonstrate the upand down-cro...

We consider an M/GI/1/N queue with vacation time and exhaustive service discipline, the same queue as in Lee 9]. Focusing only on the service completion epochs (as oposed to both service completion epochs and vacation completion epochs by Lee), we present a simple analysis for the queue length distribution at an arbitrary time as well as for the waiting time distribution.