Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science
Efficient Communication Schemes
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
Discrete Applied Mathematics
Expanding and forwarding parameters of product graphs
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Virtual network embedding in the cycle
Discrete Applied Mathematics
Forwarding indices of folded n-cubes
Discrete Applied Mathematics
The forwarding indices of augmented cubes
Information Processing Letters
On the restricted forwarding index problem in communication networks
Computers & Mathematics with Applications
Forwarding index of cube-connected cycles
Discrete Applied Mathematics
Forwarding and optical indices of a graph
Discrete Applied Mathematics
Average distances and distance domination numbers
Discrete Applied Mathematics
Echo: A peer-to-peer clustering framework for improving communication in DHTs
Journal of Parallel and Distributed Computing
Balancing traffic load using one-turn rectilinear routing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On average and maximum load of greedy routing in wireless ad hoc networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
On bounded load routings for modeling k-regular connection topologies
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 754.84 |
A network is defined as an undirected graph and a routing which consists of a collection of simple paths connecting every pair of vertices in the graph. The forwarding index of a network is the maximum number of paths passing through any vertex in the graph. Thus it corresponds to the maximum amount of forwarding done by any node in a communication network with a fixed routing. For a given number of vertices, each having a given degree constraint, we consider the problem of finding networks that minimize the forwarding index. Forwarding indexes are calculated' for cube networks and generalized de Bruijn networks. General bounds are derived which show that de Bruijn networks are asymptotically optimal. Finally, efficient techniques for building large networks with small forwarding indexes out of given component networks are presented and analyzed.