← Mathematical compendium

Published equation contexts

m(Q)={1Q>K0Q≤Km(Q) = \begin{cases} 1 & Q > K \\ 0 & Q \le K \end{cases}

Why this formula appears here

Data Center TCP refined the marking policy for the latencies and buffer sizes actually found inside a datacenter. Its authors describe DCTCP as a scheme that “leverages Explicit Congestion Notification (ECN) in the network to provide multi-bit feedback to the end hosts” rather than the single congestion bit ordinary TCP effectively gets from a drop [ 14 ] . The practical mechanism is a threshold rule applied at each switch queue: writing Q for the queue’s occupancy sampled at a packet’s arrival and K for a fixed marking threshold, the switch’s marking decision m is m(Q)={1Q>K0Q≤Km(Q) = \begin{cases} 1 & Q > K \\ 0 & Q \le K \end{cases}. so the sender receives, over many packets, a running estimate of what fraction of its recent traffic found…

Read the full article-specific guide →

Read the representative guide

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

m(Q)={1Q>K0Q≤Km(Q) = \begin{cases} 1 & Q > K \\ 0 & Q \le K \end{cases}

Equation 4 · Datacenters

How AI Datacenter Interconnects Actually Work

This equation states a bound: one expression must stay on the indicated side of the other under the article’s assumptions.

Data Center TCP refined the marking policy for the latencies and buffer sizes actually found inside a datacenter. Its authors describe DCTCP as a scheme that “leverages Explicit Congestion Notification (ECN) in the network to provide multi-bit feedback to the end hosts” rather than the single congestion bit ordinary TCP effectively gets from a drop [ 14 ] . The practical mechanism is a threshold rule applied at each switch queue: writing Q for the queue’s occupancy sampled at a packet’s arrival and K for a fixed marking threshold, the switch’s marking decision m is m(Q)={1Q>K0Q≤Km(Q) = \begin{cases} 1 & Q > K \\ 0 & Q \le K \end{cases}. so the sender receives, over many packets, a running estimate of what fraction of its recent traffic found…

Meanings in this article

  • QQ: the writing.
Equation guide → · Article →