| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428351 | Information Processing Letters | 2006 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
