Fair service for mice in the presence of elephants

Authors:
Seth Voorhies;Hyunyoung Lee;Andreas Klappenecker
Affiliations:
Department of Computer Science, University of Denver, Denver, CO;Department of Computer Science, University of Denver, Denver, CO;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
Information Processing Letters
Year:
2006

Citing 4
Cited 0

On self-organizing sequential search heuristics

Communications of the ACM
Operating Systems Theory

Operating Systems Theory
Identifying Long-Term High-Bandwidth Flows at a Router

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived flows known as elephants are present.