Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
A mean-field analysis of short lived interacting TCP flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Link Buffer Sizing: A New Look at the Old Problem
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
Fairness, QoS, and buffer sizing
ACM SIGCOMM Computer Communication Review
On queue provisioning, network efficiency and the transmission control protocol
IEEE/ACM Transactions on Networking (TON)
Experimental study of router buffer sizing
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Anomalous loss performance for mixed real-time and TCP traffic in routers with very small buffers
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Buffer sizing in Internet routers is a fundamental problem that has major consequences in the design, implementation, and economy of the routers, as well as on the performance observed by the end users. Recently, there have been some seemingly contradictory results on buffer sizing. On the one hand, Appenzeller et al. show that as a direct consequence of desynchronization of flows in the core of the Internet, buffer sizes in core routers can be significantly reduced without any major degradation in network performance. On the other hand, Raina and Wischik show that such reduction in buffer sizing comes at the cost of synchronization and thus instability in the network. This work unifies these results by studying the effects of fairness in buffer sizing. We show that the main difference arises from the implicit assumption of fairness in packet dropping in the latter result.We demonstrate that desynchronization among flows observed by Appenzeller et al. is caused by unfair packet dropping when a combination of TCP-Reno and the drop-tail queue management is used. We also show that bringing fairness in packet dropping will introduce synchronization among flows, and will make the system unstable as predicted by Raina and Wischik. Our analysis suggests that there is an intrinsic trade-off between fairness in packet drops and desynchronization among TCP-Reno flows when routers use the drop-tail queue management. Achieving fairness, desynchronization, small buffer size, and 100% link utilization at the same time is desirable and feasible yet challenging. The studies in this paper provide insights for further explorations in reaching this goal.