Publication

A Note on the Fairness of TCP Vegas

Jean-Yves Le Boudec
1999
Reports

Abstract

We study the fairness of TCP Vegas. The latter is an alternative to the commonly used TCP Reno, and uses measures of the round trip time as feedback on congestion. We consider two cases that depend on the value of the two parameters $\alpha$ and $\beta$ controlling the window sizes' update. Our main conclusion is that TCP Vegas is unfair in several points. First, when $\alpha = \beta$ , if the propagation delays are correctly estimated, TCP Vegas is known to be fair. However we show that any over-estimation of the propagation delay of a given connection results in an increase of its rate and hence leads to unfairness. This rate increase augments with the over-estimation factor. Moreover, the rate oscillations, whose amplitude increases with the rate value, are not sufficient to provide an accurate estimation of the propagation delay. Second, when $\alpha

Official source

https://infoscience.epfl.ch/entities/publication/e46fd009-1624-4140-8504-c313b00f0f1e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jean-Yves Le Boudec
1999
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/e46fd009-1624-4140-8504-c313b00f0f1e

About this result

Related concepts (32)

Round-trip delay

In telecommunications, round-trip delay (RTD) or round-trip time (RTT) is the amount of time it takes for a signal to be sent plus the amount of time it takes for acknowledgement of that signal having been received. This time delay includes propagation times for the paths between the two communication endpoints. In the context of computer networks, the signal is typically a data packet. RTT is also known as ping time, and can be determined with the ping command.

Signal propagation delay

Propagation delay is the time duration taken for a signal to reach its destination. It can relate to networking, electronics or physics. In computer networks, propagation delay is the amount of time it takes for the head of the signal to travel from the sender to the receiver. It can be computed as the ratio between the link length and the propagation speed over the specific medium. Propagation delay is equal to d / s where d is the distance and s is the wave propagation speed. In wireless communication, s=c, i.

Connection (mathematics)

In geometry, the notion of a connection makes precise the idea of transporting local geometric objects, such as tangent vectors or tensors in the tangent space, along a curve or family of curves in a parallel and consistent manner. There are various kinds of connections in modern geometry, depending on what sort of data one wants to transport. For instance, an affine connection, the most elementary type of connection, gives a means for parallel transport of tangent vectors on a manifold from one point to another along a curve.

Related publications (1)

A Note on the Fairness of TCP Vegas

Chat with Graph Search

Explore the past to improve the Future: How can airlines benefit from historical data?