2003
DOI: 10.1109/mwc.2003.1209591
|View full text |Cite
|
Sign up to set email alerts
|

Soft QoS provisioning using the token bank fair queuing scheduling algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(20 citation statements)
references
References 10 publications
0
20
0
Order By: Relevance
“…Real-time schedules are designed for time-critical multimedia applications and tasks sets [29]. They can perform well in an ideal network with predictable workload.…”
Section: Proposed Scheduling Schemementioning
confidence: 99%
See 1 more Smart Citation
“…Real-time schedules are designed for time-critical multimedia applications and tasks sets [29]. They can perform well in an ideal network with predictable workload.…”
Section: Proposed Scheduling Schemementioning
confidence: 99%
“…Wireless links generally possess characteristics that are quite different from those of wired links. They are subject to time-and location-dependent signal attenuation, fading, interference, and noise, which result in burst errors and time-varying channel capacities [1,29]. To apply such algorithms to wireless networks, fault-tolerant and energy-efficient scheduling scheme need to be provided.…”
Section: Introductionmentioning
confidence: 99%
“…The dynamical barrier problem has birth on such essential reason as dynamical instability of the well-known parallel processing reservation MAC schemes with the defined or fixed superframe formats (SFR) [7][8][9]. The protocol capacity of these methods is )…”
Section: Requirements To the Distributed Multifunctional Macmentioning
confidence: 99%
“…Wireless links generally possess characteristics that are quite different from those of wired links. They are subject to time-and location-dependent signal attenuation, fading, interference, and noise, which result in burst errors and time-varying channel capacities [6] . To apply such algorithms to wireless networks, fault-tolerant and energy-efficient scheduling scheme need to be provided.…”
Section: Introductionmentioning
confidence: 99%