The main properties of a network topology based on the Cartesian product of two complete graphs are briefly reviewed and the problems involved in the application of this type of structure to a multiexchange network are analysed. An approximate solution to the problem of assigning nodes of the network to exchanges (whose traffic matrix is known) is presented. This is obtained from a heuristic algorithm which involves solving a number of linear programming problems. Finally, a computational method for modelling a multiexchange digital network is applied to a network of very high traffic capacity such as might be the case for the top level of a digital national telecommunications network.