Stochastic fair blue: a queue management algorithm for enforcing fairness

By Wu-chang Feng, Dilip D. Kandlur, D. Saha, Kang G. Shin. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001

314 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Management Information Systems, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/c777b1c47889e6ebcdda9e475cab6bbfff490a07

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Michael M. Mitzenmacher
2. Andrei Z. Broder
3. Edward W. Knightly
4. Aleksandar Kuzmanovic
5. Kang G. Shin
6. Joe Kilian
7. Ronitt Rubinfeld
8. Bernard Chazelle

In Management Information Systems

1. Andrei Z. Broder
2. Aleksandar Kuzmanovic
3. Michael M. Mitzenmacher
4. Edward W. Knightly
5. Gauri Joshi
6. Yae Jee Cho
7. Jianyu Wang
8. Raissa M. D’Souza

In Management Science and Operations Research

1. Aleksandar Kuzmanovic
2. Michael M. Mitzenmacher
3. Edward W. Knightly
4. Andrei Z. Broder

Citations in the corpus

• Low-rate TCP-targeted denial of service attacks and counter strategies (2003, methodology): “Candidate algorithms include Flow R andom Early Detection (FRED) [20], CHOKe [24], Stochastic Fai r Blue (SFB) [9], the scheme of reference [2], ERUF [29], Stabi lized RED (SRED) [23], dynamic buffer-limiting scheme from [5] and RED with Preferential Dropping (RED-PD) [22].”
• Network Applications of Bloom Filters: A Survey (2004, methodology): “One way to mitigate this e ff ect, suggested in [Feng et al. 01], is to change the hash functions periodically, so that if a responsive fl ow is being punished unfairly the resetting of the hash functions makes it extremely unlikely that it continues to be punished.”
• The BLUE active queue management algorithms (2002, background): “Additional experiments show that this algorithm allows for quick adaptation to flow behavior [11].”
• The Bloomier filter: an efficient data structure for static support lookup tables (2004, background): “They have many uses in networks [2]: for collaborating in overlay and peer-to-peer networks [5, 8, 17], resource routing [15, 26], packet routing [12, 30], and measurement infrastructures [9, 29].”