2011
DOI: 10.1109/tcst.2010.2081671
|View full text |Cite
|
Sign up to set email alerts
|

Robust Active Queue Management for Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
24
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(26 citation statements)
references
References 22 publications
0
24
0
Order By: Relevance
“…Chavan [10] has given the algorithm to calculate the p into seven steps. First, initialize the operating points Wo , qo .…”
Section: Robust Active Queue Managament (R Aqm)mentioning
confidence: 99%
See 3 more Smart Citations
“…Chavan [10] has given the algorithm to calculate the p into seven steps. First, initialize the operating points Wo , qo .…”
Section: Robust Active Queue Managament (R Aqm)mentioning
confidence: 99%
“…Po ,Co then design the controller H fo llowed by measuring the instantaneous queue length of the router at every packet arrival. After determining the deviation queue length �q, change in dropping probability �p may be calculated according to the fo rmula given in equation (2) [10].…”
Section: Robust Active Queue Managament (R Aqm)mentioning
confidence: 99%
See 2 more Smart Citations
“…The robustness property of the H controllers makes them potentially applicable for achieving robust performance despite the network uncertainties in link bandwidth C, RTT, and link load N. The controller introduced in [18] has been designed by assuming that the link bandwidth is the only uncertainty in the network. In addition, the controller has been designed for a wireless network in [19] by assuming varying link bandwidth as the disturbance only. The based controllers have been studied for the AQM using the -optimal approach (e.g., [20]) or the loop-shaping technique (e.g., [21]) to accommodate control plant uncertainties.…”
Section: Introductionmentioning
confidence: 99%