The algorithms of queue management in IP routers determine which packet should be deleted when necessary. The active queue management, recommended by IETF, enhances the efficiency of transfers and cooperate with TCP congestion window mechanism in adapting the flows intensity to the congestion of a network. The article investigates the influence of the way of choosing packets to be dropped (end ...

This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...

We consider a variant of the multiarmed bandit problem where jobs queue for service, and service rates of different servers may be unknown. We study algorithms that minimize queue-regret: the (expected) difference between the queue-lengths obtained by the algorithm, and those obtained by a “genie”-aided matching algorithm that knows exact service rates. A naive view of this problem would sugges...

We introduce the notion of a k-FIFO queue which may dequeue elements out of FIFO order up to a constant k ≥ 0. Retrieving the oldest element from the queue may require up to k+ 1 dequeue operations (bounded fairness), which may return elements not younger than the k + 1 oldest elements in the queue (bounded age) or nothing even if there are elements in the queue. A k-FIFO queue is starvation-fr...

The increasing power, lower cost and improved convenience of wireless networks is fueling the spread of IEEE 802.11 wireless access points (APs) in the residential and commercial environments. While there has been considerable study of wireless performance, little is publicly known about the queue sizes of wireless APs. This paper presents the QFind methodology for measuring wireless AP queue s...

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic ...

In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end qu...