IEICE TRANSACTIONS on Communications
Parameter Dimensioning Algorithms of the PNNI Complex Node Model with Bypasses
Summary :
In this paper, we propose optimization approaches for the parameter determination of the PNNI complex node model. Two optimal objectives are discussed: Least Square Approximation and Maximum Deviation Minimization. For each objective, we propose two practical criteria for setting up bypasses: Maximum Difference Removal and Largest Deviation Removal. Generalized inverse of matrix and linear programming techniques are used to find the solutions. The numerical results show that the least square approximation with the largest deviation removal criteria has the best performance as the number of bypasses increases.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.3 pp.638-645
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Communication Networks and Services
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
Jin LIU, Zhisheng NIU, Junli ZHENG, "Parameter Dimensioning Algorithms of the PNNI Complex Node Model with Bypasses" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 3, pp. 638-645, March 2000, doi: .
Abstract: In this paper, we propose optimization approaches for the parameter determination of the PNNI complex node model. Two optimal objectives are discussed: Least Square Approximation and Maximum Deviation Minimization. For each objective, we propose two practical criteria for setting up bypasses: Maximum Difference Removal and Largest Deviation Removal. Generalized inverse of matrix and linear programming techniques are used to find the solutions. The numerical results show that the least square approximation with the largest deviation removal criteria has the best performance as the number of bypasses increases.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_3_638/_p
Copy
@ARTICLE{e83-b_3_638,
author={Jin LIU, Zhisheng NIU, Junli ZHENG, },
journal={IEICE TRANSACTIONS on Communications},
title={Parameter Dimensioning Algorithms of the PNNI Complex Node Model with Bypasses},
year={2000},
volume={E83-B},
number={3},
pages={638-645},
abstract={In this paper, we propose optimization approaches for the parameter determination of the PNNI complex node model. Two optimal objectives are discussed: Least Square Approximation and Maximum Deviation Minimization. For each objective, we propose two practical criteria for setting up bypasses: Maximum Difference Removal and Largest Deviation Removal. Generalized inverse of matrix and linear programming techniques are used to find the solutions. The numerical results show that the least square approximation with the largest deviation removal criteria has the best performance as the number of bypasses increases.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Parameter Dimensioning Algorithms of the PNNI Complex Node Model with Bypasses
T2 - IEICE TRANSACTIONS on Communications
SP - 638
EP - 645
AU - Jin LIU
AU - Zhisheng NIU
AU - Junli ZHENG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2000
AB - In this paper, we propose optimization approaches for the parameter determination of the PNNI complex node model. Two optimal objectives are discussed: Least Square Approximation and Maximum Deviation Minimization. For each objective, we propose two practical criteria for setting up bypasses: Maximum Difference Removal and Largest Deviation Removal. Generalized inverse of matrix and linear programming techniques are used to find the solutions. The numerical results show that the least square approximation with the largest deviation removal criteria has the best performance as the number of bypasses increases.
ER -
English
