Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ UPCommons. Portal de...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Recolector de Ciencia Abierta, RECOLECTA
Bachelor thesis . 2015
License: CC BY NC ND
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Recolector de Ciencia Abierta, RECOLECTA
Bachelor thesis . 2015
License: CC BY NC ND
versions View all 4 versions
addClaim

Contribution to the coordinated virtual network embedding problem in network virtualization

Contribución al problema del mapeo coordinado de redes virtuales en la virtualización de redes
Authors: Dalmases Trilla, Antoni;

Contribution to the coordinated virtual network embedding problem in network virtualization

Abstract

La virtualització de xarxa ha estat àmpliament proposada com una alternativa a la implementació de noves xarxes físiques amb característiques específiques. La virtualització de xarxa es basa en assignar xarxes virtuals amb diferents demandes en la mateixa xarxa substrat. No obstant això, aquesta implementació implica el problema de com assignar aquestes xarxes virtuals de forma eficient depenent d'unes restriccions preestablertes com el consum d'energia o el throughput. Aquesta tesi és la continuació d'una altra en la qual es va estudiar el comportament de la xarxa quan, per un nombre fix de xarxes virtuals, la demanda de cadascuna d'elles anava augmentant. El nou escenari proposat es basa en l'augment del nombre de sol•licituds de xarxes virtuals per a una sola càrrega baixa per obtenir millors resultats. Amb aquesta finalitat, s'analitza l'entorn de simulació utilitzat en el treball anterior i es simula el nou enfocament. Els resultats de l'escenari proposat demostren un millor rendiment en termes d'eficiència, és a dir, els recursos de la xarxa substrat són millor assignats que en el treball anterior.

La virtualización de red ha sido ampliamente propuesta como una alternativa a la implementación de nuevas redes físicas con características específicas. La virtualización de red se basa en asignar redes virtuales con diferentes demandas en la misma red sustrato. Sin embargo, esta implementación implica el problema de cómo asignar estas redes virtuales de forma eficiente dependiendo de unas restricciones preestablecidas como el consumo de energía o el throughput. Esta tesis es la continuación de otra en la que se estudió el comportamiento de la red cuando, per un número fijo de redes virtuales, la demanda de cada una de ellas iba aumentando. El nuevo escenario propuesto se basa en el aumento del número de solicitudes de redes virtuales por a una sola carga baja para obtener mejores resultados. Con esta finalidad, se analiza el entorno de simulación utilizado en el trabajo anterior y se simula el nuevo enfoque. Los resultados del escenario propuesto demuestran un mejor rendimiento en términos de eficiencia, es decir, los recursos de la red sustrato son mejor asignados que en el trabajo anterior.

Network virtualization has been widely proposed as an alternative to the implementation of new physical networks with specific characteristics. Network virtualization is based on assigning virtual networks with different demands on the same substrate network. However, this implementation involves the problem of how to allocate these virtual networks efficiently depending on pre-established constraints such as energy consumption or throughput. This thesis is the continuation of another one in which the network behavior was studied when, for a fixed number of virtual networks, the demand of each one was increasing. The new proposed scenario is based on raising the number of virtual network requests for only one low load to obtain better results. To this end, the simulation environment used in the previous work is analyzed and the new approach is simulated. The results of proposed scenario demonstrate better performances in terms of efficiency, i.e. the substrate network resources are better assigned than in the previous work.

The VNE problem is studied in the literature using different mechanism. In this work, coordinated allocation mechanisms (node and link) will be considered in order to enhance the results.

Country
Spain
Keywords

Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors, redes, Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors, :Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors [Àrees temàtiques de la UPC], network, virtualización, Virtual computer systems, virtualization, :Informàtica::Arquitectura de computadors [Àrees temàtiques de la UPC], Sistemes virtuals (Informàtica)

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 33
    download downloads 46
  • 33
    views
    46
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
33
46
Green