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
Kertas kerja ini membentangkan Pengurusan Jalur Lebar Laluan (PBM) model untuk rangkaian berskala besar yang membawa kepada peruntukan PB yang hampir optimum, di bawah kekangan yang ditimbulkan oleh lebar jalur yang dipasang dalam pautan penghantaran rangkaian. Prosedur peruntukan PB didorong daripada matriks permintaan trafik dan terdiri daripada tiga fasa. Dalam fasa pertama, penguraian yang sesuai bagi keseluruhan rangkaian berlaku, di mana rangkaian berskala besar dibahagikan kepada satu set sub-rangkaian satu peringkat. Dalam fasa kedua, algoritma pengoptimuman yang dibangunkan untuk rangkaian telekomunikasi satu peringkat digunakan pada setiap sub-rangkaian untuk menentukan peruntukan PB yang optimum. Kriteria untuk pengoptimuman adalah untuk meminimumkan Kebarangkalian Penyekatan Panggilan yang paling teruk (CBP) daripada semua pasangan bertukar sub-rangkaian. Dalam fasa ketiga, komposisi sub-rangkaian berlaku secara berturut-turut, yang membawa kepada peruntukan PB terakhir rangkaian berskala besar. Memandangkan rangkaian berskala besar dibina daripada sub-rangkaian yang dioptimumkan, peruntukan PB yang hampir optimum dijangkakan. Untuk penilaian, hasil CBP terburuk bagi skim yang dicadangkan dibandingkan dengan yang diperolehi oleh prosedur peruntukan PB optimum untuk membuktikan keoptimuman dan kecekapannya. Kami memilih satu set rangkaian berskala besar yang saiznya tidak terlalu besar supaya kami boleh menggunakan algoritma pengoptimuman yang dibangunkan untuk rangkaian telekom satu peringkat untuk menentukan peruntukan lebar jalur optimumnya. Penilaian meluas model PBM telah menunjukkan bahawa hasil CBP terburuk adalah kira-kira 2% di atas nilai optimum, yang merupakan hasil yang memuaskan. Skim PBM yang dicadangkan dijelaskan melalui contoh aplikasi.
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
Michael D. LOGOTHETIS, George K. KOKKINAKIS, "Path Bandwidth Management for Large Scale Telecom Networks" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 9, pp. 2087-2099, September 2000, doi: .
Abstract: This paper presents a Path Bandwidth Management (PBM) model for large-scale networks that leads to an almost optimal PB allocation, under constraints posed by the installed bandwidth in the transmission links of the network. The PB allocation procedure is driven from a traffic demand matrix and consists of three phases. In the first phase, a suitable decomposition of the whole network takes place, where the large-scale network is split to a set of one-level sub-networks. In the second phase, the optimization algorithm developed for one-level telecommunication networks is applied to each sub-network in order to define the optimal PB allocation. The criterion for optimization is to minimize the worst Call Blocking Probability (CBP) of all switching pairs of the sub-network. In the third phase, composition of the sub-networks takes place in a successive way, which leads to the final PB allocation of the large-scale network. As the large-scale network is built up from optimized sub-networks, an almost optimal PB allocation is anticipated. For evaluation, the worst resultant CBP of the proposed scheme is compared with that obtained by the optimal PB allocation procedure in order to prove its optimality and efficiency. We choose a set of large-scale networks whose size is not very large so that we can apply the optimization algorithm developed for one-level telecom networks for defining its optimal bandwidth allocation. Extensive evaluation of the PBM model has showed that the worst resultant CBP is about 2% above the optimal value, which is a satisfactory result. The proposed PBM scheme is explained by means of an application example.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_9_2087/_p
Salinan
@ARTICLE{e83-b_9_2087,
author={Michael D. LOGOTHETIS, George K. KOKKINAKIS, },
journal={IEICE TRANSACTIONS on Communications},
title={Path Bandwidth Management for Large Scale Telecom Networks},
year={2000},
volume={E83-B},
number={9},
pages={2087-2099},
abstract={This paper presents a Path Bandwidth Management (PBM) model for large-scale networks that leads to an almost optimal PB allocation, under constraints posed by the installed bandwidth in the transmission links of the network. The PB allocation procedure is driven from a traffic demand matrix and consists of three phases. In the first phase, a suitable decomposition of the whole network takes place, where the large-scale network is split to a set of one-level sub-networks. In the second phase, the optimization algorithm developed for one-level telecommunication networks is applied to each sub-network in order to define the optimal PB allocation. The criterion for optimization is to minimize the worst Call Blocking Probability (CBP) of all switching pairs of the sub-network. In the third phase, composition of the sub-networks takes place in a successive way, which leads to the final PB allocation of the large-scale network. As the large-scale network is built up from optimized sub-networks, an almost optimal PB allocation is anticipated. For evaluation, the worst resultant CBP of the proposed scheme is compared with that obtained by the optimal PB allocation procedure in order to prove its optimality and efficiency. We choose a set of large-scale networks whose size is not very large so that we can apply the optimization algorithm developed for one-level telecom networks for defining its optimal bandwidth allocation. Extensive evaluation of the PBM model has showed that the worst resultant CBP is about 2% above the optimal value, which is a satisfactory result. The proposed PBM scheme is explained by means of an application example.},
keywords={},
doi={},
ISSN={},
month={September},}
Salinan
TY - JOUR
TI - Path Bandwidth Management for Large Scale Telecom Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2087
EP - 2099
AU - Michael D. LOGOTHETIS
AU - George K. KOKKINAKIS
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2000
AB - This paper presents a Path Bandwidth Management (PBM) model for large-scale networks that leads to an almost optimal PB allocation, under constraints posed by the installed bandwidth in the transmission links of the network. The PB allocation procedure is driven from a traffic demand matrix and consists of three phases. In the first phase, a suitable decomposition of the whole network takes place, where the large-scale network is split to a set of one-level sub-networks. In the second phase, the optimization algorithm developed for one-level telecommunication networks is applied to each sub-network in order to define the optimal PB allocation. The criterion for optimization is to minimize the worst Call Blocking Probability (CBP) of all switching pairs of the sub-network. In the third phase, composition of the sub-networks takes place in a successive way, which leads to the final PB allocation of the large-scale network. As the large-scale network is built up from optimized sub-networks, an almost optimal PB allocation is anticipated. For evaluation, the worst resultant CBP of the proposed scheme is compared with that obtained by the optimal PB allocation procedure in order to prove its optimality and efficiency. We choose a set of large-scale networks whose size is not very large so that we can apply the optimization algorithm developed for one-level telecom networks for defining its optimal bandwidth allocation. Extensive evaluation of the PBM model has showed that the worst resultant CBP is about 2% above the optimal value, which is a satisfactory result. The proposed PBM scheme is explained by means of an application example.
ER -