Sciweavers

13 search results - page 1 / 3
» Core-Stateless Fair Queueing: Achieving Approximately Fair B...
Sort
View
NCA
2005
IEEE
13 years 11 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
INFOCOM
2000
IEEE
13 years 9 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
NETWORKING
2007
13 years 6 months ago
Improving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in ter...
Lei Zan, Xiaowei Yang
DEDS
2002
90views more  DEDS 2002»
13 years 5 months ago
Perturbation Analysis for Stochastic Fluid Queueing Systems
Recent study for congestion control in high speed networks indicates that the derivative information for the congestion at the common buffer for multiple sources could be useful i...
Yong Liu, Weibo Gong