Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Automated packet trace analysis of TCP implementations
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
An evaluation of TCP with larger initial windows
ACM SIGCOMM Computer Communication Review
On the generation and use of TCP acknowledgments
ACM SIGCOMM Computer Communication Review
On estimating end-to-end network path properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the effective evaluation of TCP
ACM SIGCOMM Computer Communication Review
TCP congestion control with a misbehaving receiver
ACM SIGCOMM Computer Communication Review
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Measuring the evolution of transport protocols in the internet
ACM SIGCOMM Computer Communication Review
TCP smart framing: a segmentation algorithm to reduce TCP latency
IEEE/ACM Transactions on Networking (TON)
Designing DCCP: congestion control without reliability
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Alpine: a user-level infrastructure for network protocol development
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Protecting TCP from a misbehaving receiver
International Journal of Network Management
Auto-protection of 802.11 networks from TCP ACK division
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Measuring and evaluating TCP splitting for cloud services
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
TCP slow start with fair share of bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking
Overclocking the Yahoo!: CDN for faster web page loads
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Impact of traffic load on SCTP failovers in SIGTRAN
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Management of parallel UBR flows over TCP in congested ATM networks
Computer Communications
Hi-index | 0.00 |
TCP's delayed acknowledgment algorithm has been shown to hurt TCP performance. One method of gaining the performance lost by reducing the number of acknowledgments sent is to use a limited byte counting algorithm. However, we show that as outlined in [All98], limited byte counting is too aggressive in some situations. This paper defines an appropriate byte counting algorithm to fix this aggressiveness. This paper shows that appropriate byte counting is a better overall algorithm. In addition, a scaled version of the appropriate byte counting algorithm, which provides finer-grained control over the aggressiveness of the algorithm, is outlined. In addition, unlike previous work this paper considers the impact of byte counting flows on competing traffic and shows that it is not fundamentally unfair to competing flows that do not use the new algorithm.