Longest Cycles Embedding in Faulty Augmented Cube Networks

Abstract:

Article Preview

The augmented cube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. In this paper, the topological structure of dimensional augmented cube is analyzed. The properties related to cycle embedding in faulty have been investigated. Let denote the set of fault links. This study demonstrates that when , for each nonfault link of augmented cube networks, lies on a longest fault free cycle which contains every nodes of .

Info:

Periodical:

Edited by:

Dehuai Zeng

Pages:

285-290

DOI:

10.4028/www.scientific.net/AMR.159.285

Citation:

H. M. Liu et al., "Longest Cycles Embedding in Faulty Augmented Cube Networks", Advanced Materials Research, Vol. 159, pp. 285-290, 2011

Online since:

December 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.