Sciweavers

IPL
2006
61views more  IPL 2006»
13 years 4 months ago
Fair service for mice in the presence of elephants
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 f...
Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker
NCA
2005
IEEE
13 years 10 months ago
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
Peng Wang, David L. Mills