Flow problems in multi-interface networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Computers Year : 2012

Flow problems in multi-interface networks


In heterogeneous networks, devices communicate by means of multiple wired or wireless interfaces. By switching among interfaces or by combining the available ones, each device might establish several connections. A connection may be established when the devices at its endpoints share at least one active interface. In this paper, we consider two fundamental optimization problems. In the first one (Maximum Flow in Multi-Interface Networks MFMI), we aim to establish the maximal bandwidth that can be guaranteed between two given nodes of the input network. In the second problem (Minimum-Cost Flow in Multi-Interface Networks MCFMI), we look for activating the cheapest set of interfaces among a network in order to guarantee a minimum bandwidth B of communication between two specified nodes. We show that MFMI is polynomially solvable while MCFMI is NP-hard even for a bounded number of different interfaces and bounded degree networks. Moreover, we provide polynomial approximation algorithms for MCFMI and exact algorithms for relevant sub-problems. Finally, we experimentally analyze the proposed approximation algorithm, showing that in practical cases it guarantees a low approximation ratio.
Fichier principal
Vignette du fichier
main.pdf (296.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00728878 , version 1 (06-09-2012)


  • HAL Id : hal-00728878 , version 1


Gianlorenzo d'Angelo, Gabriele Di Stefano, Alfredo Navarra. Flow problems in multi-interface networks. IEEE Transactions on Computers, 2012. ⟨hal-00728878⟩
140 View
244 Download


Gmail Facebook Twitter LinkedIn More