The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Virtual Network Embedding (VNE) is widely considered as a longstanding challenge in Network Virtualization: how to efficiently embed multiple virtual networks (VNs), with node-link resource requirements, onto the shared substrate network (SN), having finite underlying resources. Most heuristic VNE algorithms in the literature, only considering single network topology attribute and local network resources,...
This paper investigates the network function virtualization (NFV)-enabled multicast problem, and proposes a steiner tree-based algorithm to reduce the cost of virtual network function (VNF) deployment and routing. In the algorithm, to minimize the bandwidth consumption, the Steiner tree is constructed by taking all the destination nodes as the terminals. Then a interconnection node of the tree is...
Network virtualization (NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks (VNs) with different protocols to coexist on a shared substrate network (SN). One main challenge in NV is virtual network embedding (VNE). VNE is a NP-hard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are...
Virtual Network Embedding (VNE) problem has been widely considered as an important challenge in Network Virtualization (NV): how to embed virtual networks onto the shared substrate network effectively and efficiently. Previous VNE algorithms, only considering single network topology attribute and local resource of each node, may lead to inefficient resource utilization of the substrate network in...
Virtual network embedding (VNE) problem has been widely accepted as an important aspect in network virtualization (NV) area: how to efficiently embed virtual networks, with node and link resource demands, onto the shared substrate network that has finite network resources. Previous VNE heuristic algorithms, only considering single network topology attribute and local resources of each node, may lead...
The main challenge in network visualization is known as so called virtual network embedding(VNE). Most proposed VNE algorithms are heuristic so far in the literature. This paper presents an exact algorithm based on the Integer Linear Programming(ILP) of optimization theory. The exact algorithm VNE-ILP is able to simultaneously map virtual nodes and virtual links of VNRs. The constraint of virtual...
One main challenge in network virtualization is known as virtual network embedding(VNE). VNE is NP-hard and most algorithms in the literature are heuristic. This paper presents an exact algorithm based on the Integer Linear Programming(ILP). The exact algorithm aims to simultaneously minimize the cost of substrate network and average virtual link delay of mapped VNRs. Simulation results reveal that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.