Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)
DOI: 10.1109/icon.2004.1409276
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive scheduling using the revenue-based weighted round robin

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…In [21], an adaptive scheduling scheme using the revenue-based WRR is presented. This proposal has been considered for guaranteeing the maximum service provider revenue.…”
Section: Related Workmentioning
confidence: 99%
“…In [21], an adaptive scheduling scheme using the revenue-based WRR is presented. This proposal has been considered for guaranteeing the maximum service provider revenue.…”
Section: Related Workmentioning
confidence: 99%
“…This work proposes a resource allocation model considering the average queue size, which is calculated using a low-pass filter. In [8], an adaptive scheduling scheme using the revenue-based WRR is presented. This proposal has been considered for guaranteeing the maximum service provider revenue.…”
Section: Related Workmentioning
confidence: 99%
“…the mean packet size [6], queue sizes [7], revenue-based [8]). In this paper, we propose to use the current capacity of the DVB-S2 satellite link (C OUT ) as the main criteria for the allocation of network resources.…”
Section: The Adaptive Wrr Algorithmmentioning
confidence: 99%
“…Many other modifications to WRR have been suggested in research literature. Improvement in average delay and throughput with large service round is discussed in [11] whereas [12] suggests a revenue based criterion is to adjust weight to allocate resources in optimum way that maximizes total revenue. In other work [13], negative deficit weighted round robin (N-DWRR) is proposed which schedules packets based on credit, negative credit and packet size to improve the bandwidth utilization rate without increasing the total latency.…”
Section: Figure 2 Operation Of Multiclass Wrr With Minicyclesmentioning
confidence: 99%