• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

Network devices supporting 100G links are in demand to meet the communication requirements of computing nodes in datacenters and warehouse computers. In this paper, we propose TQ and TQ-Smooth, two lightweight, fair schedulers that accommodate an arbitrarily large number of requestors and are suitable for ultrahigh-speed links. We show that our first algorithm, TQ, as well its predecessor, DRR,...

We investigate a Markovian tandem queueing model in which service to the first queue is provided in batches. The main goal is to choose the batch sizes so as to minimize a linear cost function of the mean queue lengths. This model can be formulated as a Markov Decision Process (MDP) for which the optimal strategy has nice structural properties. In principle we can numerically compute the optima...

This paper considers a tandem queueing network with Poisson arrival process of incoming calls, two servers, and infinite orbits by the method asymptotic analysis. The servers provide services for calls exponentially distributed random times. Blocked customers at each server join orbit that retry to enter again after an time. Under condition low retrial rates, we prove joint stationary distribut...

A novel approach for obtaining the response time in a discrete time tandem queue with blocking, using matrix analytic methods, is presented. The approach sets up the appropriate Markov chain based on the age of the leading customer in the first queue, together with other auxiliary variables. By this approach the response time is obtained with only minor additional effort after obtaining the sta...

Consider a 2-stage single-server tandem queue with a MAP to the first stage and the exponential service times. Using the DREB scheme, we formulate the joint queue length process into a single-dimensional level-dependent quasi-birth-death (LDQBD) process with expanding blocks. This allows us to show that the departure process from stage 1 is a MAP with infinite phases or IMAP and that the depart...

WHY QUEUING ANALYSIS? ......................................................................................2 QUEUING MODELS......................................................................................................3 The Single-Server Queue.....................................................................................3 Queue Parameters .............................................

Consider a single channel two station tandem queue with zero queue capacity and with blocking (Taha, 1989). Assuming that the arrival process and the service process are dependent, we obtain the transient solution for the system when the joint distribution of interarrival time, service time at Station1 and service time at Station 2 is trivariate exponential. Also, CAN estimators and asymptotic ...

We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generat...