Directed hypergraphs are used to model networks whose nodes are connected by directed buses. We study in this paper two parameters related to the fault-tolerance of directed bus networks: the connectivity and the fault-diameter of directed hypergraphs. Some bounds are given for those parameters. As a consequence, we obtain that de Bruijn-Kautz directed hypergraphs and, more generally, iterated line directed hypergraphs provide models for highly fault-tolerant directed bus networks. ? 2002 Elsevier Science B.V. All rights reserved.