The forwarding index of communication networks
IEEE Transactions on Information Theory
On forwarding indices of networks
Discrete Applied Mathematics
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Discrete Applied Mathematics
Two remarks on “expanding and forwarding” by P. Sole´
Discrete Applied Mathematics
Wormhole routing techniques for directly connected multicomputer systems
ACM Computing Surveys (CSUR)
The forwarding diameter of graphs
Discrete Applied Mathematics
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.00 |
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network--the undirected graph with a given routing. Many large networks are composed from some existing smaller networks by using, in terms of graph theory, Cartesian product. The expanding and forwarding parameters of such large networks are associated strongly with that of the corresponding smaller ones. This association also provides a convenient way to determine the two parameters for some known networks such as the hypercube, generalized cube and the mesh, etc. As the generalization of the forwarding index, t-forwarding index is introduced and studied. The study shows that the t-forwarding parameters of a given graph are convergent (refers to the limit t → ∞), which reveals some further properties concerning the forwarding parameters of the product graphs.