SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Dummynet: a simple approach to the evaluation of network protocols
ACM SIGCOMM Computer Communication Review
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Understanding the performance of many TCP flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Beyond AIMD: Explicit Fair-share Calculation
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Variability in TCP round-trip times
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
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
Link Buffer Sizing: A New Look at the Old Problem
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
ABS: Adaptive buffer sizing for heterogeneous networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
AIST: insights into queuing and loss on highly multiplexed links
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Hi-index | 0.00 |
The problem of determining the optimal buffer size for an Internet link has recently attracted the strong revived attention of networking scientists. While consonant in dissenting from the conventional wisdom to set the buffer size to the product of the link bitrate and round-trip propagation delay of served connections, the new studies often propose alternative guidelines that starkly contradict each other. In this paper, we review the problem of link buffer sizing from two simulation perspectives. First, we use the packet-level simulator ns-2, which is currently the predominant tool for evaluation of network designs, to explore the contradictions between the buffer sizing guidelines. We attribute the contradictions to differences in assumptions and goals of the earlier studies and present our own argument for using small constant buffer sizes. Second, we reflect on the suitability of ns-2 itself for studying the problem of link buffer sizing. We the identify ns-2 deficiencies that undermine the trustworthiness of results provided by this prevailing simulation tool. We also suggest directions and discuss challenges for designing a simulation methodology capable of providing undisputed answers on link buffer sizing.