Content deleted Content added
indicate who researched it, since at least one seems notable |
link to article that defines what kind of flows it is talking about |
||
Line 11:
===Stochastic fair Blue===
The main flaw of Blue, which it shares with most single-queue queueing disciplines, is that it does not distinguish between [[Traffic flow (computer networking)|traffic flows]],
Stochastic fair Blue (SFB) is a stochastically fair variant of Blue which hashes flows and maintains a different mark/drop probability for each hash value. Assuming no hash collisions, SFB is able to provide a fair share of buffer space for every flow. In the presence of hash collisions, SFB is only stochastically fair.<ref>{{Citation |author1=Wu-Chang Feng |author2=Dilip D. Kandlur |author3=Debanjan Saha |author4=Kang G. Shin |title=Stochastic Fair Blue: an algorithm for enforcing fairness |url=http://www.thefengs.com/wuchang/blue/41_2.PDF |journal=
Unlike other stochastically fair queuing disciplines, such as SFQ, SFB can be implemented using a [[bloom filter]] rather than a [[hash table]], which dramatically reduces its storage requirements when the number of flows is large.▼
▲Unlike other stochastically fair queuing disciplines, such as SFQ,<!-- what is that? --> SFB can be implemented using a [[bloom filter]] rather than a [[hash table]], which dramatically reduces its storage requirements when the number of flows is large.
When a flow's drop/mark probability reaches 1, the flow has been shown to not react to congestion indications from the network. Such an inelastic flow is put in a "[[penalty box]]", and rate-limited.
| |||