Abstract A network (G,R) consists in a given undirected graph G of order n and a routing R, that is a collection of n(n-1) simple paths connecting every ordered pair of vertices of G. Chung, Coffman, Reiman and Simon defined the forwarding index ξ(G,R) of a network (G,R) as the maximum number of paths of R passing through any vertex of G. Similarly we define the edge-forwarding index of a network (G,R) as the maximum number of paths of R passing through any edge of G. These parameters might be of interest in different applications concerning communication networks. The forwarding (resp. edge-forwarding) index corresponds to the maximum amount of forwarding done by any node (resp. edge). The edge-forwarding index also corresponds to the maximum load of the network. Therefore it is of interest, for a given graph, to find routings minimizing these indices and we shall define the forwarding (edge-forwarding) index of a graph as the minimum taken over all possible indices of the possible networks. In this paper we give bounds on these forwarding indices, in particular as a function of the connectivity of the graph, and calculate them for products of graphs and for some specific graphs.
[1]
Odile Favaron,et al.
A parameter linked with G-factors and the binding number
,
1990,
Discret. Math..
[2]
C. Berge.
Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
,
1982
.
[3]
Claude Berge,et al.
Some common properties for regulizable graphs, edge-critical graphs and B-graphs
,
1980,
Graph Theory and Algorithms.
[4]
N. Biggs.
Algebraic Graph Theory: COLOURING PROBLEMS
,
1974
.
[5]
Jean-Claude Bermond,et al.
Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY
,
1983
.
[6]
Fan Chung Graham,et al.
The forwarding index of communication networks
,
1987,
IEEE Trans. Inf. Theory.
[7]
C. Berge.
Graphes et hypergraphes
,
1970
.
[8]
Ján Plesník,et al.
On the sum of all distances in a graph or digraph
,
1984,
J. Graph Theory.