2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications 2008
DOI: 10.1109/infocom.2007.137
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Bandwidth Request-Allocation Algorithm for Real-Time Services in IEEE 802.16 Broadband Wireless Access Networks

Abstract: The emerging broadband wireless access (BWA) technology based on IEEE 802.16 is one of the most promising solutions to provide ubiquitous wireless access to the broadband service at low cost. This paper proposes an efficient uplink bandwidth request-allocation algorithm for variable-rate realtime services in IEEE 802.16 BWA networks. In order to minimize bandwidth wastage without degrading quality of service (QoS), we introduce a notion of target delay and propose dual feedback architecture. The proposed algor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 5 publications
(8 reference statements)
0
8
0
Order By: Relevance
“…Vinel et al [15] computed the mean delay of the bandwidth request in the IEEE 802.16d/e by two-dimensional Markov chain model under the unicast polling scheme with the error-prone wireless channel and the unsaturated condition. As for the proposed bandwidth request schemes to support QoS in IEEE 802.16d/e, we refer to [16][17][18][19][20].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Vinel et al [15] computed the mean delay of the bandwidth request in the IEEE 802.16d/e by two-dimensional Markov chain model under the unicast polling scheme with the error-prone wireless channel and the unsaturated condition. As for the proposed bandwidth request schemes to support QoS in IEEE 802.16d/e, we refer to [16][17][18][19][20].…”
Section: Related Workmentioning
confidence: 99%
“…, whose formula along with (17) and (18) is of the same form (taking M → ∞) as in [15], which derived only the mean delay of request packets. Meanwhile, we are interested in the mean delay of a successful transmitted packet.…”
Section: Analysis For the Unicast Pollingmentioning
confidence: 99%
“…Due to the lack of standards for bandwidth requestallocation algorithms, previous studies [2]- [3] focus on designing an uplink bandwidth request algorithm for the polling services. These efforts are aimed at minimizing the bandwidth wastage or PDU dropping probability.…”
Section: Introductionmentioning
confidence: 99%
“…However, the deficiency of the proposed model is that allocation is performed on a frame basis, which introduces a lot of signaling overhead. Another study [3] proposes a bandwidth request algorithm to minimize bandwidth wastage in ertPS polling services. In this design, the bandwidth allocation interval equals the packetized interval of the real-time service.…”
Section: Introductionmentioning
confidence: 99%
“…A unit change in the time-utility function indicates an urgency for the scheduling of packets as time passes, i.e., the timeliness of the timing constraint often implies that tasks should be completed by a certain given time, with the scheduling urgency being expressed as a delay function. Park et al (2008) introduced a scheduling algorithm in IEEE 802.16 broadband wireless networks, they mainly focus on the QoS architecture and bandwidth request algorithm to satisfy diverse QoS requirements in a subscriber station.…”
Section: Introductionmentioning
confidence: 99%