Service-Oriented Network Virtualization Architecture for Internet of Things

As a key technology to realize smart services of Internet of Things（IoT）, network virtualization technology can support the network diversification and ubiquity, and improve the utilization rate of network resources. This paper studies the service-ori- ented network virtualization architecture for loT services. Firstly the semantic description method for loT services is proposed, then the resource representation model and resource management model in the environment of network virtualization are presented. Based on the above models, the service-oriented virtual network architecture for loT is established. Finally, a smart campus system is designed and deployed based on the service-oriented virtual network architecture. Moreover, the proposed architecture and models are verified in experiments.

A highly reliable embedding algorithm for airborne tactical network virtualization

The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(VNE)is a key part.However,existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field.In this context,a highly reliable VNE algorithm based on the transmission rate for ATN virtualization(TR-ATVNE)is proposed to adapt well to the specific electromagnetic environment of ATN.Our algorithm coordinates node and link mapping.In the node mapping,transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks.Meanwhile,a feasible splitting rule is proposed for path splitting in the link mapping,considering the interference between wireless links.Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference.

Network Virtualization Based Seamless Networking Scheme for Fiber-Wireless （FiWi） Networks

In order to reduce cost and complexity,fiber-wireless(FiWi) networks emerge,combining the huge amount of available bandwidth of fiber networks and the flexibility,mobility of wireless networks.However,there is still a long way to go before taking fiber and wireless systems as fully integrated networks.In this paper,we propose a network visualization based seamless networking scheme for FiWi networks,including hierarchical model,service model,service implementation and dynamic bandwidth assignment(DBA).Then,we evaluate the performance changes after network virtualization is introduced.Throughput for nodes,bandwidth for links and overheads leaded by network virtualization are analyzed.The performance of our proposed networking scheme is evaluated by simulation and real implementations,respectively.The results show that,compared to traditional networking scheme,our scheme has a better performance.

Reflections on the Experience of Network Virtual Space FromPhenomenology of Technics

People create network virtual space that is completely different from the real space through network information technologies.The characteristics of network virtual space are that the subject can obtain a similar real space experience.From the perspective of phenomenology of technics,in order to analyze the virtual space of the network,it is necessary to clear the phenomenological concepts,such as space,space experience,and virtual space experience,so as to know the type of network virtual space experience,explore the essential characteristics,and find solutions to the ethical conflicts in the virtual space experience of the network.

Edge computing oriented virtual optical network mapping scheme based on fragmentation prediction

As edge computing services soar,the problem of resource fragmentation situation is greatly worsened in elastic optical networks(EON).Aimed to solve this problem,this article proposes the fragmentation prediction model that makes full use of the gate recurrent unit(GRU)algorithm.Based on the fragmentation prediction model,one virtual optical network mapping scheme is presented for edge computing driven EON.With the minimum of fragmentation degree all over the whole EON,the virtual network mapping can be successively conducted.Test results show that the proposed approach can reduce blocking rate,and the supporting ability for virtual optical network services is greatly improved.

Heuristic Solutions of Virtual Network Embedding： A Survey

Network virtualization(NV) is considered as an enabling tool to remove the gradual ossification of current Internet. In the network virtualization environment, a set of heterogeneous virtual networks(VNs), isolated from each other, share the underlying resources of one or multiple substrate networks(SNs) according to the resource allocation strategy. This kind of resource allocation strategy is commonly known as so called Virtual Network Embedding(VNE) algorithm in network virtualization. Owing to the common sense that VNE problem is NP-hard in nature, most of VNE algorithms proposed in the literature are heuristic. This paper surveys and analyzes a number of representative heuristic solutions in the literature. Apart from the analysis of representative heuristic solutions, a taxonomy of the heuristic solutions is also presented in the form of table. Future research directions of VNE, especially for the heuristics, are emphasized and highlighted at the end of this survey.

A Topology-Cognitive Algorithm Framework for Virtual Network Embedding Problem

The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.

A Survey of Embedding Algorithm for Virtual Network Embedding

Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

Node Ranking Strategy in Virtual Network Embedding: An Overview

Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.

Optimizations for High Performance Network Virtualization

The increasing requirements of intensive interoperaterbility among the distributed nodes desiderate the high performance network connections, owing to the substantial growth of cloud computing and datacenters. Network I/O virtualization aggregates the network resource and separates it into manageable parts for particular servers or devices, which provides effective consolidation and elastic management with high agility, flexibility and scalability as well as reduced cost and cabling. However, both network I/O virtualization aggregation and the increasing network speed incur higher traffic density, which generates a heavy system stress for I/O data moving and I/O event processing. Consequently, many researchers have dedicated to enhancing the system performance and alleviating the system overhead for high performance networking virtualizatiou. This paper first elaborates the mainstreaming I/O virtualization methodologies, including device emulation, split-driver model and hardware assisted model. Then, the paper discusses and compares their specific advantages in addition to performance bottlenecks in practical utilities. This paper mainly focuses on the comprehensive survey of state- of-the-art approaches for performance optimizations and improvements as well as the portability management for network I/O virtualization. The approaches include various novel data delivery schemes, overhead mitigations for interrupt processing and adequate resource allocations for dynamic network states. Finally, we highlight the diversity of I/O virtualization besides the performance improvements in network virtualization infrastructure.

Virtualized Wireless SDNs:Modelling Delay Through the Use of Stochastic Network Calculus

Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN is network virtualization, which logically divides one wireless network element, such as a base station, into multiple slices, and each slice serving as a standalone virtual BS. In this way, one physical mobile wireless network can be partitioned into multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.

Efficient Virtual Network Embedding Algorithm Based on Restrictive Selection and Optimization Theory Approach

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 NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.

Virtualizing Network and Service Functions: Impact on ICT Transformation and Standardization

Virtualization of network/service functions means time sharing network/service（and affiliated）resources in a hyper speed manner.The concept of time sharing was popularized in the 1970s with mainframe computing.The same concept has recently resurfaced under the guise of cloud computing and virtualized computing.Although cloud computing was originally used in IT for server virtualization,the ICT industry is taking a new look at virtualization.This paradigm shift is shaking up the computing,storage,networking,and ser vice industries.The hope is that virtualizing and automating configuration and service management/orchestration will save both capes and opex for network transformation.A complimentary trend is the separation（over an open interface）of control and transmission.This is commonly referred to as software defined networking（SDN）.This paper reviews trends in network/service functions,efforts to standardize these functions,and required management and orchestration.

Virtual network mapping algorithm for large-scale network environment

A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.

A dynamic and resource sharing virtual network mapping algorithm

Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.

On Effective Virtual Networks Interconnection

The network services today require extremely agile and mobile, however, the traditional IP infrastructures are so rigid that cannot fit services well. A way should be put forward to automate the network to improve responsiveness to change. SDN and network virtualization(NV) are two hottest approaches to make networking more automated and scalable to support virtualized and cloud environments. Network virtualization combines hardware and software network resources and network functionality into a single virtual network. SDN is created to simplify traffic management and achieve operational efficiencies by establish and exercising central control over packet forwarding. In this paper, we focus on the situation where SDN controller needs to connect two virtual networks temporarily. We put forward three algorithms to try to make this connection more effective and evaluate these three algorithms.

Virtual 5G Network Embedding in a Heterogeneous and Multi-Domain Network Infrastructure

The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.

Defending Against Link Failure in Virtual Network Embedding Using a Hybrid Scheme

Nowadays network virtualization is utterly popular.As a result,how to protect the virtual networks from attacking on the link is increasingly important.Existing schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data tampering.To offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual network.Considering different security requirement for virtual link,we devise a hybrid scheme to protect the virtual links.For the critical links,MD scheme is adopted.For the other links,we adopt the Shared Backup Scheme.Our simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.