How to Design Graphs with Low Forwarding Index and Limited Number of Edges

Abstract

The (edge) forwarding index of a graph is the minimum, over all possible routings of all the demands, of the maximum load of an edge. This metric is of a great interest since it captures the notion of global congestion in a precise way: the lesser the forwardingindex, the lesser the congestion. In this paper, we study the following design question: Given a number e of edges and a number n of vertices, what is the least congested graph that we can construct? and what forwarding-index can we achieve? Our problem has some distant similarities with the well-known (∆, D) problem, and we sometimes build upon results obtained on it. The goal of this paper is to study how to build graphs with low forwarding indices and to understand how the number of edges impacts the forwarding index. We answer here these questions for different families of graphs: general graphs, graphs with bounded degree, sparse graphs with a small number of edges by providing constructions, most of them asymptotically optimal. For instance, we provide an asymptotically optimal construction for (n, n + k) cubic graphs-its forwarding index is ∼ n 2 3k log 2 (k). Our results allow to understand how the forwarding-index drops when edges are added to a graph and also to determine what is the best (i.e least congested) structure with e edges. Doing so, we partially answer the practical problem that initially motivated our work: If an operator wants to power only e links of its network, in order to reduce the energy consumption (or wiring cost) of its networks, what should be those links and what performance can be expected?

Grid spanners with low forwarding index for energy efficient networks

“…We believe that this extremal graph problem is interesting. However, it has not been addressed much and most of the questions are widely open (see as example (35)).…”