It counts each false-positives end-to-end, that is, it is incremented each time an unwanted packet arrives to j.
N i is the non-congestion loss counter, and it is incremented each time a packet loss is not inferred as associated to a congestion event (Fig. 1).
Lines 16-21 deal with determining the new value of threshold_exceeded_counter: it is incremented by 1 if the threshold is exceeded (thresh_exceeded is True) and reset to 0 otherwise.
It counts each false-positives on the route from k to j, that is, it is incremented each time an unwanted packet is forwarded on the path from the sender to the destination.
Specifically, C i is the congestion loss counter related to the i-th monitoring window, and it is incremented each time a loss occurrence is inferred as associated to a congestion event.
It is initialized with the value 0 (Step 1), the first position of m, and it is incremented in a circular way using modular arithmetics (Step 9).
Moreover, as the SNR value is incremented, it is observed from Figure 8 that the MCS scheme obtained from the FALA algorithm will be switched to a higher data rate earlier than the CLA method.
When a leaf is visited, the current value of the counter is assigned to it and the counter is incremented.
If C i,j is 1, the tally for class i is incremented; if it is -1, the class tally of class j is increased by 1. Finally, the class assigned to the example is that having the highest vote tally.
If the initial value of the TPSN is zero, then it will be incremented with each data packet sent, including retransmitted data packets.
