2003Unpublished venueRequires access

Improving congestion control performance through loss differentiation

Tae‐Eun Kim, Songwu Lu, V. Bharghavan

Open publisher page 53 citations

Abstract

Linear increase/multiplicative decrease (LIMD) has typically been the congestion control paradigm of choice in the Internet. However, a major drawback of LIMD is that it reacts identically (and aggressively) to all packet losses, irrespective of the cause of loss. In this paper, we try to augment the basic LIMD congestion control with additional mechanisms to predict the cause of packet losses and react accordingly. To this end, we present the LIMD/H algorithm, which has the following features: (a) LIMD/H uses the "history" of packet losses and the evolution of transmission rate for a connection in order to distinguish between congestion-induced and non-congestion-induced packet losses; (b) LIMD/H reacts gently to non-congestion-induced losses and aggressively to congestion-induced losses, thereby achieving high efficiency, fairness, as well as quick reaction to the onset of congestion. We present an initial performance evaluation of LIMD/H using simulations and analysis.

About this research paper

What this paper is about

Linear increase/multiplicative decrease (LIMD) has typically been the congestion control paradigm of choice in the Internet. However, a major drawback of LIMD is that it reacts identically (and aggressively) to all packet losses, irrespective of the cause of loss. In this paper, we try to augment the basic LIMD congestion control with additional mechanisms to predict the cause of packet losses and react accordingly. To this end, we present the LIMD/H algorithm, which has the following features: (a) LIMD/H uses the "history" of packet losses and the evolution of transmission rate for a connection in order to distinguish between congestion-induced and non-congestion-induced packet losses; (b) LIMD/H reacts gently to non-congestion-induced losses and aggressively to congestion-induced losses, thereby achieving high efficiency, fairness, as well as quick reaction to the onset of congestion. We present an initial performance evaluation of LIMD/H using simulations and analysis.

Why it matters

OpenAlex reports 53 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Linear increase/multiplicative decrease (LIMD) has typically been the congestion control paradigm of choice in the Internet. However, a major drawback of LIMD is that it reacts identically (and aggressively) to all packet losses, irrespective of the cause of loss. In this paper, we try to augment the basic LIMD congestion control with additional mechanisms to predict the cause of packet losses and react accordingly. To this end, we present the LIMD/H algorithm, which has the following features: (a) LIMD/H uses the "history" of packet losses and the evolution of transmission rate for a connection in order to distinguish between congestion-induced and non-congestion-induced packet losses; (b) LIMD/H reacts gently to non-congestion-induced losses and aggressively to congestion-induced losses, thereby achieving high efficiency, fairness, as well as quick reaction to the onset of congestion. We present an initial performance evaluation of LIMD/H using simulations and analysis.

Key concepts: Network congestion, Packet loss, Computer science, Computer network, Network packet, Transmission (telecommunications), Telecommunications

Related papers

Back to paper searchBrowse research topicsOriginal source
Improving congestion control performance through loss differentiation — Research Paper | ScholarLens