Ring embedding in faulty (n,k)-star graphs

In this paper we consider the ring embedding problem in faulty (n,k)-star graphs. An (n,k)-star graph is recently proposed as an attractive interconnection network topology and also known as the generalized version of an n-star graph with scalability such that the number of nodes in the graph can be...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 pp. 99 - 106
Main Authors: Jung-Hwan Chang, Jinsoo Kim
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Bidirectional control
Circuit topology
Computer science
Distributed computing
Embedded computing
Fault tolerance
Multiprocessing systems
Multiprocessor interconnection networks
Network topology
Scalability
ISBN:0769511538, 9780769511535
ISSN:1521-9097
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we consider the ring embedding problem in faulty (n,k)-star graphs. An (n,k)-star graph is recently proposed as an attractive interconnection network topology and also known as the generalized version of an n-star graph with scalability such that the number of nodes in the graph can be suitably adjustable by two dimensioning parameters n and k. Our scheme is proceeded in top-down style in such a manner that the resulting sub-stars maintain evenly distributed faults. We show that a ring of length n!/(n-k)!-f can be found in an (n,k)-star graph having n!/(n-k)! nodes when the number of faulty nodes f is at most n-3 and n-k/spl ges/2.
ISBN:0769511538
9780769511535
ISSN:1521-9097
DOI:10.1109/ICPADS.2001.934807