On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks

Abstract

In this paper, we study various communication networks, such as concentrators, superconcentrators, generalizers, and rearrangeable and nonblocking networks. We improve bounds for the number of edges (which can be viewed as approximations of the cost) in some networks by combinatorial analysis.