FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W851982196> ?p ?o ?g. }

• W851982196 abstract "Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change and to enable a new business model decoupling the network services from the underlying infrastructure. The problem of embedding virtual networks in a substrate network is the main resource allocation challenge in network virtualization and is usually referred to as the Virtual Network Embedding (VNE) problem. VNE deals with the allocation of virtual resources both in nodes and links. Therefore, it can be divided into two sub-problems:Virtual Node Mapping where virtual nodes have to be allocated in physical nodes and Virtual Link Mapping where virtual links connecting these virtual nodes have to be mapped to paths connecting the corresponding nodes in the substrate network. Application of network virtualization relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as VNE algorithms. This thesis proposes a set of contributions to solve the research challenges of the VNE that have not been tackled by the research community. To do that, it performs a deep and comprehensive survey of virtual network embedding. The first research challenge identified is the lack of proposals to solve the virtual link mapping stage of VNE using single path in the physical network. As this problem is NP-hard, existing proposals solve it using well known shortest path algorithms that limit the mapping considering just one constraint. This thesis proposes the use of a mathematical multi-constraint routing framework called paths algebra to solve the virtual link mapping stage. Besides, the thesis introduces a new demand caused by virtual link demands into physical nodes acting as intermediate (hidden) hops in a path of the physical network. Most of the current VNE approaches are centralized. They suffer of scalability issues and provide a single point of failure. In addition, they are not able to embed virtual network requests arriving at the same time in parallel. To solve this challenge, this thesis proposes a distributed, parallel and universal virtual network embedding framework. The proposed framework can be used to run any existing embedding algorithm in a distributed way. Thereby, computationalload for embedding multiple virtual networks is spread across the substrate network Energy efficiency is one of the main challenges in future networkingenvironments. Network virtualization can be used to tackle this problem by sharing hardware, instead of requiring dedicated hardware for each instance. Until now, VNE algorithms do not consider energy as a factor for the mapping. This thesis introduces the energy aware VNE where the main objective is to switch off as many network nodes and interfaces as possible by allocating the virtual demands to a consolidated subset of active physical networking equipment. To evaluate and validate the aforementioned VNE proposals, this thesis helped in the development of a software framework called ALgorithms for Embedding VIrtual Networks (ALEVIN). ALEVIN allows to easily implement, evaluate and compare different VNE algorithms according to a set of metrics, which evaluate the algorithms and compute their results on a given scenario for arbitrary parameters." @default.
• W851982196 created "2016-06-24" @default.
• W851982196 creator A5080875482 @default.
• W851982196 creator A5083264113 @default.
• W851982196 date "2013-06-21" @default.
• W851982196 modified "2023-09-28" @default.
• W851982196 title "Study, evaluation and contributions to new algorithms for the embedding problem in a network virtualization environment" @default.
• W851982196 cites W1492640216 @default.
• W851982196 cites W1497256448 @default.
• W851982196 cites W1509692431 @default.
• W851982196 cites W1510912659 @default.
• W851982196 cites W1581057091 @default.
• W851982196 cites W1649594682 @default.
• W851982196 cites W1737660401 @default.
• W851982196 cites W1776380351 @default.
• W851982196 cites W1801849579 @default.
• W851982196 cites W1891716741 @default.
• W851982196 cites W1905105378 @default.
• W851982196 cites W1931176935 @default.
• W851982196 cites W1966600255 @default.
• W851982196 cites W1969702481 @default.
• W851982196 cites W1970475951 @default.
• W851982196 cites W1975937845 @default.
• W851982196 cites W1978071186 @default.
• W851982196 cites W1980424972 @default.
• W851982196 cites W1981816480 @default.
• W851982196 cites W1992970668 @default.
• W851982196 cites W1997154861 @default.
• W851982196 cites W2000159929 @default.
• W851982196 cites W2000483727 @default.
• W851982196 cites W2000500823 @default.
• W851982196 cites W2000776492 @default.
• W851982196 cites W2002227246 @default.
• W851982196 cites W2004951603 @default.
• W851982196 cites W2006903864 @default.
• W851982196 cites W2006928975 @default.
• W851982196 cites W2011300914 @default.
• W851982196 cites W2014952121 @default.
• W851982196 cites W2021304276 @default.
• W851982196 cites W2022051843 @default.
• W851982196 cites W2024060531 @default.
• W851982196 cites W2027292802 @default.
• W851982196 cites W2027588582 @default.
• W851982196 cites W2031627300 @default.
• W851982196 cites W2032969381 @default.
• W851982196 cites W2035752630 @default.
• W851982196 cites W2037843527 @default.
• W851982196 cites W2045821269 @default.
• W851982196 cites W2045992715 @default.
• W851982196 cites W2047421567 @default.
• W851982196 cites W2056500876 @default.
• W851982196 cites W2057793893 @default.
• W851982196 cites W206565998 @default.
• W851982196 cites W2068991708 @default.
• W851982196 cites W2069832221 @default.
• W851982196 cites W2070985168 @default.
• W851982196 cites W2078771756 @default.
• W851982196 cites W2079451943 @default.
• W851982196 cites W2081750469 @default.
• W851982196 cites W2085105966 @default.
• W851982196 cites W2094542421 @default.
• W851982196 cites W2095256725 @default.
• W851982196 cites W2095437702 @default.
• W851982196 cites W2095764782 @default.
• W851982196 cites W2097095826 @default.
• W851982196 cites W2097524240 @default.
• W851982196 cites W2100841731 @default.
• W851982196 cites W2101089925 @default.
• W851982196 cites W2101296223 @default.
• W851982196 cites W2101498824 @default.
• W851982196 cites W2103707056 @default.
• W851982196 cites W2105808107 @default.
• W851982196 cites W2107198105 @default.
• W851982196 cites W2107589467 @default.
• W851982196 cites W2108732836 @default.
• W851982196 cites W2109341366 @default.
• W851982196 cites W2109983959 @default.
• W851982196 cites W2110363239 @default.
• W851982196 cites W2110636406 @default.
• W851982196 cites W2110699713 @default.
• W851982196 cites W2114298221 @default.
• W851982196 cites W2114686820 @default.
• W851982196 cites W2115456330 @default.
• W851982196 cites W2119131515 @default.
• W851982196 cites W2119775299 @default.
• W851982196 cites W2120315538 @default.
• W851982196 cites W2122671526 @default.
• W851982196 cites W2125150972 @default.
• W851982196 cites W2128291817 @default.
• W851982196 cites W2130063684 @default.
• W851982196 cites W2130267070 @default.
• W851982196 cites W2131058166 @default.
• W851982196 cites W2132981780 @default.
• W851982196 cites W2135463606 @default.
• W851982196 cites W2137421268 @default.
• W851982196 cites W2140471436 @default.
• W851982196 cites W2141373973 @default.
• W851982196 cites W2142547489 @default.
• W851982196 cites W2146164879 @default.
• W851982196 cites W2146613545 @default.

• next