2002
DOI: 10.1049/el:20020079
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic deficit round-robin scheduling scheme for variable-length packets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2003
2003
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 1 publication
0
11
0
Order By: Relevance
“…16 standard. An overview of some of these approaches can be found in [3][4][5][6][7][8]. They can be divided into categories to define the requirements, such as parameters that indicate quality of service and mechanisms that act over these parameters.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…16 standard. An overview of some of these approaches can be found in [3][4][5][6][7][8]. They can be divided into categories to define the requirements, such as parameters that indicate quality of service and mechanisms that act over these parameters.…”
Section: Related Workmentioning
confidence: 99%
“…However, in [1,2] the authors have focused mainly on the scheduling issues and components of the QoS architecture without presenting any exact method. Several research works propose using complex scheduler, such as earliest deadline first (EDF), deficit round robin (DRR) [3], weighted fair queuing (WFQ) [4], weighted fair queuing with decoupled bandwidth [5], and even a hierarchy of schedulers. However, it is a challenging task to use a hierarchy of schedulers because the per-connection QoS requirements must be translated into the scheduler configuration at each level.…”
Section: Introductionmentioning
confidence: 99%
“…To identify and classify the traffic, the traffic classification mechanism requires some forms of tagging or marking of packets. The 802.16d MAC provides QoS differentiation for different types of applications that might operate over 802.16 networks that define the following types of services [9,10,11,12]:…”
Section: Ieee 80216 Service Classesmentioning
confidence: 99%
“…For a Geo/Geo/1 system in which , a direct outcome of the steady-state balance equation for the case of early arrival can thus be written as (4) where the term expresses the probability that the queue was empty prior to the arrival phase and no cell has arrived. When rearranged, (4) yields the well-known result for Geo/Geo/1 systems [8] (5)…”
Section: Notation and Queueing Model Formulationmentioning
confidence: 99%