• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

From constant traffic matrices to hose workload model for VPN tree design

Thumbnail
Date
2012
Indexation documentaire
Recherche opérationnelle
Subject
hard combinatorial optimization; VPN
Réf version publiée
http://dx.doi.org/10.1109/NETWKS.2012.6381675
Titre du colloque
XVth International Symposium on Telecommunications Network Strategy and Planning (NETWORKS), 2012
Date du colloque
10-2012
Ville du colloque
Rome
Pays du colloque
Italy
Titre de l'ouvrage
XVth International Symposium on Telecommunications Network Strategy and Planning (NETWORKS), 2012 - proceedings
Nom de l'éditeur
IEEE
Année
2012
ISBN
978-1-4673-1390-2
URI
https://basepub.dauphine.fr/handle/123456789/11816
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Thabti, Boulbaba
Lourimi, Ali
Youssef, Habib
Mahjoub, Ali Ridha
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Meddeb, Aref
Type
Communication / Conférence
Nombre de pages du document
1-6
Résumé en anglais
Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a low cost but secure network solution. The allocation of bandwidth for VPN tunnels to meet the requirements specified by customers is an important traffic engineering research issue. This paper addresses the general problem of computing a constrained VPN with a tree topology, and having optimum bandwidth allocation. This is a hard combinatorial optimization problem [1]. This issue was studied first by different resource allocation methods [2] and next was studied by general optimization methods [3]. In this paper, we present integer programming formulations (IPFs) assuming a hose as well as a pipe workload models. Earlier work [2] showed that the hose model results in VPN trees over provisioned by a factor of 2-to-3. Extensive simulations using test networks and their corresponding hose workloads, generated with Brite [4] show that our exact methods produce VPN tree solutions with a bandwidth over-provisioning factor as low as 1.6, and never exceeds a factor of 2, compared to solutions obtained using a pipe workload.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.