The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Beberapa algoritma penjadualan telah dicadangkan untuk pautan ke bawah sistem Akses Berbilang Bahagian Kod (CDMA) dengan Kadar Data Tinggi (HDR). Algoritma penjadualan Lagest Weighted Delay First (M-LWDF) yang diubah suai memilih pengguna mengikut keadaan saluran semasa pengguna, kelewatan paket ketua talian pengguna dan keperluan Kualiti Perkhidmatan (QoS) pengguna. Algoritma penjadualan Proportional Fair (PF) juga telah dicadangkan untuk sistem CDMA/HDR dan ia memilih pengguna mengikut nisbah kadar saluran semasa pengguna dan kadar saluran purata pengguna, yang memberikan prestasi yang baik dari segi keadilan. Walau bagaimanapun, apabila trafik kadar bit berubah (VBR) dipertimbangkan di bawah keadaan saluran yang berbeza untuk setiap pengguna, prestasi kedua-dua penjadual menurun. Penjadual M-LWDF tidak dapat menjamin keperluan QoS dicapai dan penjadual PF tidak dapat mencapai keadilan yang baik di kalangan pengguna. Dalam kerja ini, kami mencadangkan algoritma penjadualan baharu untuk meningkatkan prestasi penjadual M-LWDF dan PF. Penjadual yang dicadangkan memilih pengguna mengikut ciri trafik input pengguna, keadaan saluran semasa pengguna dan keperluan QoS pengguna, yang terdiri daripada nilai kelewatan dengan kebarangkalian pelanggaran maksimum. Kami menganggap ungkapan lebar jalur berkesan yang terkenal, yang mengambil kira keperluan QoS pengguna dan ciri trafik input pengguna, untuk memilih pengguna untuk dijadualkan. Sifat algoritma penjadualan yang dicadangkan disiasat melalui simulasi dengan kadar bit malar (CBR) dan aliran VBR dan perbandingan prestasi dengan penjadual M-LWDF dan PF. Keputusan menunjukkan prestasi yang lebih baik bagi penjadual yang dicadangkan berbanding dengan penjadual M-LWDF dan PF.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Augusto FORONDA, Chikara OHTA, Hisashi TAMAKI, "Scheduling Algorithm to Provide QoS over a Shared Wireless Link" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2160-2167, June 2009, doi: 10.1587/transcom.E92.B.2160.
Abstract: Several scheduling algorithms have been proposed for the downlink of a Code Division Multiple Access (CDMA) system with High Data Rate (HDR). Modified Largest Weighted Delay First (M-LWDF) scheduling algorithm selects a user according to the user current channel condition, user head-of-line packet delay and user Quality of Service (QoS) requirement. Proportional Fair (PF) scheduling algorithm has also been proposed for CDMA/HDR system and it selects a user according to the ratio of the user current channel rate and the user average channel rate, which provides good performance in terms of fairness. However, when variable bit rate (VBR) traffic is considered under different channel conditions for each user, both schedulers' performance decrease. M-LWDF scheduler can not guarantee the QoS requirement to be achieved and PF scheduler can not achieve a good fairness among the users. In this work, we propose a new scheduling algorithm to enhance M-LWDF and PF schedulers performance. Proposed scheduler selects a user according to the user input traffic characteristic, user current channel condition and user QoS requirement, which consists of a delay value with a maximum violation probability. We consider the well-known effective bandwidth expression, which takes into account the user QoS requirement and the user input traffic characteristics, to select a user to be scheduled. Properties of the proposed scheduling algorithm are investigated through simulations with constant bit rate (CBR) and VBR flows and performance comparisons with M-LWDF and PF schedulers. The results show a better performance of the proposed scheduler compared with M-LWDF and PF schedulers.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2160/_p
Salinan
@ARTICLE{e92-b_6_2160,
author={Augusto FORONDA, Chikara OHTA, Hisashi TAMAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Scheduling Algorithm to Provide QoS over a Shared Wireless Link},
year={2009},
volume={E92-B},
number={6},
pages={2160-2167},
abstract={Several scheduling algorithms have been proposed for the downlink of a Code Division Multiple Access (CDMA) system with High Data Rate (HDR). Modified Largest Weighted Delay First (M-LWDF) scheduling algorithm selects a user according to the user current channel condition, user head-of-line packet delay and user Quality of Service (QoS) requirement. Proportional Fair (PF) scheduling algorithm has also been proposed for CDMA/HDR system and it selects a user according to the ratio of the user current channel rate and the user average channel rate, which provides good performance in terms of fairness. However, when variable bit rate (VBR) traffic is considered under different channel conditions for each user, both schedulers' performance decrease. M-LWDF scheduler can not guarantee the QoS requirement to be achieved and PF scheduler can not achieve a good fairness among the users. In this work, we propose a new scheduling algorithm to enhance M-LWDF and PF schedulers performance. Proposed scheduler selects a user according to the user input traffic characteristic, user current channel condition and user QoS requirement, which consists of a delay value with a maximum violation probability. We consider the well-known effective bandwidth expression, which takes into account the user QoS requirement and the user input traffic characteristics, to select a user to be scheduled. Properties of the proposed scheduling algorithm are investigated through simulations with constant bit rate (CBR) and VBR flows and performance comparisons with M-LWDF and PF schedulers. The results show a better performance of the proposed scheduler compared with M-LWDF and PF schedulers.},
keywords={},
doi={10.1587/transcom.E92.B.2160},
ISSN={1745-1345},
month={June},}
Salinan
TY - JOUR
TI - Scheduling Algorithm to Provide QoS over a Shared Wireless Link
T2 - IEICE TRANSACTIONS on Communications
SP - 2160
EP - 2167
AU - Augusto FORONDA
AU - Chikara OHTA
AU - Hisashi TAMAKI
PY - 2009
DO - 10.1587/transcom.E92.B.2160
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - Several scheduling algorithms have been proposed for the downlink of a Code Division Multiple Access (CDMA) system with High Data Rate (HDR). Modified Largest Weighted Delay First (M-LWDF) scheduling algorithm selects a user according to the user current channel condition, user head-of-line packet delay and user Quality of Service (QoS) requirement. Proportional Fair (PF) scheduling algorithm has also been proposed for CDMA/HDR system and it selects a user according to the ratio of the user current channel rate and the user average channel rate, which provides good performance in terms of fairness. However, when variable bit rate (VBR) traffic is considered under different channel conditions for each user, both schedulers' performance decrease. M-LWDF scheduler can not guarantee the QoS requirement to be achieved and PF scheduler can not achieve a good fairness among the users. In this work, we propose a new scheduling algorithm to enhance M-LWDF and PF schedulers performance. Proposed scheduler selects a user according to the user input traffic characteristic, user current channel condition and user QoS requirement, which consists of a delay value with a maximum violation probability. We consider the well-known effective bandwidth expression, which takes into account the user QoS requirement and the user input traffic characteristics, to select a user to be scheduled. Properties of the proposed scheduling algorithm are investigated through simulations with constant bit rate (CBR) and VBR flows and performance comparisons with M-LWDF and PF schedulers. The results show a better performance of the proposed scheduler compared with M-LWDF and PF schedulers.
ER -