Figure 6 shows a comparison between the analytical model and the simulation results for the marking probability of the tswTCM algorithm.
However, from the viewpoint of victim, the marking probability of router R i (1 = > i < = d) is p(1 - p d-i that is different than p d-i, 29].
Assume that there are d routers in an attack path and the marking probability of each of these routers is a constant number p. The optimal value for p is 1/d.
Figures 4 and 5 are summarized in Fig. 7, which shows a comparison between results obtained from a simulation and from the analytical model for marking probability for arrival traffic of the OtswTCM algorithm.
EBM is to handle the problems found in other marking schemes regarding fairness among heterogeneous TCP flows through a tight feedback-loop operation and adaptation of the packet marking probability to network conditions.
The behaviour of the traffic marking probability as red, yellow and green.
The model distribution of the traffic average rate was approximated through a rate estimator and the marking algorithm determined the behaviour of the traffic marking probability as red, yellow and green.
Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.
The total amount of marking probability was always between 0 and 1.
As described before, the optimal value of marking probability, p, is 1/d.
The concept of marking probability is shown in Fig. 2. In the first part, all traffic were marked green when the traffic average rate was less than the CIR.
