We study TCP performance over small-BDP lossy wireless networks. Our model is based on a feedback queue. It is tailored for the case when TCP operates with small congestion windows. The present approach allows us to analyze both standard and transmission loss aware TCP versions. Based on the system load and the average queue size of the packets waiting for transmission, we show how an optimal v...

We review some known results and state a few versions of an open problem related to the scaling of the total queue size (in steady state) in an n×n input-queued switch, as a function of the port number n and the load factor ρ. Loosely speaking, the question is whether the total number of packets in queue, under either the maximum weight policy or under an optimal policy, scales (ignoring any lo...

This paper considers buffer overflow probabilities for stable queueing systems with one server and different classes of arrivals. The service priority is given to the class of customers whose current weighted queue size is the largest (weighted-serve-the-longest-queue policy). We explicitly identify the exponential decay rate for the rare-event probabilities of interest, and construct asymptoti...

We consider switched queueing networks in which there are constraints on which queues may be served simultaneously. The scheduling policy for such a network specifies which queues to serve at any point in time. We introduce and study a variant of the popular maximum weight or backpressure policy which chooses the collection of queues to serve that has maximum weight. Unlike the maximum weight p...

The FPGA-QQ (Field Programmable Gate Array Quick Queue) is a novel, efficient priority queue implementation targeted specifically for FPGAs. This paper describes its architecture and use in acceleration of the FPGA routing problem. FPGA-QQ utilizes the FPGA’s blocks of on-chip memory to store keys and values in a completely ordered fashion. The use of the on-chip block memory allows hundreds to...

Current superscalar architectures strongly depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue requires a centralized structure and mainly causes globally broadcasting operations to wakeup and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complex...

Calendar queues (CQ) are often employed in discrete event simulators to store pending events. They can achieve O(1) access time as long as the CQ resizes often enough to ensure that events are not skewed but evenly distributed in the queue structure. However, a resize operation would involve creating a new CQ structure and then moving each item from the old CQ to the new CQ before discarding th...

We consider a distributed server system in which heterogeneous servers operate under the processor sharing (PS) discipline. Exponentially distributed jobs arrive to a dispatcher, which assigns each task to one of the servers. In the so-called size-aware system, the dispatcher is assumed to know the remaining service requirements of some or all of the existing jobs in each server. The aim is to ...

A single server queue with Bernoulli vacation has been considered. In addition the admission to queue is based on a Bernoulli process and the server gives two type of services. For this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. Some performance measures are calculated. Some ...

We consider a one dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b > 0. When the queue-length reaches b, the new customers are...