Fault Diameter of Even Networks

  • Authors:

  • Jong-Seok Kim;Sung Won Kim;Hyeong-Ok Lee

  • Affiliations:

  • -;-;-

  • Venue:
  • NCM '08 Proceedings of the 2008 Fourth International Conference on Networked Computing and Advanced Information Management - Volume 01
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [8]and analyzed so many useful properties include node-disjoint paths. By introducing node-disjoint paths, fault diameter of Even networks can be $d+2$ (d=odd) or d+3 (d=even). However, the lengths of node-disjoint paths are not the shortest. In this paper, we show that Even networks are node- and edge- symmetric.We also propose the shortest lengths of node-disjoint paths, and show that fault diameter of Even networks is d+1.