A non-cooperative game-theoretic framework for resource allocation in network virtualization
Identifieur interne : 000588 ( Hal/Checkpoint ); précédent : 000587; suivant : 000589A non-cooperative game-theoretic framework for resource allocation in network virtualization
Auteurs : Mohamed Said Seddiki [Tunisie] ; Mounir Frikha [Tunisie] ; Ye-Qiong Song [France]Source :
English descriptors
- mix :
Abstract
Network virtualization is a new technology thataimsatallowingmultiplevirtualnetworks(VNs)tocoexistinthe same equipment and to hide the heterogeneity of networkinfrastructure. The critical issue for a given infrastructureprovider (InP), is how to provide customized and on demandresources for multiple service providers (SPs) with differentQualityofService(QoS)requirements.Theshouldalsofairlydistribute the network physical resources, such as bandwidthof each physical link, buffer spaces, and processing cycles ateach node. In this paper, we propose a new framework basedon game theory, for both link and node dynamic allocationbetween multiple infrastructure providers (InPs) and serviceproviders (SPs). Our approach focuses on provisioning andmanaging the physical resources in a virtualized networkinfrastructure. We propose a two-stage approach based onnon-cooperative games. The first one is the resource negotiation game where the SP requests link and node resourcesfrom multiple InPs. The InP may reject the SP’s requestwhen it can potentially cause network congestion. The second stage of the proposal concerns dynamic resource provisioning and consists of two non cooperative games; the node allocation game and the link allocation game. Theobjective of both games is to allocate physical resources fordifferent isolated VNs that are sharing the same physicalsubstrate network. In the node allocation game, the proportional share mechanism is used. Every SP assigns a weightand submits a bid to each physical node and thereafter itreceives a share proportional to its bid. In the link allocation game we investigate the case when multiple SPs compete for a portion of the available physical network capacity.Simulation results show that the proposed approach achieveshigh resource utilization, improves the network performance,and fairly distributes the link and node resources betweenmultiple SPs.
Url:
DOI: 10.1007/s11235-015-9995-7
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:hal-01247364Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">A non-cooperative game-theoretic framework for resource allocation in network virtualization</title>
<author><name sortKey="Seddiki, Mohamed Said" sort="Seddiki, Mohamed Said" uniqKey="Seddiki M" first="Mohamed Said" last="Seddiki">Mohamed Said Seddiki</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-23718" status="VALID"><orgName>Unité de Recherche en Réseaux Radio Mobile Multimédia</orgName>
<orgName type="acronym">MEDIATRON</orgName>
<desc><address><addrLine>Cité Technologique des Communications, Route de Raoued Km 3.5, 2083 El Ghazala, Ariana Email : Mediatron@laposte.net Tél. : 00 216 - 71 857 000 (Poste 1032)</addrLine>
<country key="TN"></country>
</address>
<ref type="url">http://www.supcom.mincom.tn/mediatron/</ref>
</desc>
<listRelation><relation active="#struct-307978" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-307978" type="direct"><org type="institution" xml:id="struct-307978" status="INCOMING"><orgName>Ecole Supérieure des Communications de Tunis</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Tunisie</country>
</affiliation>
</author>
<author><name sortKey="Frikha, Mounir" sort="Frikha, Mounir" uniqKey="Frikha M" first="Mounir" last="Frikha">Mounir Frikha</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-23718" status="VALID"><orgName>Unité de Recherche en Réseaux Radio Mobile Multimédia</orgName>
<orgName type="acronym">MEDIATRON</orgName>
<desc><address><addrLine>Cité Technologique des Communications, Route de Raoued Km 3.5, 2083 El Ghazala, Ariana Email : Mediatron@laposte.net Tél. : 00 216 - 71 857 000 (Poste 1032)</addrLine>
<country key="TN"></country>
</address>
<ref type="url">http://www.supcom.mincom.tn/mediatron/</ref>
</desc>
<listRelation><relation active="#struct-307978" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-307978" type="direct"><org type="institution" xml:id="struct-307978" status="INCOMING"><orgName>Ecole Supérieure des Communications de Tunis</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Tunisie</country>
</affiliation>
</author>
<author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205122" status="VALID"><idno type="RNSR">200418297A</idno>
<orgName>Management of dynamic networks and services</orgName>
<orgName type="acronym">MADYNES</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/madynes</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01247364</idno>
<idno type="halId">hal-01247364</idno>
<idno type="halUri">https://hal.inria.fr/hal-01247364</idno>
<idno type="url">https://hal.inria.fr/hal-01247364</idno>
<idno type="doi">10.1007/s11235-015-9995-7</idno>
<date when="2015-03-21">2015-03-21</date>
<idno type="wicri:Area/Hal/Corpus">000796</idno>
<idno type="wicri:Area/Hal/Curation">000796</idno>
<idno type="wicri:Area/Hal/Checkpoint">000588</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000588</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A non-cooperative game-theoretic framework for resource allocation in network virtualization</title>
<author><name sortKey="Seddiki, Mohamed Said" sort="Seddiki, Mohamed Said" uniqKey="Seddiki M" first="Mohamed Said" last="Seddiki">Mohamed Said Seddiki</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-23718" status="VALID"><orgName>Unité de Recherche en Réseaux Radio Mobile Multimédia</orgName>
<orgName type="acronym">MEDIATRON</orgName>
<desc><address><addrLine>Cité Technologique des Communications, Route de Raoued Km 3.5, 2083 El Ghazala, Ariana Email : Mediatron@laposte.net Tél. : 00 216 - 71 857 000 (Poste 1032)</addrLine>
<country key="TN"></country>
</address>
<ref type="url">http://www.supcom.mincom.tn/mediatron/</ref>
</desc>
<listRelation><relation active="#struct-307978" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-307978" type="direct"><org type="institution" xml:id="struct-307978" status="INCOMING"><orgName>Ecole Supérieure des Communications de Tunis</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Tunisie</country>
</affiliation>
</author>
<author><name sortKey="Frikha, Mounir" sort="Frikha, Mounir" uniqKey="Frikha M" first="Mounir" last="Frikha">Mounir Frikha</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-23718" status="VALID"><orgName>Unité de Recherche en Réseaux Radio Mobile Multimédia</orgName>
<orgName type="acronym">MEDIATRON</orgName>
<desc><address><addrLine>Cité Technologique des Communications, Route de Raoued Km 3.5, 2083 El Ghazala, Ariana Email : Mediatron@laposte.net Tél. : 00 216 - 71 857 000 (Poste 1032)</addrLine>
<country key="TN"></country>
</address>
<ref type="url">http://www.supcom.mincom.tn/mediatron/</ref>
</desc>
<listRelation><relation active="#struct-307978" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-307978" type="direct"><org type="institution" xml:id="struct-307978" status="INCOMING"><orgName>Ecole Supérieure des Communications de Tunis</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Tunisie</country>
</affiliation>
</author>
<author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205122" status="VALID"><idno type="RNSR">200418297A</idno>
<orgName>Management of dynamic networks and services</orgName>
<orgName type="acronym">MADYNES</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/madynes</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423085" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423085" type="direct"><org type="department" xml:id="struct-423085" status="VALID"><orgName>Department of Networks, Systems and Services</orgName>
<orgName type="acronym">LORIA - NSS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/networks-systems-and-services</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1007/s11235-015-9995-7</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term> Game theory</term>
<term> Nash equilibrium</term>
<term> Resource allocation</term>
<term> Virtual Network Embedding</term>
<term>Network Virtualization</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Network virtualization is a new technology thataimsatallowingmultiplevirtualnetworks(VNs)tocoexistinthe same equipment and to hide the heterogeneity of networkinfrastructure. The critical issue for a given infrastructureprovider (InP), is how to provide customized and on demandresources for multiple service providers (SPs) with differentQualityofService(QoS)requirements.Theshouldalsofairlydistribute the network physical resources, such as bandwidthof each physical link, buffer spaces, and processing cycles ateach node. In this paper, we propose a new framework basedon game theory, for both link and node dynamic allocationbetween multiple infrastructure providers (InPs) and serviceproviders (SPs). Our approach focuses on provisioning andmanaging the physical resources in a virtualized networkinfrastructure. We propose a two-stage approach based onnon-cooperative games. The first one is the resource negotiation game where the SP requests link and node resourcesfrom multiple InPs. The InP may reject the SP’s requestwhen it can potentially cause network congestion. The second stage of the proposal concerns dynamic resource provisioning and consists of two non cooperative games; the node allocation game and the link allocation game. Theobjective of both games is to allocate physical resources fordifferent isolated VNs that are sharing the same physicalsubstrate network. In the node allocation game, the proportional share mechanism is used. Every SP assigns a weightand submits a bid to each physical node and thereafter itreceives a share proportional to its bid. In the link allocation game we investigate the case when multiple SPs compete for a portion of the available physical network capacity.Simulation results show that the proposed approach achieveshigh resource utilization, improves the network performance,and fairly distributes the link and node resources betweenmultiple SPs.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">A non-cooperative game-theoretic framework for resource allocation in network virtualization</title>
<author role="aut"><persName><forename type="first">Mohamed Said</forename>
<surname>Seddiki</surname>
</persName>
<email>seddiki.said@gmail.com</email>
<ptr type="url" target="http://www.loria.fr/~mseddiki/"></ptr>
<idno type="halauthor">1260366</idno>
<affiliation ref="#struct-23718"></affiliation>
<affiliation ref="#struct-205122"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Mounir</forename>
<surname>Frikha</surname>
</persName>
<email></email>
<idno type="halauthor">664013</idno>
<affiliation ref="#struct-23718"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ye-Qiong</forename>
<surname>Song</surname>
</persName>
<email>song@loria.fr</email>
<ptr type="url" target="http://www.loria.fr/~song"></ptr>
<idno type="halauthor">775999</idno>
<affiliation ref="#struct-205122"></affiliation>
</author>
<editor role="depositor"><persName><forename>Ye-Qiong</forename>
<surname>Song</surname>
</persName>
<email>Ye-Qiong.Song@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2015-12-21 17:58:15</date>
<date type="whenWritten">2015-03-21</date>
<date type="whenModified">2015-12-23 01:04:30</date>
<date type="whenReleased">2015-12-21 17:58:15</date>
<date type="whenProduced">2015-03-21</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="104153"><persName><forename>Ye-Qiong</forename>
<surname>Song</surname>
</persName>
<email>Ye-Qiong.Song@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01247364</idno>
<idno type="halUri">https://hal.inria.fr/hal-01247364</idno>
<idno type="halBibtex">seddiki:hal-01247364</idno>
<idno type="halRefHtml">Telecommunication Systems, Springer, 2015, <10.1007/s11235-015-9995-7></idno>
<idno type="halRef">Telecommunication Systems, Springer, 2015, <10.1007/s11235-015-9995-7></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA2">INRIA 2</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A non-cooperative game-theoretic framework for resource allocation in network virtualization</title>
<author role="aut"><persName><forename type="first">Mohamed Said</forename>
<surname>Seddiki</surname>
</persName>
<email>seddiki.said@gmail.com</email>
<ptr type="url" target="http://www.loria.fr/~mseddiki/"></ptr>
<idno type="halAuthorId">1260366</idno>
<affiliation ref="#struct-23718"></affiliation>
<affiliation ref="#struct-205122"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Mounir</forename>
<surname>Frikha</surname>
</persName>
<idno type="halAuthorId">664013</idno>
<affiliation ref="#struct-23718"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Ye-Qiong</forename>
<surname>Song</surname>
</persName>
<email>song@loria.fr</email>
<ptr type="url" target="http://www.loria.fr/~song"></ptr>
<idno type="halAuthorId">775999</idno>
<affiliation ref="#struct-205122"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="INCOMING">88358</idno>
<title level="j">Telecommunication Systems, Springer</title>
<imprint><date type="datePub">2015-03-21</date>
<date type="dateEpub">2015-03-21</date>
</imprint>
</monogr>
<idno type="doi">10.1007/s11235-015-9995-7</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Network Virtualization</term>
<term xml:lang="en"> Virtual Network Embedding</term>
<term xml:lang="en"> Resource allocation</term>
<term xml:lang="en"> Game theory</term>
<term xml:lang="en"> Nash equilibrium</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Network virtualization is a new technology thataimsatallowingmultiplevirtualnetworks(VNs)tocoexistinthe same equipment and to hide the heterogeneity of networkinfrastructure. The critical issue for a given infrastructureprovider (InP), is how to provide customized and on demandresources for multiple service providers (SPs) with differentQualityofService(QoS)requirements.Theshouldalsofairlydistribute the network physical resources, such as bandwidthof each physical link, buffer spaces, and processing cycles ateach node. In this paper, we propose a new framework basedon game theory, for both link and node dynamic allocationbetween multiple infrastructure providers (InPs) and serviceproviders (SPs). Our approach focuses on provisioning andmanaging the physical resources in a virtualized networkinfrastructure. We propose a two-stage approach based onnon-cooperative games. The first one is the resource negotiation game where the SP requests link and node resourcesfrom multiple InPs. The InP may reject the SP’s requestwhen it can potentially cause network congestion. The second stage of the proposal concerns dynamic resource provisioning and consists of two non cooperative games; the node allocation game and the link allocation game. Theobjective of both games is to allocate physical resources fordifferent isolated VNs that are sharing the same physicalsubstrate network. In the node allocation game, the proportional share mechanism is used. Every SP assigns a weightand submits a bid to each physical node and thereafter itreceives a share proportional to its bid. In the link allocation game we investigate the case when multiple SPs compete for a portion of the available physical network capacity.Simulation results show that the proposed approach achieveshigh resource utilization, improves the network performance,and fairly distributes the link and node resources betweenmultiple SPs.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000588 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000588 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Checkpoint |type= RBID |clé= Hal:hal-01247364 |texte= A non-cooperative game-theoretic framework for resource allocation in network virtualization }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |