We present LGC-ShQ, a new ECN-based congestion control mechanism for datacenters. LGC-ShQ relies on ECN feedback from Shadow Queue, and it uses not only to decrease the rate, but also increases rate in relation this signal. Real-life tests Linux testbed show that keeps real queue at low levels while achieving good link utilization fairness.

Active Queue Management (AQM) policies are mechanisms for congestion avoidance, which pro-actively drop packets in order to provide an early congestion notification to the sources. In this paper we propose a new Adaptive Prediction based Approach for Congestion Estimation in Active Queue Management (APACE) that predicts the instantaneous queue length at a future time using adaptive filtering te...

The objective of this study is to introduce an integrated simulation AHP model for modeling, assessment and improvement of a machine mix problem with complex queue priorities and service times. Furthermore, there is no closed form expression for such situations, as previous studies show no mathematical models for machine mix with integrated service and queue priorities. The production lines of ...

In this paper ,we discuss the Geom/G/1 queue with Bernoulli feedback and server setup/closedown times.We derive the probability generating function (PGF) of the steady-state queue length immediately after a service completion by the embedded Markov chain and the PGF of the queue length immediately after an arbitrary slot boundary .We also get the PGF of the stationary waiting times under first ...

We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M/G/1/n) systems. We show the somewhat surprising result that for three variations of the preemptive LCFS discipline, the maximum queue ...

We study the steady-state queue-length vector in a multi-class queue with relative priorities. Upon service completion, the probability that the next served customer is from class k is controlled by class-dependent weights. Once a customer has started service, it is served without interruption until completion. We establish a state-space collapse for the scaled queue length vector in the heavy-...

Information about queue length is an important parameter for customers who face the decision whether to join a queue or not. In this paper, we study how optimal information disclosure policies can be used by a service provider of an M/M/1 queue to increase its revenue. Our main contribution is showing that the intuitive policy of informing customers about the current queue length when it is sho...

A closed cyclic queueing system with multiple classes is analyzed numerically. The queueing system was originally motivated by a need to model circuit switching traffic in a data multiplexing scheme which provides both circuit and switching capabilities. The queueing system consists of two nodes, namely the primary and the secondary node. Customers in the primary node may require a random numbe...