Flow Allocation with Path Protection in Next Generation Internet Networks

Abstract : In this work, we study the flow allocation problem in Next Generation Internet (NGI) networks. Given a capacitated network, flow allocation consists of a simultaneous routing and bandwidth allocation problem for flows realizing a set of source-destination demands. We consider the case where demands are elastic and the flow realizing one demand can be arbitrary split over multiple paths. Moreover, we ensure that the allocated flows are survivable to network failures using path protection. We investigate the possibility of sharing backup capacity, thus enabling more efficient resource consumption. Depending on the optimization objective, we provide two different approaches to the problem. The first approach maximizes the total allocated volume and the second one maximizes the minimum allocated volume. We build mathematical formulations based on generalizations of the maximum multicommodity flow and the maximum concurrent flow problems. Moreover, we provide new approximation algorithms based on a primal-dual approach. These algorithms compute a solution that is within a guaranteed factor of the optimal. Numerical results enable to get deeper insights on
Type de document :
Communication dans un congrès
IEEE International Conference on Communications, ICC '06, 2006, Istanbul, Turkey. 2, pp.860 -865, 2006, 〈10.1109/ICC.2006.254815〉
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00535998
Contributeur : Samer Lahoud <>
Soumis le : lundi 15 novembre 2010 - 00:21:43
Dernière modification le : mardi 24 avril 2018 - 13:37:49
Document(s) archivé(s) le : mercredi 16 février 2011 - 02:41:07

Fichier

ICC-06.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Samer Lahoud, Géraldine Texier, Laurent Toutain. Flow Allocation with Path Protection in Next Generation Internet Networks. IEEE International Conference on Communications, ICC '06, 2006, Istanbul, Turkey. 2, pp.860 -865, 2006, 〈10.1109/ICC.2006.254815〉. 〈inria-00535998〉

Partager

Métriques

Consultations de la notice

322

Téléchargements de fichiers

63