2005
DOI: 10.1109/twc.2004.843069
|View full text |Cite
|
Sign up to set email alerts
|

Bandwidth allocation for wireless multimedia systems with most regular sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…WFQ is comparable, it is a packet approximation of Generalized Processor Sharing (GPS) [7], where every session obtains access to the resource, but only for 1/N th of the bandwidth, where N represents the available bandwidth divided by the requested bandwidth. The most interesting related work that we found is [8], which deals with most regular sequences. The authors use a most regular binary sequence (MRBS) to express the requested rates that form a rational fraction of the total available bandwidth.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…WFQ is comparable, it is a packet approximation of Generalized Processor Sharing (GPS) [7], where every session obtains access to the resource, but only for 1/N th of the bandwidth, where N represents the available bandwidth divided by the requested bandwidth. The most interesting related work that we found is [8], which deals with most regular sequences. The authors use a most regular binary sequence (MRBS) to express the requested rates that form a rational fraction of the total available bandwidth.…”
Section: Related Workmentioning
confidence: 99%
“…The next slots are calculated based upon a frequency of 1 2 , thus every two slots. Up till now, 8 16 is scheduled, which is not enough. The , so an extra 1 16 needs to be scheduled.…”
Section: The Algorithmmentioning
confidence: 99%