The first edition of this book covered in depth the mathematical theory of nonblocking
multistage interconnecting networks, which is applicable to both communication and …

The de Bruijn graph was defined in 1949 to enumerate the number of closed sequences
where each n-tuple appears exactly once as a window in a sequence. Through the years …

Algebraic switching theory and broadband applications | Guide books skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About …

The understanding of the structure of a network can be enhanced efficiently with distance-
reliant parameters. The metric dimension is one such parameter with numerous variations …

In parallel/distributed computing systems, the all-to-all personalized communication (or
complete exchange) is required in numerous applications of parallel processing. In this …

Analytical modeling techniques can be used to study the performance of optical multistage
interconnection network (OMIN) effectively. MINs have assumed importance in recent times …

We consider multistage interconnection networks for designed communication in multi-
processor architecture. We give a graph characterization of these networks and a set of …

A multistage interconnection network (MIN) consisting of 2 times 2 nodes constructs a
nonblocking switch if the network is rearrangeable. When a 2 n times 2 n bit-permuting …

In recent years, many multistage interconnection networks using 2× 2 switching elements
have been proposed for parallel architectures. Typical examples are baseline networks …

The two-stage interconnection network is conceivably the most compact design for
interconnecting small switches into a large switch. Switches so constructed typically can be …