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

Eiji Oki, Naoaki Yamanaka

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)769-774
Number of pages6
JournalIEICE Transactions on Communications
VolumeE78-B
Issue number5
Publication statusPublished - 1995 May 1
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Recursive matrix-calculation method for disjoint path search with hop link number constraints'. Together they form a unique fingerprint.

Cite this