2007
DOI: 10.1016/j.comcom.2006.11.007
|View full text |Cite
|
Sign up to set email alerts
|

Local and global stability of TCP-newReno/RED with many flows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…Recently, many AQM algorithms such as REM, RED and AVQ have been studied extensively, and some significant work has been carried out (see, for example, [4][5][6][7][8][9][10][11][12][13][14][15][16]). In [4], S. Liu et al proposed and investigated a kind of new AQM algorithm, i.e., exponential random early detection (RED) algorithm in which the packet marking probability is set to be an exponential function of the length of a virtual queue.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, many AQM algorithms such as REM, RED and AVQ have been studied extensively, and some significant work has been carried out (see, for example, [4][5][6][7][8][9][10][11][12][13][14][15][16]). In [4], S. Liu et al proposed and investigated a kind of new AQM algorithm, i.e., exponential random early detection (RED) algorithm in which the packet marking probability is set to be an exponential function of the length of a virtual queue.…”
Section: Introductionmentioning
confidence: 99%
“…Ranjan et.al have analyzed Kelly's optimization framework for a rate allocation problem and provide stability conditions with arbitrary fixed communication delays [8]. In [9], Wang and Eun have studied the local and global stability of TCP-newReno/RED under many flows. Moreover, it is also of interest to find what will happen when the congestion control system loses its stability.…”
Section: Introductionmentioning
confidence: 99%