Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

SIGCOMM
1998
ACM

favoriteEmaildiscussreport

88views Communications» more SIGCOMM 1998»

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks

13 years 9 months ago

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks

Download web.cs.wpi.edu

Ion Stoica, Scott Shenker, Hui Zhang

Real-time Traffic

Communications | SIGCOMM 1998 |

claim paper

Related Content

» A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ

» Rainbow Fair Queueing Fair Bandwidth Sharing Without PerFlow State

» Improving XCP to Achieve MaxMin Fair Bandwidth Allocation

» Perturbation Analysis for Stochastic Fluid Queueing Systems

» A SenderSide TCP Enhancement for Startup Performance in HighSpeed LongDelay Networks

» A Compound TCP Approach for HighSpeed and Long Distance Networks

» TCPIllinois a loss and delaybased congestion control algorithm for highspeed networks

» On the Design of Load Factor based Congestion Control Protocols for NextGeneration Network...

» Implementation and Performance Analysis of a Packet Scheduler on a Programmable Network Pr...

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	SIGCOMM
Authors	Ion Stoica, Scott Shenker, Hui Zhang

Comments (0)