A novel TCP-friendly congestion control with virtual reno and slack term

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a novel TCP-friendly congestion control with Virtual Reno and Slack Term, VRST for short, was proposed. The design objective of VRST is to maintain a smoother sending rate and to be friendly to TCP. VRST maintains a virtual Reno to mimic the TCP Reno behavior. To avoid sawtooth-like rate variation in TCP Reno, a limit on window adaptation is imposed on VRST to prevent drastically reducing or increasing congestion window. Owing to the discrepancy in window adaptation between VRST and virtual Reno, the window compensation is provided. This mechanism first keep track of the difference in window between VRST and virtual Reno, then this difference should be compensated or paid back at some future time, so the aim of TCP-friendliness can be achieved. From the simulation results, in most situations, VRST dose get the almost same throughput with TCP and have a smaller variation in throughput. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Lai, Y. C., & Chen, I. F. (2004). A novel TCP-friendly congestion control with virtual reno and slack term. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3090, 817–826. https://doi.org/10.1007/978-3-540-25978-7_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free