An efficient bandwidth allocation algorithm for real-time VBR stream transmission under IEEE 802.16 wireless networks

Lin, Chih-Peng; Chen, Jenhui; Chen, Hsing-Lung

doi:10.1016/j.jnca.2010.01.005

Cited by 5 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A previous work [7] has explored rate control strategies for real-time multimedia variable bit rate (VBR) services. It was implemented in IEEE 802.16 broadband wireless networks.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy Logic Tsukamoto for SARIMA On Automation of Bandwidth Allocation

Bustoni¹,

Permanasari²,

Hidayah³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-The wireless network is used in different fields to enhance information transfer between remote areas. In the education area, it can support knowledge transfer among academic member including lecturers, students, and staffs. In order to achieve this purpose, the wireless network is supposed to be well managed to accommodate all users. Department of Electrical Engineering and Information Technology UGM sets wireless network for its daily campus activity manually and monitor data traffic at a time then share it to the user. Thus, it makes bandwidth sharing becomes less effective. This study, build a dynamic bandwidth allocation management system which automatically determines bandwidth allocation based on the prediction of future bandwidth using by implementing Seasonal Autoregressive Integrated Moving Average (SARIMA) with the addition of outlier detection since the result more accurate. Moreover, the determination of fixed bandwidth allocation was done using Fuzzy Logic with Tsukamoto Inference Method. The results demonstrate that bandwidth allocations can be classified into 3 fuzzy classes from quantitative forecasting results. Furthermore, manual and automatic bandwidth allocation was compared. The result on manual allocation MAPE was 70,76% with average false positive value 56 MB, compared to dynamic allocation using Fuzzy Logic and SARIMA which has MAPE 38,9% and average false positive value around 13,84 MB. In conclusion, the dynamic allocation was more effective in bandwidth allocation than manual allocation.

show abstract

“…A previous work [7] has explored rate control strategies for real-time multimedia variable bit rate (VBR) services. It was implemented in IEEE 802.16 broadband wireless networks.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy Logic Tsukamoto for SARIMA On Automation of Bandwidth Allocation

Bustoni¹,

Permanasari²,

Hidayah³

et al. 2017

ijacsa

View full text Add to dashboard Cite

show abstract

“…Some are classical algorithms that were not specifically designed for IEEE 802. 16 but have been applied practically [7][8][9][10]. Among these, weighted round robin (WRR), which differentiates services among various traffic classes, is the most commonly used algorithm, because of its simplicity and low computational cost.…”

mentioning

confidence: 99%

A load-aware weighted round-robin algorithm for IEEE 802.16 networks

Saidu

Subramaniam

Jaafar

et al. 2014

J Wireless Com Network

View full text Add to dashboard Cite

The IEEE 802.16 standard was designed to provide quality-of-service (QoS) guarantees for various classes of traffic with diverse QoS requirements. Packet-scheduling algorithms play a critical role in providing such guarantees. Weighted round robin (WRR) is one of the most commonly used scheduling algorithms, because of its simplicity and low computational overhead. However, it suffers from performance degradation under bursty traffic conditions because of the static weights used to determine packet transmissions. We propose a new packet-scheduling discipline for downlink traffic in 802.16 networks to improve performance in such situations. It dynamically determines the weight of each queue in the various classes based on the current traffic characteristics using the static WRR weight at the beginning of each base station round. The goal is not only to reduce the average delay and packet loss but also to improve average throughput. Simulations are used to evaluate the performance of the proposed algorithm load-aware weighted round robin (LAWRR), and show that it reduces average delay and packet loss, as well as it improves average throughput compared with WRR. The effectiveness of LAWRR running under fixed buffer sizes is also investigated.

show abstract