Beyond AIMD: Explicit fair-share calculation

Paul C. Attie; Adrian Lahanas; Vassilis Tsaoussidis

doi:10.1109/ISCC.2003.1214204

Beyond AIMD: Explicit fair-share calculation

Paul C. Attie, Adrian Lahanas, Vassilis Tsaoussidis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

16 Scopus citations

Abstract

We introduce an alternative approach to congestion avoidance and control, which has the potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal congestion avoidance and control, is based on the principles of TCP's additive increase multiplicative decrease. It is designed to better exploit the system properties during equilibrium, without trading off responsiveness for smoothness. In addition, it is capable of achieving convergence to fairness in only two congestion cycles. As a result, both efficiency and fairness are improved, responsiveness is not degraded, and smoothness is significantly improved when the system is in equilibrium. We provide a theoretical analysis and we discuss the potential of our approach for packet networks. Our experiments confirm that bimodal congestion avoidance and control as a component of the transmission control protocol outperforms the traditional scheme.

Original language	English (US)
Title of host publication	Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003
Pages	727-734
Number of pages	8
DOIs	https://doi.org/10.1109/ISCC.2003.1214204
State	Published - Dec 1 2003
Externally published	Yes
Event	8th IEEE International Symposium on Computers and Communication, ISCC 2003 - Kemer-Antalya, Turkey Duration: Jun 30 2003 → Jul 3 2003

Publication series

Name	Proceedings - IEEE Symposium on Computers and Communications
ISSN (Print)	1530-1346

Conference

Conference	8th IEEE International Symposium on Computers and Communication, ISCC 2003
Country/Territory	Turkey
City	Kemer-Antalya
Period	6/30/03 → 7/3/03

ASJC Scopus subject areas

Software
Signal Processing
General Mathematics
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1109/ISCC.2003.1214204

Cite this

Beyond AIMD: Explicit fair-share calculation. / Attie, Paul C.; Lahanas, Adrian; Tsaoussidis, Vassilis.
Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003. 2003. p. 727-734 1214204 (Proceedings - IEEE Symposium on Computers and Communications).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Attie, PC, Lahanas, A & Tsaoussidis, V 2003, Beyond AIMD: Explicit fair-share calculation. in Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003., 1214204, Proceedings - IEEE Symposium on Computers and Communications, pp. 727-734, 8th IEEE International Symposium on Computers and Communication, ISCC 2003, Kemer-Antalya, Turkey, 6/30/03. https://doi.org/10.1109/ISCC.2003.1214204

@inproceedings{1c72936d1d32483794d44cad6d47ce86,

title = "Beyond AIMD: Explicit fair-share calculation",

abstract = "We introduce an alternative approach to congestion avoidance and control, which has the potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal congestion avoidance and control, is based on the principles of TCP's additive increase multiplicative decrease. It is designed to better exploit the system properties during equilibrium, without trading off responsiveness for smoothness. In addition, it is capable of achieving convergence to fairness in only two congestion cycles. As a result, both efficiency and fairness are improved, responsiveness is not degraded, and smoothness is significantly improved when the system is in equilibrium. We provide a theoretical analysis and we discuss the potential of our approach for packet networks. Our experiments confirm that bimodal congestion avoidance and control as a component of the transmission control protocol outperforms the traditional scheme.",

author = "Attie, {Paul C.} and Adrian Lahanas and Vassilis Tsaoussidis",

year = "2003",

month = dec,

day = "1",

doi = "10.1109/ISCC.2003.1214204",

language = "English (US)",

isbn = "076951961X",

series = "Proceedings - IEEE Symposium on Computers and Communications",

pages = "727--734",

booktitle = "Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003",

note = "8th IEEE International Symposium on Computers and Communication, ISCC 2003 ; Conference date: 30-06-2003 Through 03-07-2003",

}

TY - GEN

T1 - Beyond AIMD

T2 - 8th IEEE International Symposium on Computers and Communication, ISCC 2003

AU - Attie, Paul C.

AU - Lahanas, Adrian

AU - Tsaoussidis, Vassilis

PY - 2003/12/1

Y1 - 2003/12/1

N2 - We introduce an alternative approach to congestion avoidance and control, which has the potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal congestion avoidance and control, is based on the principles of TCP's additive increase multiplicative decrease. It is designed to better exploit the system properties during equilibrium, without trading off responsiveness for smoothness. In addition, it is capable of achieving convergence to fairness in only two congestion cycles. As a result, both efficiency and fairness are improved, responsiveness is not degraded, and smoothness is significantly improved when the system is in equilibrium. We provide a theoretical analysis and we discuss the potential of our approach for packet networks. Our experiments confirm that bimodal congestion avoidance and control as a component of the transmission control protocol outperforms the traditional scheme.

AB - We introduce an alternative approach to congestion avoidance and control, which has the potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal congestion avoidance and control, is based on the principles of TCP's additive increase multiplicative decrease. It is designed to better exploit the system properties during equilibrium, without trading off responsiveness for smoothness. In addition, it is capable of achieving convergence to fairness in only two congestion cycles. As a result, both efficiency and fairness are improved, responsiveness is not degraded, and smoothness is significantly improved when the system is in equilibrium. We provide a theoretical analysis and we discuss the potential of our approach for packet networks. Our experiments confirm that bimodal congestion avoidance and control as a component of the transmission control protocol outperforms the traditional scheme.

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

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

U2 - 10.1109/ISCC.2003.1214204

DO - 10.1109/ISCC.2003.1214204

M3 - Conference contribution

AN - SCOPUS:34648829960

SN - 076951961X

SN - 9780769519616

T3 - Proceedings - IEEE Symposium on Computers and Communications

SP - 727

EP - 734

BT - Proceedings - 8th IEEE International Symposium on Computers and Communication, ISCC 2003

Y2 - 30 June 2003 through 3 July 2003

ER -

Beyond AIMD: Explicit fair-share calculation

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this