Sentence examples for maximum queue backlog from inspiring English sources

The core idea of our algorithm is to tune the contention window size (CW) corresponding to the maximum queue backlog to achieve the required transmission probability.

If {Q}_n(t)le 2ln 2cdot rho Vleft(frac{1}{h_{mathrm{min}}}+{p}_n^{mathrm{max}}right) the maximum queue backlog growth is a max, then {Q}_n(t)le 2ln 2cdot rho Vleft(frac{1}{h_{mathrm{min}}}+{p}_n^{mathrm{max}}right)+{a}_{mathrm{max}}.

Specifically, BP chooses for transmission at each time slot, a maximal independent set of links (non-interfering links) that achieves the maximum sum of queue backlog differentials multiplied with the corresponding link's communication traffic.

The algorithm can push time average admission rate close to optimal, with a corresponding tradeoff in average queue backlog.

Moreover, the queue backlog differential between each pair of neighbor nodes is decided by their actual queue lengths and also their virtual queue lengths (gradient values).

Accordingly, the queue backlog at a sensor node will be the sum of actual queue length and virtual queue length (gradient) at the node.

The parameter V > 0 is used to tune performance-delay tradeoff between performance and queue backlog (i.e., delay).

Let ({U_{n}^{f}}(t)) represent the per-flow queue backlog of the only flow f in the network on node n∈V(G) at time t.

As the arrival rate increases, the end-to-end delay decreases rapidly, which is caused by the shortened backoff period corresponding to the increased queue backlog.

Also, new packet arrivals are reduced to prevent high queue backlog but kept at a minimum rate to prevent log ( ε + r ̄ k ) from very negative values.

Let Q i be the queue backlog at the relay for flow i, and C the set of all possible control actions.