Scheduling algorithm in a point-to-multipoint broadband wireless access network

Wong, William; Tang, H.; Guo, Shanzeng; Leung, Victor C. M.

doi:10.1109/vetecf.2003.1285293

Cited by 10 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, another approach can be by taking some portion of the bandwidth from the leading flows to the lagging flows. When the error rate is high, a credit history can be built based on the lagging flows and the scheduler can allocate the bandwidth based on the ratio of their credits to theirs minimum reserved rates when the error rate is acceptable [60]. In either case, if and how the compensation mechanism should be put into consideration are still open questions.…”

Section: B Channel-aware Schedulersmentioning

confidence: 99%

Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey

So-In

Jain

Al-Tamimi

2009

IEEE J. Select. Areas Commun.

290

182

View full text Add to dashboard Cite

Abstract-Interest in broadband wireless access (BWA) has been growing due to increased user mobility and the need for data access at all times. IEEE 802.16e based WiMAX networks promise the best available quality of experience for mobile data service users. Unlike wireless LANs, WiMAX networks incorporate several quality of service (QoS) mechanisms at the Media Access Control (MAC) level for guaranteed services for data, voice and video. The problem of assuring QoS is basically that of how to allocate available resources among users in order to meet the QoS criteria such as delay, delay jitter and throughput requirements. IEEE standard does not include a standard scheduling mechanism and leaves it for implementer differentiation. Scheduling is, therefore, of special interest to all WiMAX equipment makers and service providers. This paper discusses the key issues and design factors to be considered for scheduler designers. In addition, we present an extensive survey of recent scheduling research. We classify the proposed mechanisms based on the use of channel conditions. The goals of scheduling are to achieve the optimal usage of resources, to assure the QoS guarantees, to maximize goodput and to minimize power consumption while ensuring feasible algorithm complexity and system scalability.

show abstract

Section: B Channel-aware Schedulersmentioning

confidence: 99%

Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey

So-In

Jain

Al-Tamimi

2009

IEEE J. Select. Areas Commun.

290

182

View full text Add to dashboard Cite

show abstract

“…In many works, e.g. [6], [7], the wireless channel is modeled with two states: error-free and erroneous. Sessions in error state will offer their service share to sessions in the error-free state and claim it back when they switch to the error-free state.…”

Section: Capaninamentioning

confidence: 99%

A Novel Packet Scheduling for Wireless Channels with Adaptive Burst Profile

Nam¹,

Dung²

2008

MIC ICT Research Journal

View full text Add to dashboard Cite

This paper proposes an Adaptive Profile Packet Scheduling (APS) algorithm for the down-link of IEEE 802.16 W-MAN, which is identified as a candidate standard for High Attitude Platforms (HAP) in the EU IST CAPANINA project. The proposed APS takes into account different wireless channel conditions observed by different subscriber stations to enhance the whole system utility and preserves the property of the long-term fairness.

show abstract

“…We have enhanced the static error model used in Reference [7] to a two-state Markov model (from Reference [27]) to emulate the process of packet transmission errors. The channel varies between a 'good' state and a 'bad' state, s0 and s1; respectively, for each packet transmission.…”

Section: Channel Error Modelsmentioning

confidence: 99%

Token bank fair queuing: a new scheduling algorithm for wireless multimedia services

Wong

Tang

Leung

2004

Int J Communication

View full text Add to dashboard Cite

SUMMARYThe token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services. The bandwidth allocation mechanism integrates the leaky bucket structure with priority handling to address the problem of providing quality-of-service (QoS) guarantees to heterogeneous applications in the next generation packet-switched wireless networks. Scheduling algorithms are often tightly integrated with the wireless medium access control (MAC) protocol. However, when heterogeneous wireless systems need to be integrated and interoperate with each other, it is desirable from the QoS provisioning standpoint to decouple scheduling algorithm from the MAC protocol. In this paper we propose a framework of seamless QoS provisioning and the application of TBFQ for uplink and downlink scheduling in wireless networks. We study its performance under a generic medium access framework that enables the algorithm to be generalized to provide QoS guarantees under various medium access schemes. We give a brief analysis of the algorithm and compare its performance with common scheduling algorithms through simulation. Our results demonstrate that TBFQ significantly increases wireless channel utilization while maintaining the same QoS, unlike many fair queuing algorithms, TBFQ does not require timestamping information of each packet arrival}an impractical feature in an already resource scarce environment. This makes TBFQ suitable for wireless multimedia communication.

show abstract

Scheduling algorithm in a point-to-multipoint broadband wireless access network

Cited by 10 publications

References 6 publications

Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey

Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey

A Novel Packet Scheduling for Wireless Channels with Adaptive Burst Profile

Token bank fair queuing: a new scheduling algorithm for wireless multimedia services

Contact Info

Product

Resources

About