Orchestrating Network Functions in Software-Defined Networks

Software.defined networking(SDN) enables third.part companies to participate in the network function innovations. A number of instances for one network function will inevitably co.exist in the network. Although some orchestration architecture has been proposed to chain network functions, rare works are focused on how to optimize this process. In this paper, we propose an optimized model for network function orchestration, function combination model(FCM). Our main contributions are as following. First, network functions are featured with a new abstraction, and are open to external providers. And FCM identifies network functions using unique type, and organizes their instances distributed over the network with the appropriate way. Second, with the specialized demands, we can combine function instances under the global network views, and formulate it into the problem of Boolean linear program(BLP). A simulated annealing algorithm is designed to approach optimal solution for this BLP. Finally, the numerical experiment demonstrates that our model can create outstanding composite schemas efficiently.

Optimize the Deployment and Integration for Multicast-Oriented Virtual Network Function Tree

Due to the development of network technology,the number of users is increasing rapidly,and the demand for emerging multicast services is becoming more and more abundant,traffic data is increasing day by day,network nodes are becoming denser,network topology is becoming more complex,and operators’equipment operation and maintenance costs are increasing.Network functions virtualization multicast issues include building a traffic forwarding topology,deploying the required functions,and directing traffic.Combining the two is still a problem to be studied in depth at present,and this paper proposes a two-stage solution where the decisions of these two stages are interdependent.Specifically,this paper decouples multicast traffic forwarding and function delivery.The minimum spanning tree of traffic forwarding is constructed by Steiner tree,and the traffic forwarding is realized by Viterbi-algorithm.Use a general topology network to examine network cost and service performance.Simulation results show that this method can reduce overhead and delay and optimize user experience.

Network Function Virtualization Technology:Progress and Standardization

Network innovation and business transformation are both necessary for telecom operators to adapt to new situations, but operators face challenges in terms of network bearer complexity, business centralization, and IT/CT integration. Network function virtualization （NFV） may inspire new development ideas, but many doubts still exist within industry, especially about how to introduce NFV into an operator＇ s network. This article describes the latest progress in NFV standardization, NFV requirements and hot technology issues, and typical NFV applications in an operator networks.

Enhanced Reliability in Network Function Virtualization by Hybrid Hexagon-Cost Efficient Algorithm

In this,communication world, the Network Function Virtualization concept is utilized for many businesses, small services to virtualize the network nodefunction and to build a block that may connect the chain, communication services.Mainly, Virtualized Network Function Forwarding Graph (VNF-FG) has beenused to define the connection between the VNF and to give the best end-to-endservices. In the existing method, VNF mapping and backup VNF were proposedbut there was no profit and reliability improvement of the backup and mapping ofthe primary VNF. As a consequence, this paper offers a Hybrid Hexagon-CostEfficient algorithm for determining the best VNF among multiple VNF and backing up the best VNF, lowering backup costs while increasing dependability. TheVNF is chosen based on the highest cost-aware important measure (CIM) rate,which is used to assess the relevance of the VNF forwarding graph.To achieveoptimal cost-efficiency, VNF with the maximum CIM is selected. After the selection process, updating is processed by three steps which include one backup VNFfrom one SFC, two backup VNF from one Service Function Chain (SFC),and twobackup VNF from different SFC. Finally, this proposed method is compared withCERA, MinCost, MaxRbyInr based on backup cost, number of used PN nodes,SFC request utility, and latency. The simulation result shows that the proposedmethod cuts down the backup cost and computation time by 57% and 45% compared with the CER scheme and improves the cost-efficiency. As a result, this proposed system achieves less backup cost, high reliability, and low timeconsumption which can improve the Virtualized Network Function operation.

An Approach for Network Function Combination Based on Least Busy Placement Algorithm

Recently, integrating Softwaredefined networking(SDN) and network functions virtualization(NFV) are proposed to address the issue that difficulty and cost of hardwarebased and proprietary middleboxes management. However, it lacks of a framework that orchestrates network functions to service chain in the network cooperatively. In this paper, we propose a function combination framework that can dynamically adapt the network based on the integration NFV and SDN. There are two main contributions in this paper. First, the function combination framework based on the integration of SDN and NFV is proposed to address the function combination issue, including the architecture of Service Deliver Network, the port types representing traffic directions and the explanation of terms. Second, we formulate the issue of load balance of function combination as the model minimizing the standard deviations of all servers' loads and satisfying the demand of performance and limit of resource. The least busy placement algorithm is introduced to approach optimal solution of the problem. Finally, experimental results demonstrate that the proposed method can combine functions in an efficient and scalable way and ensure the load balance of the network.

Providing Customized Security Based on Network Function Composition and Reconfiguration

Real-time multimedia sharing in Consumer-centric Multimedia Network(CMN) requires usability anywhere, anytime and from any device. However, CMNs are usually located or implemented on application layer, which makes CMNs subjected to their fixed substrate security framework. A fundamental diversifying attribute for the customized security experiences of CMNs is pressing. This paper proposes a programmable network structure which is named Service Processing Chain(SPC) based on network function combination. The SPC is established by the ordinal combination of network functions in substrate switches dynamically, and therefore constructs a special channel for each CMN with required security. The construction and reconfiguration algorithms of SPC are also discussed in this paper. Evaluations and implementation show that above approaches are effective in providing multilevel security with flexibility and expansibility. It is believed that the SPC could provide customized security service and drive participative real-time multimedia sharing for CMNs.

Using the Cooperative Game for Service Placement of Virtual Network Functions

To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.

COATES GRAPH APPROACH FOR GENERATING SYMBOLIC NETWORK FUNCTION

In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated.

MODIFIED DOUBLE-GRAPH DECOMPOSITION ANALYSIS FOR FINDING SYMBOLIC NETWORK FUNCTIONS

The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex seta are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the modified double-graph method, a new decomposition analysis-modified double-graph decomposition analysis is presented for finding symbolic network functions. Its advantages are that the resultant symbolic expressions are compact and contain no cancellation terms, and its sign evaluation is very simple.

Resting-state brain network remodeling after different nerve reconstruction surgeries:a functional magnetic resonance imaging study in brachial plexus injury rats

Distinct brain remodeling has been found after different nerve reconstruction strategies,including motor representation of the affected limb.However,differences among reconstruction strategies at the brain network level have not been elucidated.This study aimed to explore intranetwork changes related to altered peripheral neural pathways after different nerve reconstruction surgeries,including nerve repair,endto-end nerve transfer,and end-to-side nerve transfer.Sprague–Dawley rats underwent complete left brachial plexus transection and were divided into four equal groups of eight:no nerve repair,grafted nerve repair,phrenic nerve end-to-end transfer,and end-to-side transfer with a graft sutured to the anterior upper trunk.Resting-state brain functional magnetic resonance imaging was obtained 7 months after surgery.The independent component analysis algorithm was utilized to identify group-level network components of interest and extract resting-state functional connectivity values of each voxel within the component.Alterations in intra-network resting-state functional connectivity were compared among the groups.Target muscle reinnervation was assessed by behavioral observation(elbow flexion)and electromyography.The results showed that alterations in the sensorimotor and interoception networks were mostly related to changes in the peripheral neural pathway.Nerve repair was related to enhanced connectivity within the sensorimotor network,while end-to-side nerve transfer might be more beneficial for restoring control over the affected limb by the original motor representation.The thalamic-cortical pathway was enhanced within the interoception network after nerve repair and end-to-end nerve transfer.Brain areas related to cognition and emotion were enhanced after end-to-side nerve transfer.Our study revealed important brain networks related to different nerve reconstructions.These networks may be potential targets for enhancing motor recovery.

Service Function Chain Migration in LEO Satellite Networks

With the advancements of software defined network(SDN)and network function virtualization(NFV),service function chain(SFC)placement becomes a crucial enabler for flexible resource scheduling in low earth orbit(LEO)satellite networks.While due to the scarcity of bandwidth resources and dynamic topology of LEO satellites,the static SFC placement schemes may cause performance degradation,resource waste and even service failure.In this paper,we consider migration and establish an online migration model,especially considering the dynamic topology.Given the scarcity of bandwidth resources,the model aims to maximize the total number of accepted SFCs while incurring as little bandwidth cost of SFC transmission and migration as possible.Due to its NP-hardness,we propose a heuristic minimized dynamic SFC migration(MDSM)algorithm that only triggers the migration procedure when new SFCs are rejected.Simulation results demonstrate that MDSM achieves a performance close to the upper bound with lower complexity.

Security Monitoring and Management for the Network Services in the Orchestration of SDN-NFV Environment Using Machine Learning Techniques

Software Defined Network(SDN)and Network Function Virtualization(NFV)technology promote several benefits to network operators,including reduced maintenance costs,increased network operational performance,simplified network lifecycle,and policies management.Network vulnerabilities try to modify services provided by Network Function Virtualization MANagement and Orchestration(NFV MANO),and malicious attacks in different scenarios disrupt the NFV Orchestrator(NFVO)and Virtualized Infrastructure Manager(VIM)lifecycle management related to network services or individual Virtualized Network Function(VNF).This paper proposes an anomaly detection mechanism that monitors threats in NFV MANO and manages promptly and adaptively to implement and handle security functions in order to enhance the quality of experience for end users.An anomaly detector investigates these identified risks and provides secure network services.It enables virtual network security functions and identifies anomalies in Kubernetes(a cloud-based platform).For training and testing purpose of the proposed approach,an intrusion-containing dataset is used that hold multiple malicious activities like a Smurf,Neptune,Teardrop,Pod,Land,IPsweep,etc.,categorized as Probing(Prob),Denial of Service(DoS),User to Root(U2R),and Remote to User(R2L)attacks.An anomaly detector is anticipated with the capabilities of a Machine Learning(ML)technique,making use of supervised learning techniques like Logistic Regression(LR),Support Vector Machine(SVM),Random Forest(RF),Naïve Bayes(NB),and Extreme Gradient Boosting(XGBoost).The proposed framework has been evaluated by deploying the identified ML algorithm on a Jupyter notebook in Kubeflow to simulate Kubernetes for validation purposes.RF classifier has shown better outcomes(99.90%accuracy)than other classifiers in detecting anomalies/intrusions in the containerized environment.

Assessing target optical camouflage effects using brain functional networks:A feasibility study

Brain functional networks model the brain's ability to exchange information across different regions,aiding in the understanding of the cognitive process of human visual attention during target searching,thereby contributing to the advancement of camouflage evaluation.In this study,images with various camouflage effects were presented to observers to generate electroencephalography(EEG)signals,which were then used to construct a brain functional network.The topological parameters of the network were subsequently extracted and input into a machine learning model for training.The results indicate that most of the classifiers achieved accuracy rates exceeding 70%.Specifically,the Logistic algorithm achieved an accuracy of 81.67%.Therefore,it is possible to predict target camouflage effectiveness with high accuracy without the need to calculate discovery probability.The proposed method fully considers the aspects of human visual and cognitive processes,overcomes the subjectivity of human interpretation,and achieves stable and reliable accuracy.

Brain Functional Network Changes in Patients with Poststroke Cognitive Impairment Following Acupuncture Therapy

Background: The mechanisms by which acupuncture affects poststroke cognitive impairment (PSCI) remain unclear. Objective: To investigate brain functional network (BFN) changes in patients with PSCI after acupuncture therapy. Methods: Twenty-two PSCI patients who underwent acupuncture therapy in our hospital were enrolled as research subjects. Another 14 people matched for age, sex, and education level were included in the normal control (HC) group. All the subjects underwent resting-state functional magnetic resonance imaging (rs-fMRI) scans;the PSCI patients underwent one scan before acupuncture therapy and another after. The network metric difference between PSCI patients and HCs was analyzed via the independent-sample t test, whereas the paired-sample t test was employed to analyze the network metric changes in PSCI patients before vs. after treatment. Results: Small-world network attributes were observed in both groups for sparsities between 0.1 and 0.28. Compared with the HC group, the PSCI group presented significantly lower values for the global topological properties (γ, Cp, and Eloc) of the brain;significantly greater values for the nodal attributes of betweenness centrality in the CUN. L and the HES. R, degree centrality in the SFGdor. L, PCG. L, IPL. L, and HES. R, and nodal local efficiency in the ORBsup. R, ORBsupmed. R, DCG. L, SMG. R, and TPOsup. L;and decreased degree centrality in the MFG. R, IFGoperc. R, and SOG. R. After treatment, PSCI patients presented increased degree centrality in the LING.L, LING.R, and IOG. L and nodal local efficiency in PHG. L, IOG. R, FFG. L, and the HES. L, and decreased betweenness centrality in the PCG. L and CUN. L, degree centrality in the ORBsupmed. R, and nodal local efficiency in ANG. R. Conclusion: Cognitive decline in PSCI patients may be related to BFN disorders;acupuncture therapy may modulate the topological properties of the BFNs of PSCI patients.

Fully Distributed Learning for Deep Random Vector Functional-Link Networks

In the contemporary era, the proliferation of information technology has led to an unprecedented surge in data generation, with this data being dispersed across a multitude of mobile devices. Facing these situations and the training of deep learning model that needs great computing power support, the distributed algorithm that can carry out multi-party joint modeling has attracted everyone’s attention. The distributed training mode relieves the huge pressure of centralized model on computer computing power and communication. However, most distributed algorithms currently work in a master-slave mode, often including a central server for coordination, which to some extent will cause communication pressure, data leakage, privacy violations and other issues. To solve these problems, a decentralized fully distributed algorithm based on deep random weight neural network is proposed. The algorithm decomposes the original objective function into several sub-problems under consistency constraints, combines the decentralized average consensus (DAC) and alternating direction method of multipliers (ADMM), and achieves the goal of joint modeling and training through local calculation and communication of each node. Finally, we compare the proposed decentralized algorithm with several centralized deep neural networks with random weights, and experimental results demonstrate the effectiveness of the proposed algorithm.

ADAPTIVE PREDICTIVE CONTROL OF NEAR-SPACE VEHICLE USING FUNCTIONAL LINK NETWORK

A novel nonlinear adaptive control method is presented for a near-space hypersonic vehicle （NHV） in the presence of strong uncertainties and disturbances. The control law consists of the optimal generalized predictive controller （OGPC） and the functional link network （FLN） direct adaptive law. OGPC is a continuous-time nonlinear predictive control law. The FLN adaptive law is used to offset the unknown uncertainties and disturbances in a flight through the online learning. The learning process does not need any offline training phase. The stability analyses of the NHV close-loop system are provided and it is proved that the system error and the weight learning error are uniformly ultimately hounded. Simulation results show the satisfactory performance of the con- troller for the attitude tracking.

Fusion of Activation Functions: An Alternative to Improving Prediction Accuracy in Artificial Neural Networks

The purpose of this study was to address the challenges in predicting and classifying accuracy in modeling Container Dwell Time (CDT) using Artificial Neural Networks (ANN). This objective was driven by the suboptimal outcomes reported in previous studies and sought to apply an innovative approach to improve these results. To achieve this, the study applied the Fusion of Activation Functions (FAFs) to a substantial dataset. This dataset included 307,594 container records from the Port of Tema from 2014 to 2022, encompassing both import and transit containers. The RandomizedSearchCV algorithm from Python’s Scikit-learn library was utilized in the methodological approach to yield the optimal activation function for prediction accuracy. The results indicated that “ajaLT”, a fusion of the Logistic and Hyperbolic Tangent Activation Functions, provided the best prediction accuracy, reaching a high of 82%. Despite these encouraging findings, it’s crucial to recognize the study’s limitations. While Fusion of Activation Functions is a promising method, further evaluation is necessary across different container types and port operations to ascertain the broader applicability and generalizability of these findings. The original value of this study lies in its innovative application of FAFs to CDT. Unlike previous studies, this research evaluates the method based on prediction accuracy rather than training time. It opens new avenues for machine learning engineers and researchers in applying FAFs to enhance prediction accuracy in CDT modeling, contributing to a previously underexplored area.

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.

Application of Radial Basis Function Network in Sensor Failure Detection

Aim To detect sensor failure in control system using a single sensor signal. Methods A neural predictor was designed based on a radial basis function network(RBFN), and the neural predictor learned the sensor signal on line with a hybrid algorithm composed of n means clustering and Kalman filter and then gave the estimation of the sensor signal at the next step. If the difference between the estimation and the actural values of the sensor signal exceeded a threshold, the sensor could be declared to have a failure. The choice of the failure detection threshold depends on the noise variance and the possible prediction error of neural predictor. Results and Conclusion\ The computer simulation results show the proposed method can detect sensor failure correctly for a gyro in an automotive engine.

Advancing 5G Network Applications Lifecycle Security:An ML-Driven Approach

As 5th Generation(5G)and Beyond 5G(B5G)networks become increasingly prevalent,ensuring not only networksecurity but also the security and reliability of the applications,the so-called network applications,becomesof paramount importance.This paper introduces a novel integrated model architecture,combining a networkapplication validation framework with an AI-driven reactive system to enhance security in real-time.The proposedmodel leverages machine learning(ML)and artificial intelligence(AI)to dynamically monitor and respond tosecurity threats,effectively mitigating potential risks before they impact the network infrastructure.This dualapproach not only validates the functionality and performance of network applications before their real deploymentbut also enhances the network’s ability to adapt and respond to threats as they arise.The implementation ofthis model,in the shape of an architecture deployed in two distinct sites,demonstrates its practical viability andeffectiveness.Integrating application validation with proactive threat detection and response,the proposed modeladdresses critical security challenges unique to 5G infrastructures.This paper details the model,architecture’sdesign,implementation,and evaluation of this solution,illustrating its potential to improve network securitymanagement in 5G environments significantly.Our findings highlight the architecture’s capability to ensure boththe operational integrity of network applications and the security of the underlying infrastructure,presenting asignificant advancement in network security.