SRED: stabilized RED

Understanding the performance of many TCP flows

“…There has been a vast volume of research on studying RED dropping policy, ranging from analytical modeling [5,31] to simulations and experimental evaluation [45,10,8,48], from recommendations for parameters and architecture configuration [18,19,13,22] to proposals of alternatives, which include BLUE [12], SRED (Stabilized RED) [34], Adaptive RED [11], FRED (Fair Random Early Drop) [28], and BRED (Balanced RED) [4]. Our simulation study of RED performance complements the existing body of research by comparing the aggregate throughput, goodput, loss rate, and roundtrip bias of TCP connections under RED gateways with those under drop-tail gateways.…”

Lightweight Fairness Solutions for XCP and TCP Cohabitation

“…Calculating the number of active flows crossing a router is not easy. In this article we describe two mechanisms to estimate the number of active flows that we consider as the more importants: the Bloom filter algorithm [2] and the SRED's zombie estimator [13]. The Bloom filter algorithm [2], as it has been implemented by NRED [7], works as follows:…”

“…On the other hand, the zombie estimator is an algorithm used in SRED [13]. The zombie estimator keeps a table called zombie, able to keep up to 1000 ID flows (the ID flow could be src addr:src port::dest addr:dest port).…”

“…It should be noted that α from the P(t) original equation [13] has been replaced by δ to avoid confusions with the α XCP parameter. Hit(t) is a constant with value 1 in case of hit, or 0 otherwise.…”

Congestion Control in Computer Networks Using a Modified Red Aqm Algorithm

“…In particular, there have been several modifications to RED. Some references in this area include Dynamic RED (DRED) [9], Adaptive RED [8], Stabilized RED (SRED) [11], Jacobson et al [10] and many others. However, these approaches mainly focus on output queued switches.…”