Data networks
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
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
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
FAST TCP: from theory to experiments
IEEE Network: The Magazine of Global Internetworking
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Hi-index | 0.00 |
Traditionally, it had been assumed that the efficiency requirements of TCP dictate that the buffer size at the router must be of the order of the bandwidth-delay (C × RTT) product. Recently, this assumption was questioned in a number of papers, and the rule was shown to be conservative for certain traffic models. In particular, by appealing to statistical multiplexing, it was shown that on a router with N long-lived connections, buffers of size O(C × RTT/√N) or even O(1) are sufficient. In this paper, we reexamine the buffer-size requirements of core routers when flows arrive and depart. Our conclusion is as follows: If the core-to-access-speed ratio is large, then O(1) buffers are sufficient at the core routers; otherwise, larger buffer sizes do improve the flow-level performance of the users. From a modeling point of view, our analysis offers two new insights. First, it may not be appropriate to derive buffer-sizing rules by studying a network with a fixed number of users. In fact, depending upon the core-to-access-speed ratio, the buffer size itself may affect the number of flows in the system, so these two parameters (buffer size and number of flows in the system) should not be treated as independent quantities. Second, in the regime where the core-to-access-speed ratio is large, we note that the O(1) buffer sizes are sufficient for good performance and that no loss of utilization results, as previously believed.