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
Algoritma julat membolehkan stesen aktif mengukur jaraknya ke hujung kepala untuk tujuan penyegerakan dalam rangkaian Hybrid Fiber Coax (HFC). Mekanisme yang boleh dipraktikkan untuk menyelesaikan perbalahan antara banyak stesen adalah dengan menangguhkan penghantaran mesej kawalan mereka secara rawak. Memandangkan masa kitaran perbalahan yang lebih pendek meningkatkan daya pemprosesan slot, kajian ini membangunkan tiga mekanisme, kelewatan rawak tetap, kelewatan rawak berubah, dan kelewatan rawak optimum, untuk meminimumkan masa kitaran perbalahan. Simulasi menunjukkan bahawa kelewatan rawak optimum secara berkesan meminimumkan masa kitaran perbalahan dan menghampiri daya pemprosesan optimum teori sebanyak 0.18 daripada ALOHA tulen. Tambahan pula, anggaran yang berlebihan mengurangkan kesan pada masa kitaran perbalahan lebih daripada anggaran yang kurang melalui analisis sensitiviti, dan kedua-dua pemprosesan slot kerosakan fenomena. Dua skim anggaran, kemungkinan maksimum dan purata kemungkinan, dengan itu dibentangkan untuk menganggarkan bilangan stesen aktif bagi setiap pusingan resolusi perbalahan. Simulasi membuktikan bahawa skim anggaran yang dicadangkan adalah berkesan walaupun anggaran bilangan stesen aktif dalam pusingan pertikaian awal adalah tidak tepat.
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
Frank Yeong-Sung LIN, Wei-Ming YIN, Ying-Dar LIN, Chih-Hao LIN, "Optimal Ranging Algorithms for Medium Access Control in Hybrid Fiber Coax Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 10, pp. 2319-2326, October 2002, doi: .
Abstract: The ranging algorithm allows active stations to measure their distances to the headend for synchronization purpose in Hybrid Fiber Coax (HFC) networks. A practicable mechanism to resolve contention among numerous stations is to randomly delay the transmission of their control messages. Since shorter contention cycle time increases slot throughput, this study develops three mechanisms, fixed random delay, variable random delay, and optimal random delay, to minimize the contention cycle time. Simulation demonstrates that the optimal random delay effectively minimizes the contention cycle time and approaches the theoretical optimum throughput of 0.18 from pure ALOHA. Furthermore, over-estimation reduces the impact on contention cycle time more than under-estimation through sensitivity analysis, and both phenomenon damage slot throughput. Two estimation schemes, maximum likelihood and average likelihood, are thereby presented to estimate the number of active stations for each contention resolution round. Simulation proofs that the proposed estimation schemes are effective even when the estimated number of active stations in initial contention round is inaccurate.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_10_2319/_p
Salinan
@ARTICLE{e85-b_10_2319,
author={Frank Yeong-Sung LIN, Wei-Ming YIN, Ying-Dar LIN, Chih-Hao LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Ranging Algorithms for Medium Access Control in Hybrid Fiber Coax Networks},
year={2002},
volume={E85-B},
number={10},
pages={2319-2326},
abstract={The ranging algorithm allows active stations to measure their distances to the headend for synchronization purpose in Hybrid Fiber Coax (HFC) networks. A practicable mechanism to resolve contention among numerous stations is to randomly delay the transmission of their control messages. Since shorter contention cycle time increases slot throughput, this study develops three mechanisms, fixed random delay, variable random delay, and optimal random delay, to minimize the contention cycle time. Simulation demonstrates that the optimal random delay effectively minimizes the contention cycle time and approaches the theoretical optimum throughput of 0.18 from pure ALOHA. Furthermore, over-estimation reduces the impact on contention cycle time more than under-estimation through sensitivity analysis, and both phenomenon damage slot throughput. Two estimation schemes, maximum likelihood and average likelihood, are thereby presented to estimate the number of active stations for each contention resolution round. Simulation proofs that the proposed estimation schemes are effective even when the estimated number of active stations in initial contention round is inaccurate.},
keywords={},
doi={},
ISSN={},
month={October},}
Salinan
TY - JOUR
TI - Optimal Ranging Algorithms for Medium Access Control in Hybrid Fiber Coax Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2319
EP - 2326
AU - Frank Yeong-Sung LIN
AU - Wei-Ming YIN
AU - Ying-Dar LIN
AU - Chih-Hao LIN
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2002
AB - The ranging algorithm allows active stations to measure their distances to the headend for synchronization purpose in Hybrid Fiber Coax (HFC) networks. A practicable mechanism to resolve contention among numerous stations is to randomly delay the transmission of their control messages. Since shorter contention cycle time increases slot throughput, this study develops three mechanisms, fixed random delay, variable random delay, and optimal random delay, to minimize the contention cycle time. Simulation demonstrates that the optimal random delay effectively minimizes the contention cycle time and approaches the theoretical optimum throughput of 0.18 from pure ALOHA. Furthermore, over-estimation reduces the impact on contention cycle time more than under-estimation through sensitivity analysis, and both phenomenon damage slot throughput. Two estimation schemes, maximum likelihood and average likelihood, are thereby presented to estimate the number of active stations for each contention resolution round. Simulation proofs that the proposed estimation schemes are effective even when the estimated number of active stations in initial contention round is inaccurate.
ER -