The physics of the Mt/G/ ∞ symbol Queue
Operations Research
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An ABR Feedback Control Scheme with Tracking
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Part I: buffer sizes for core routers
ACM SIGCOMM Computer Communication Review
Part II: control theory for buffer sizing
ACM SIGCOMM Computer Communication Review
Part III: routers with very small buffers
ACM SIGCOMM Computer Communication Review
Why flow-completion time is the right metric for congestion control
ACM SIGCOMM Computer Communication Review
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Building a RCP (Rate Control Protocol) Test Network
HOTI '07 Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Resource management in wide-area ATM networks using effective bandwidths
IEEE Journal on Selected Areas in Communications
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
FCP: a flexible transport framework for accommodating diversity
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.00 |
Buffer sizing has received a lot of attention recently since it is becoming increasingly difficult to use large buffers in highspeed routers. Much of the prior work has concentrated on analyzing the amount of buffering required in core routers assuming that TCP carries all the data traffic. In this paper, we evaluate the amount of buffering required for RCP on a single congested link, while explicitly modeling flow arrivals and departures. Our theoretical analysis and simulations indicate that buffer sizes of about 10% of the bandwidth-delay product are sufficient for RCP to deliver good performance to end-users.