A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Methods and problems of communication in usual networks
1994
Discrete Applied Mathematics
This paper is a survey of existing methods of communication in usual networks. We particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube connected cycles, the undirected de Bruijn graph, the star graph, the shuffle-exchange graph, and the butterfly graph. Two different models of communication time are analysed, namely the constant model and the linear model. Other constraints like full-duplex or half-duplex links, processor-bound, DMA-bound or link-bound
doi:10.1016/0166-218x(94)90180-5
fatcat:bexo5ye4sfatvp3gzxeeu7skrm