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
Dalam literatur penukaran litar, konsep Laluan Laluan Termuat (LLR) telah ditunjukkan sebagai sangat mudah dan cekap. Walau bagaimanapun, nampaknya tiada definisi unik untuk laluan "paling sibuk", iaitu, cara mengukur tahap "sibuk" laluan. Dalam makalah ini, kami mengkaji enam cara untuk menentukan laluan paling sibuk dan dasar rawak. Prestasi dasar ini dinilai melalui kedua-dua simulasi dan analisis. Keputusan berangka kami menunjukkan bahawa semua dasar, termasuk dasar rawak, mempunyai prestasi yang hampir sama di bawah kebanyakan konfigurasi rangkaian. Hanya dalam keadaan beban trafik yang sangat rendah, perbezaan antara dasar menjadi ketara. Walau bagaimanapun, magnitud perbezaan masih sangat kecil (kira-kira 0.001). Oleh itu, kami membuat kesimpulan bahawa cara memilih laluan ganti tidak menjejaskan prestasi algoritma penghalaan berasaskan LLR dengan ketara apabila kebarangkalian menyekat panggilan tidak terlalu kecil. Sebaliknya, kami mendapati bahawa tahap tempahan batang mempengaruhi prestasi algoritma penghalaan berasaskan LLR dengan ketara.
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
Ren-Hung HWANG, Huang-Leng CHANG, "On LLR Routing in Circuit-Switched Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 5, pp. 1397-1405, May 2001, doi: .
Abstract: In the circuit-switching literature, the Least Loaded Path Routing (LLR) concept has been shown to be very simple and efficient. However, it seems that there is no unique definition for the "least busy" path, i.e., how to measure the degree of "busy" of a path. In this paper, we examine six ways of defining the least busy path and a random policy. The performance of these policies is evaluated via both simulation and analysis. Our numerical results show that all policies, include the random policy, have almost the same performance under most of the network configurations. Only under extremely low traffic load conditions, the difference between the policies becomes significant. However, the magnitude of the difference is still very small (about 0.001). Therefore, we conclude that how to select the alternate path does not affect the performance of LLR-based routing algorithms significantly when the call blocking probability is not too small. Instead, we found that the trunk reservation level affects the performance of LLR-based routing algorithms significantly.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_5_1397/_p
Salinan
@ARTICLE{e84-b_5_1397,
author={Ren-Hung HWANG, Huang-Leng CHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={On LLR Routing in Circuit-Switched Networks},
year={2001},
volume={E84-B},
number={5},
pages={1397-1405},
abstract={In the circuit-switching literature, the Least Loaded Path Routing (LLR) concept has been shown to be very simple and efficient. However, it seems that there is no unique definition for the "least busy" path, i.e., how to measure the degree of "busy" of a path. In this paper, we examine six ways of defining the least busy path and a random policy. The performance of these policies is evaluated via both simulation and analysis. Our numerical results show that all policies, include the random policy, have almost the same performance under most of the network configurations. Only under extremely low traffic load conditions, the difference between the policies becomes significant. However, the magnitude of the difference is still very small (about 0.001). Therefore, we conclude that how to select the alternate path does not affect the performance of LLR-based routing algorithms significantly when the call blocking probability is not too small. Instead, we found that the trunk reservation level affects the performance of LLR-based routing algorithms significantly.},
keywords={},
doi={},
ISSN={},
month={May},}
Salinan
TY - JOUR
TI - On LLR Routing in Circuit-Switched Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1397
EP - 1405
AU - Ren-Hung HWANG
AU - Huang-Leng CHANG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2001
AB - In the circuit-switching literature, the Least Loaded Path Routing (LLR) concept has been shown to be very simple and efficient. However, it seems that there is no unique definition for the "least busy" path, i.e., how to measure the degree of "busy" of a path. In this paper, we examine six ways of defining the least busy path and a random policy. The performance of these policies is evaluated via both simulation and analysis. Our numerical results show that all policies, include the random policy, have almost the same performance under most of the network configurations. Only under extremely low traffic load conditions, the difference between the policies becomes significant. However, the magnitude of the difference is still very small (about 0.001). Therefore, we conclude that how to select the alternate path does not affect the performance of LLR-based routing algorithms significantly when the call blocking probability is not too small. Instead, we found that the trunk reservation level affects the performance of LLR-based routing algorithms significantly.
ER -