DMCA
Fault Tolerant Routing in the Star and Pancake Interconnection Networks (0)
| Venue: | Information Processing Letters |
| Citations: | 10 - 0 self |
BibTeX
@ARTICLE{Gargano_faulttolerant,
author = {L. Gargano and U. Vaccaro and A. Vozella},
title = {Fault Tolerant Routing in the Star and Pancake Interconnection Networks},
journal = {Information Processing Letters},
year = {},
volume = {45},
pages = {315--320}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this paper is to show that a recently proposed interconnection network enjoys similar properties. We will prove that if S n is the n-star graph then for any minimal length routing ae the diameter D(R(S n ; ae)=F ) is at most 3, as long as jF j ! n. Moreover, we will prove that if P n is the n-pancake graph then D(R(P n ; ae)=F ) 4, as long as jF j ! n and ae belongs to a particular class of routings. The n-star graph and the n-pancake graph were proposed in [2], [3] and have recently received much attention because of their rich structure, small diameter and symmetry property (cf., [1], [12], [13], [14], [17], [18], [19]). Our results confirm the goodness of their topology.
