Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?

Frédéric Giroire 1 Stéphane Pérennes 1 Issam Tahiri 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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 forwarding-index, 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. Hence, 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?
Type de document :
[Research Report] RR-8752, INRIA Sophia Antipolis; INRIA. 2015
Liste complète des métadonnées
Contributeur : Frédéric Giroire <>
Soumis le : mardi 7 juillet 2015 - 17:39:58
Dernière modification le : lundi 5 novembre 2018 - 15:36:03
Document(s) archivé(s) le : jeudi 8 octobre 2015 - 15:38:22


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01172725, version 1



Frédéric Giroire, Stéphane Pérennes, Issam Tahiri. Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges?. [Research Report] RR-8752, INRIA Sophia Antipolis; INRIA. 2015. 〈hal-01172725〉



Consultations de la notice


Téléchargements de fichiers