A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.
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.
Copy
Eiji OKI, Naoaki YAMANAKA, "A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints" in IEICE TRANSACTIONS on Communications,
vol. E78-B, no. 5, pp. 769-774, May 1995, doi: .
Abstract: A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e78-b_5_769/_p
Copy
@ARTICLE{e78-b_5_769,
author={Eiji OKI, Naoaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints},
year={1995},
volume={E78-B},
number={5},
pages={769-774},
abstract={A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints
T2 - IEICE TRANSACTIONS on Communications
SP - 769
EP - 774
AU - Eiji OKI
AU - Naoaki YAMANAKA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E78-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1995
AB - A new approximation calculation method, named the Recursive Matrix-calculation (RM) method, is proposed. It uses matrix calculation to determine the number of link disjoint paths under a hop link number constraint, i.e. hop limit. The RM method does not overestimate the number of link disjoint paths. When networks are designed by this method, network reliability is perfectly guaranteed. Moreover, the RM method is based on matrix calculation, so CPU time can be reduced by using super-computers equipped with vector processors. Simulation results confirm that the RM method yields rapid approximations that are conservative. Thus the proposed method is very useful for designing reliable multimedia networks.
ER -