Access Restriction

Author Ferraro, D. ♦ Padro, C.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1997
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Fault tolerance ♦ Routing
Abstract A generalized p-cycle is a digraph whose set of vertices is partitioned into p parts that can be ordered in such a way that a vertex is adjacent only to vertices in the next part. The families of BGC(p,d,d/sup k/) (de Bruijn Generalized Cycles) and KGC(p,d,d/sup p+k/+d/sup k/) (Kautz Generalized Cycles) are the largest known p-cyles for their degree and diameter. In this paper, we present routing algorithms for both families. Such algorithms route over paths of length at most the value of the diameter plus two units. Moreover, this bound is attained only in the case that the number of faulty elements (nodes or links) is maximum.
Description Author affiliation: Dept. de Matematica Aplicada i Telematica, Univ. Politecnica de Catalunya, Barcelona, Spain (Ferraro, D.)
ISBN 0818680520
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1997-11-10
Publisher Place Chile
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 710.66 kB
Page Count 8
Starting Page 58
Ending Page 65

Source: IEEE Xplore Digital Library