In this paper, we propose a router-based congestion avoidance mechanism (RoVegas) for TCP Vegas. TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas outperforms TCP Reno in many aspects. However, TCP Vegas suffers several problems that inhere in its congestion avoidance mechanism, these include issues of rerouting, persistent congestion, fairness, and network asymmetry. By performing the proposed scheme in routers along the round-trip path, RoVegas can solve the problems of rerouting and persistent congestion, enhance the fairness among the competitive connections, and improve the throughput when congestion occurs on the backward path. Through the results of both analysis and simulation, we demonstrate the effectiveness of RoVegas.

Performance improvement of congestion avoidance mechanism for TCP Vegas

https://ir.nctu.edu.tw:443/bitstream/11536/25758/1/000223821900006.pdf

RoVegas: a router-based congestion avoidance mechanism for TCP Vegas

In a general network, it is not easy to find according to which
criterion the available bandwidth would be shared between
competing flows. In this paper, we propose a technique to find the
bandwidth sharing scheme of end-to-end congestion control
protocols. This technique divides the analysis work into two
separate steps. In the first step, one should find the rate
function, which expresses the relation between the throughput and
the congestion measure. In the second step, the utility function
can be obtained from the rate function.

Bandwidth Sharing Scheme of End-to-End Congestion Control Protocols

/pdf/study-and-design-of-tcp-congestion-control-techniques-23atq9ohjz.pdf

Study and Design of TCP Congestion Control Techniques

Abstract: In Software-Defined Networking (SDN), even though centralized information on network condition is available at the controller, this information is not used to improve network condition when congestion happens. SDN requires policy embedded in the controller to manage its network, e.g., strategy for network resource allocation. In this paper, we propose an optimal rate allocation schemes to support congestion control in SDN. Congestion control and rate allocation are like two sides of the same coin. Optimal rate allocation can reduce congestion probability, such that a complicated congestion control is not required. This rate allocation is based on mathematical optimization using three optimization criteria, i.e., minimization on mean transmission time, minimization on standard deviation, and allocation based on proportional rate allocation. The minimization problem for mean and standard deviation are solved using Lagrange method, while proportional rate allocation problem is solved using linear equation. The simulation results show that our proposed formula for rate allocation schemes using rate information provides better performance compared to rate allocation schemes without rate information.

/pdf/optimal-rate-allocation-for-congestion-control-support-in-27k9fipmp6.pdf

Optimal Rate Allocation for Congestion Control Support in SDN

This paper concerns the fairness of TCP Vegas, a new version of TCP proposed by Brakmo et al, (1994) Firstly, we show some uncertainties in bandwidth allocation and buffer occupancy when the system is in the stable state These uncertainties come from the using of two threshold values (/spl alpha/, /spl beta/) in the applied innovative congestion avoidance mechanism We propose a modification in the existing implementations of TCP Vegas to reduce the uncertainties without losing the stability Secondly, the notion of the ideal TCP Vegas, which has no uncertainties, is defined We prove that the ideal TCP Vegas is exactly proportionally fair in bandwidth sharing This property of the real TCP Vegas is tested by simulation We also show how to implement weighted proportional fairness with TCP Vegas

On the proportional fairness of TCP Vegas

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

J. Biro

Author Tools

Chat about Author

Papers

On the proportional fairness of TCP Vegas