Resource Scheduling And Reliability Guarantee Research Of Cross-domain Network Slice

With the development of Internet information technology,various network services emerge in an endless stream,which makes the rigidity of Internet architecture more and more serious.Network virtualization technology can make multi-heterogeneous virtual networks happen without changing the underlying physical network architecture.Now it has gradually become an important factor to solve the future network architecture.As the key technology of network virtualization,the basic network slicing problem,i.e.single domain virtual network mapping,has achieved some remarkable results in recent years.However,with the updating of network services,single-domain network chips can not meet people's needs gradually.The underlying network slicing across multiple autonomous domains has attracted more and more attention.Compared with single domain network slicing,cross domain network slicing faces many new challenges,such as:(1)Centralized mapping for distributed autonomous domains;(2)Inter-domain link mapping in cross-domain virtual network mapping;(3)Reliability assurance of cross-domain network slices,etc.In view of the above three challenges,a centralized two-stage cross-domain virtual network mapping algorithm is proposed.Firstly,the inter-domain link mapping is carried out,and the virtual network is divided into several sub-networks,then intra-domain network mapping is carried out for each sub-network.The main work is as follows:(1)Analyze the research status of ontology knowledge base both at home and abroad,and point out that the key problem of the current knowledge base is the lack of ability to analyze problems.At the same time,some theoretical knowledge in the TRIZ theoretical system was explored.By analyzing the characteristics of the ontology knowledge base,we find a more reasonable and effective method to combine the TRIZ partial theoretical knowledge with the ontology knowledge base.Besides,the development history of named entity recognition is reviewed,and the research status of named entity recognition based on CRF is analyzed.(2)Study the mapping part of inter-domain links.Because virtual network partitioning is a NP-hard problem,considered that inter-domain links are embedded in WAN,its mapping cost is much greater than that of intra-domain links.Existing research is mainly based on heuristic algorithm,which aims at resource optimization to solve virtual network partitioning problem.However,there is still much room for optimization,so we propose a cross-domain virtual network partitioning algorithm based on GA_PSO hybrid algorithm,which does heuristic search on the partition scheme,aiming at minimizing the mapping overhead.(3)Considered that in the multi-data center situation,there are many physical nodes and the reliability of nodes is varied,a reliable intra-domain virtual network mapping algorithm based on reliable perception of underlying nodes is proposed,and on this basis,the problem of fault recovery is considered.Based on the idea of K-node redundancy in single-node failure model,an enhanced virtual network is established for intra-domain virtual networks,which to a greater extent,guaranties reliability of intra-domain virtual network.