Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (Q693801): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BRITE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2012/358647 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099159281 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58908523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank

Latest revision as of 23:10, 5 July 2024

scientific article
Language Label Description Also known as
English
Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
scientific article

    Statements

    Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2012
    0 references
    Summary: Virtual network embedding (VNE) is a key area in network virtualization, and the overall purpose of VNE is to map virtual networks onto an underlying physical network referred to as a substrate. Typically, the virtual networks have certain demands, such as resource requirements, that need to be satisfied by the mapping process. A virtual network (VN) can be described in terms of vertices (nodes) and edges (links) with certain resource requirements, and, to embed a VN, substrate resources are assigned to these vertices and edges. Substrate networks have finite resources and utilizing them efficiently is an important objective for a VNE method. This paper analyzes two existing vertex mapping approaches-one which only considers if enough node resources are available for the current VN mapping and one which considers to what degree a node already is utilized by existing VN embeddings before doing the vertex mapping. The paper also proposes a new vertex mapping approach which minimizes complete exhaustion of substrate nodes while still providing good overall resource utilization. Experimental results are presented to show under what circumstances the proposed vertex mapping approach can provide superior VN embedding properties compared to the other approaches.
    0 references

    Identifiers