Performance analysis of TCP-friendly AIMD algorithms for multimedia applications

被引：65

作者：

Cai, L ^{[1
]}

Shen, XM ^{[1
]}

Pan, JP ^{[1
]}

Mark, JW ^{[1
]}

机构：

[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada

来源：

IEEE TRANSACTIONS ON MULTIMEDIA | 2005年 / 7卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

congestion control; internet; multimedia; AIMD; quality-of-service; TCP-friendly;

D O I：

10.1109/TMM.2005.843360

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, the performance of TCP-friendly generic AIMD (Additive Increase and Multiplicative Decrease) algorithms for Web-based playback and multirate multimedia applications is investigated. The necessary and sufficient TCP-friendly condition is derived, and the effectiveness and responsiveness of AIMD are studied. Due to practical implications, a Dynamic TCP-friendly AIMD (DTAIMD) algorithm is proposed. Extensive simulation results are given to verify the derived necessary and sufficient condition, and to demonstrate the performance of the proposed DTAIMD algorithm.

引用

页码：339 / 355

页数：17

共 21 条

[1]

[Anonymous], 2018 IETF RFC

[2]

[Anonymous], P ACM SIGCOMM 98

[3]

BANSAL D, 2000, MITLCSTR806

[4] ANALYSIS OF THE INCREASE AND DECREASE ALGORITHMS FOR CONGESTION AVOIDANCE IN COMPUTER-NETWORKS [J].

CHIU, DM ;

JAIN, R .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1989, 17 (01) :1-14

[5]

FFOYD S, 2000, P ACM SIGCOMM 2000, P43

[6] Promoting the use of end-to-end congestion control in the Internet [J].

Floyd, S ;

Fall, K .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (04) :458-472

[7] Random Early Detection Gateways for Congestion Avoidance [J].

Floyd, Sally ;

Jacobson, Van .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (04) :397-413

[8]

Floyd Sally., 1999, The newreno modification to tcp's fast recovery algorithm

[9]

Jacobson V., 1988, Computer Communication Review, V18, P314, DOI 10.1145/52325.52356

[10]

KARANDIKAR S, 2000, ACM COMPUT COMMUN RE, V30

← 1 2 3 →