Towards a rate-based TCP protocol for the Web

@article{Ke2000TowardsAR,
  title={Towards a rate-based TCP protocol for the Web},
  author={Jun Ke and Carey L. Williamson},
  journal={Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728)},
  year={2000},
  pages={36-45}
}
  • Jun Ke, C. Williamson
  • Published 29 August 2000
  • Computer Science, Business
  • Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728)
TCP's sliding window flow control mechanism often leads to bursty packet traffic in the Internet. In the presence of network congestion, multiple packet losses can occur degrading the performance of TCP and the user-perceived performance of the Web. This paper presents a rate-based pacing (RBP) mechanism for TCP flow control. This mechanism can reduce the burstiness of TCP packet transmission and improve document transfer performance. Simulation is used to evaluate the performance of this… 

Figures and Tables from this paper

On the Performance of TCP Pacing with DCCP
TLDR
This paper investigates the performance of paced and standard (unpaced) TCP when coexist with DCCP over short and long delay link networks and finds that paced TCP for the entire TCP connection performs better in longdelay link, with smoother throughput and better jitter, whereas in short delay link, there is not much positive effect of using pacing for TCP.
Performance Analysis of TCP Interactive based World Wide Video Streaming over ABone: Jitter and Delay Management
TLDR
This report presents the jitter and delay experiments of the live video streaming results to selected nodes in the U.S. and Europe and the detail results from application level video quality experiments.
LAS scheduling to improve the performance of short TCP Flows
TLDR
This work proposes to use the least attained service(LAS) policy to improve the overall performance perceived by the users and shows that under LAS scheduling, the transmis sion time and loss rate for short TCP flows are significantly reduced, with only a negligible increas as in transmission time for the largest flows.
TCP-polite rate control based on cooperative measurement
TLDR
Simulation results show that TPRC scheme outperforms TCP and TCP-friendly rate control protocol in terms of fast-start, efficiency, and fairness.
Experimental evaluation of TCP performance in multi-hop wireless ad hoc networks
  • Abhinav Gupta, Ian Wormsbecker, C. Williamson
  • Business, Computer Science
    The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings.
  • 2004
TLDR
Experimental measurements of TCP bulk data transfer performance in a multi-hop wireless ad hoc network environment show no performance advantages for RBP TCP in the authors' experimental scenarios.
On randomizing the sending times in TCP and other window based algorithms
Analyzing the performance of tcp flows in packet networks with las schedulers
TLDR
It is shown that under LAS scheduling, as compared to FIFO, the transmission time and loss rate for short TCP flows are significantly reduced, with a negligible increase in transmission time for the largest flows.
Performance Analysis of TCP and SCTP For Congestion Losses In
TLDR
SCTP transmission control protocol has been implemented for the system performance of the system and 4-handshake communication in the message transmit increases and this also provides communication services over multi-streaming and multi-homing.
A case for context-aware TCP/IP
TLDR
Using CATNIP context information at IP touters can reduce mean Web page retrieval times by 20-80%, and the standard deviation by 60-90%.
...
1
2
3
...

References

SHOWING 1-10 OF 26 REFERENCES
Understanding the performance of TCP pacing
  • Amit Aggarwal, S. Savage, T. Anderson
  • Computer Science, Business
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
It is shown that contrary to intuition, pacing often has significantly worse throughput than regular TCP because it is susceptible to synchronized losses and it delays congestion signals.
An evaluation of TCP with larger initial windows
TLDR
This paper evaluates a proposed performance enhancement that raises the initial window used by TCP from 1 MSS-sized segment to roughly 4 KB, and evaluates the impact of using larger initial windows on TCP transfers over both the shared Internet and dialup modem links.
TCP behavior of a busy Internet server: analysis and improvements
  • H. Balakrishnan, V. Padmanabhan, S. Seshan, M. Stemm, R. Katz
  • Computer Science
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
TLDR
Simulations and trace analysis show that the enhanced loss recovery scheme could have eliminated 25% of all timeout events, and that the integrated approach provides greater fairness and improved startup performance for concurrent connections.
Improving the start-up behavior of a congestion control scheme for TCP
TLDR
Changes to the Fast Retransmit algorithm are proposed so that it can quickly recover from multiple packet losses without waiting unnecessarily for the timeout, showing significant performance improvements, especially for short TCP transfers.
Improving Restart of Idle TCP Connections
TLDR
This paper proposes a third alternative: pacing some packets at a certain rate until the ACK clock can be restarted, and describes the motivation and implementation and simulation results which show that it achieves the elapsed-time performance comparable to NSSR and loss behavior of SSR.
TCP Fast Start: A Technique For Speeding Up Web Transfers
TLDR
A new technique, which is called TCP fast start, to speed up short Web transfers, and to shield the network as a whole from the ill-effects of stale information, packets sent during the fast start phase are assigned a higher drop priority than other packets.
A new scheme for TCP congestion control: smooth-start and dynamic recovery
  • Haining Wang, C. Williamson
  • Computer Science
    Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)
  • 1998
TLDR
The simulation results show that the new scheme performs at least as well as SACK and FACK TCP, which in turn consistently outperform TCP Tahoe and Reno.
TCP and Successive Fast Retransmits
TLDR
A long-standing problem for cur-rent Tahoe and Reno TCP implementations that results from invoking Fast Retransmit more than once in one roundtriptime is pointed out.
TCP Vegas: New Techniques for Congestion Detection and Avoidance
TLDR
This paper motivates and describes the three key techniques employed by Vegas, and presents the results of a comprehensive experimental performance study—using both simulations and measurements on the Internet— of the Vegas and Reno implementations of TCP.
Simulation-based comparisons of Tahoe, Reno and SACK TCP
TLDR
The congestion control algorithms in the simulated implementation of SACK TCP are described and it is shown that while selective acknowledgments are not required to solve Reno TCP's performance problems when multiple packets are dropped, the absence of selective acknowledgements does impose limits to TCP's ultimate performance.
...
1
2
3
...