Show simple item record

dc.contributor.authorDiarrassouba, Ibrahima*
dc.contributor.authorYoussef, Habib*
dc.contributor.authorMahjoub, Ali Ridha*
dc.contributor.authorLourimi, Ali*
dc.date.accessioned2013-07-16T09:25:51Z
dc.date.available2013-07-16T09:25:51Z
dc.date.issued2013
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/11562
dc.language.isoenen
dc.subjectPolynomial algorithmen
dc.subjectSeparation problemen
dc.subjectCutting planeen
dc.subjectMaximum flow problemen
dc.subjectBranch-and-cuten
dc.subjectHose modelen
dc.subjectVirtual private networken
dc.subject.ddc004en
dc.titleHose Workload based Exact Algorithm for the Optimal Design of Virtual Private Networksen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversité du Havre, Laboratoire de Mathématiques Appliquées du Havre,;France
dc.contributor.editoruniversityotherPRINCE Research Unit, ISITCom Hammam Sousse, University of Sousse;Tunisie
dc.description.abstractenThe Virtual Private Networks (VPN) optimal bandwidth allocation problem with tree toplogy has been widely discussed in the literature. Most of the algorithms proposed by researchers to solve this problem use approximation schemes. In this paper, we propose an exact and efficient Branch-and-Cut algorithm for the problem in the context of a hose workload model. In particular, we consider the case when the ingress and egress traffic at VPN endpoints are asymetric and the links of the network have unbounded capacities. The algorithm proposed here is based on a linear integer programming formulation for the problem introduced by Kumar et al. [2]. Using this and a deep investigation of the polyhedral structure of that formulation, our algorithm permits to solve large instances of the problem having up to 120 nodes and 10 terminals.en
dc.relation.isversionofjnlnameComputer Networks
dc.relation.isversionofjnlvol57
dc.relation.isversionofjnlissue14
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnlpages2766-2774
dc.relation.isversionofdoi10.1016/j.comnet.2013.06.009en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelInformatique généraleen
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
hal.person.labIds*
hal.person.labIds*
hal.person.labIds989*
hal.person.labIds*
hal.identifierhal-01497033*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record