A new algorithm for congestion control using non-AIMD approach for real-time streams

K. Prabhakar; T. Sridhar

A new algorithm for congestion control using non-AIMD approach for real-time streams

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other

Abstract

The Additive Increase/Multiplicative Decrease (AIMD) has emerged to be the most stable congestion control algorithm in use in the Internet today. However, emerging applications like real time streams, which demand a lesser drop rate and a smoother window evolution, find these inappropriate. In this paper, we present a new perspective to congestion control by introducing a set of controls that have a constant window size with respect to time and make minor increments or decrements based on the present network condition. This mechanism is both TCP-friendly and achieves a dramatic reduction in oscillations at steady rate.

Original language	English
Title of host publication	The 7th International Conference on Advanced Communication Technology, ICACT 2005
Pages	1015-1018
Number of pages	4
Publication status	Published - 1 Dec 2005
Externally published	Yes
Event	7th International Conference on Advanced Communication Technology, ICACT 2005 - Phoenix Park, Korea, Republic of (South) Duration: 21 Feb 2005 → 23 Feb 2005

Publication series

Name	The 7th International Conference on Advanced Communication Technology, ICACT 2005
Volume	2

Conference

Conference	7th International Conference on Advanced Communication Technology, ICACT 2005
Country	Korea, Republic of (South)
City	Phoenix Park
Period	21/02/05 → 23/02/05

Access to Document

Link to publication in Scopus

Cite this

@inproceedings{a171f8100acb4662af9db04f025b5ab4,

title = "A new algorithm for congestion control using non-AIMD approach for real-time streams",

abstract = "The Additive Increase/Multiplicative Decrease (AIMD) has emerged to be the most stable congestion control algorithm in use in the Internet today. However, emerging applications like real time streams, which demand a lesser drop rate and a smoother window evolution, find these inappropriate. In this paper, we present a new perspective to congestion control by introducing a set of controls that have a constant window size with respect to time and make minor increments or decrements based on the present network condition. This mechanism is both TCP-friendly and achieves a dramatic reduction in oscillations at steady rate.",

author = "K. Prabhakar and T. Sridhar",

year = "2005",

month = dec,

day = "1",

language = "English",

isbn = "8955191235",

series = "The 7th International Conference on Advanced Communication Technology, ICACT 2005",

pages = "1015--1018",

booktitle = "The 7th International Conference on Advanced Communication Technology, ICACT 2005",

note = "7th International Conference on Advanced Communication Technology, ICACT 2005 ; Conference date: 21-02-2005 Through 23-02-2005",

}

Prabhakar, K & Sridhar, T 2005, A new algorithm for congestion control using non-AIMD approach for real-time streams. in The 7th International Conference on Advanced Communication Technology, ICACT 2005., 1462955, The 7th International Conference on Advanced Communication Technology, ICACT 2005, vol. 2, pp. 1015-1018, 7th International Conference on Advanced Communication Technology, ICACT 2005, Phoenix Park, Korea, Republic of (South), 21/02/05.

A new algorithm for congestion control using non-AIMD approach for real-time streams. / Prabhakar, K.; Sridhar, T.

The 7th International Conference on Advanced Communication Technology, ICACT 2005. 2005. p. 1015-1018 1462955 (The 7th International Conference on Advanced Communication Technology, ICACT 2005; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other

TY - GEN

T1 - A new algorithm for congestion control using non-AIMD approach for real-time streams

AU - Prabhakar, K.

AU - Sridhar, T.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - The Additive Increase/Multiplicative Decrease (AIMD) has emerged to be the most stable congestion control algorithm in use in the Internet today. However, emerging applications like real time streams, which demand a lesser drop rate and a smoother window evolution, find these inappropriate. In this paper, we present a new perspective to congestion control by introducing a set of controls that have a constant window size with respect to time and make minor increments or decrements based on the present network condition. This mechanism is both TCP-friendly and achieves a dramatic reduction in oscillations at steady rate.

AB - The Additive Increase/Multiplicative Decrease (AIMD) has emerged to be the most stable congestion control algorithm in use in the Internet today. However, emerging applications like real time streams, which demand a lesser drop rate and a smoother window evolution, find these inappropriate. In this paper, we present a new perspective to congestion control by introducing a set of controls that have a constant window size with respect to time and make minor increments or decrements based on the present network condition. This mechanism is both TCP-friendly and achieves a dramatic reduction in oscillations at steady rate.

UR - http://www.scopus.com/inward/record.url?scp=33744982128&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:33744982128

SN - 8955191235

SN - 9788955191233

T3 - The 7th International Conference on Advanced Communication Technology, ICACT 2005

SP - 1015

EP - 1018

BT - The 7th International Conference on Advanced Communication Technology, ICACT 2005

T2 - 7th International Conference on Advanced Communication Technology, ICACT 2005

Y2 - 21 February 2005 through 23 February 2005

ER -