Recursive matrix-calculation method for disjoint path search with hop link number constraints

Eiji Oki, Naoaki Yamanaka

研究成果: Article査読

20 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)769-774
ページ数6
ジャーナルIEICE Transactions on Communications
E78-B
5
出版ステータスPublished - 1995 5月
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「Recursive matrix-calculation method for disjoint path search with hop link number constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル