A technique for the (d, s, N)-bus network problem

A problem in the design of bus interconnection networks is to find directed hypergraphs with minimum diameter for fixed values of the order, processor degree and bus size. We propose the partial line hyperdigraph as a technique for it. The partial line hyperdigraph is related to the line hyperdigraph (J.C. Bermond and F. Ergincan), the partial line digraph (M.A. Fiol and A.S. Llado, 1992) and the line digraph (M.A. Fiol et al., 1984). Partial line hyperdigraphs have also good connectivity, expandability and easy routing. Especially interesting results are obtained for the generalized Kautz hyperdigraphs.