IEICE TRANSACTIONS on Communications
Fast Bandwidth Evaluation--An Improvement on Virtual Path Bandwidth Allocation in Large-Scale Networks
Summary :
In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.8 pp.2438-2441
- Publication Date
- 2004/08/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hui SONG, Wu YE, Sui Li FENG, Sheng Ye HUANG, "Fast Bandwidth Evaluation--An Improvement on Virtual Path Bandwidth Allocation in Large-Scale Networks" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 8, pp. 2438-2441, August 2004, doi: .
Abstract: In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_8_2438/_p
Copy
@ARTICLE{e87-b_8_2438,
author={Hui SONG, Wu YE, Sui Li FENG, Sheng Ye HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Bandwidth Evaluation--An Improvement on Virtual Path Bandwidth Allocation in Large-Scale Networks},
year={2004},
volume={E87-B},
number={8},
pages={2438-2441},
abstract={In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Fast Bandwidth Evaluation--An Improvement on Virtual Path Bandwidth Allocation in Large-Scale Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2438
EP - 2441
AU - Hui SONG
AU - Wu YE
AU - Sui Li FENG
AU - Sheng Ye HUANG
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2004
AB - In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.
ER -
English
