基于最优路径选择的网络感知服务组合算法

为满足用户的性能需求及服务质量保障,针对复杂网络服务组合的特点和用户个性化的服务质量(Quality of Service, QoS)需求,研究了云环境下的网络感知服务组合问题,利用云服务和网络服务的QoS属性,提出了一种基于最优路径选择(Optimal Path Selection, OPS)的网络感知服务组合算法。该算法可以提升网络服务质量水平,改善用户体验质量。仿真结果表明,该算法在求解时间和质量两个方面都表现出了良好的性能,而且能动态适应用户复杂的需求,能够有效地解决云计算环境下的服务组合问题。     

Discrete particle swarm optimization based multi-objective service path constructing algorithm

Aiming at previous research primarily focused on constructing service paths with a single objective,for exam-ple,latency minimization,cost minimization or load balance,which ignored the overall performance of constructed ser-vice paths,a multi-objective service path constructing algorithm based on discrete particle swarm optimization (MOPSO) was proposed.To promote the convergence rate and improve constructing performance,the criterions for selecting can-didate physical nodes and paths were explored,and a particle position initialization and update strategy (PIFC) was de-signed.Simulation experiments show that the proposed algorithms can improve the overall quality of service paths and increase the success rate and long-term average revenue.     

基于改进灰狼优化算法的服务功能链映射算法

随着工业互联网、车联网、元宇宙等新型互联网应用的兴起,网络的低时延、可靠性、安全性、确定性等方面的需求正面临严峻挑战。采用网络功能虚拟化技术在虚拟网络部署过程中,存在服务功能链映射效率低与部署资源开销大等问题,联合考虑节点激活成本、实例化开销,以最小化平均部署网络成本为优化目标建立了整数线性规划模型,提出基于改进灰狼优化算法的服务功能链映射(improved grey wolf optimization based service function chain mapping,IMGWO-SFCM)算法。该算法在标准灰狼优化算法基础上添加了基于无环K最短路径(K shortest path,KSP)问题算法的映射方案搜索、映射方案编码以及基于反向学习与非线性收敛改进三大策略,较好地平衡了其全局搜索及局部搜索能力,实现服务功能链映射方案的快速确定。仿真结果显示,该算法在保证更高的服务功能链请求接受率下,相较于对比算法降低了11.86%的平均部署网络成本。     

基于SFC的业务路径选择算法

产业界正在推进SFC(service function chain,业务链)技术发展,以实现云网融合的新型业务部署模式.业务路径选择策略是业务链的核心技术,直接影响网络性能与业务体验.针对现有业务路径选择策略存在的单一目标缺陷,创新提出并仿真验证了一种基于时延和负载的最小权重法,优化网络资源分配,提升业务链处理性能,为运营商未来网络和资源部署提供技术参考.     

基于微服务架构的粒度可变服务功能链映射算法

针对5G环境下服务功能链（SFC）端到端时延无法满足时延敏感型应用需求的问题,将传统虚拟网络功能（VNF）拆分成粒度不一的映射单元,提出了基于微服务架构的粒度可变服务功能链映射（VG-SFCM）算法。首先将传统粗粒度的VNF解耦成细粒度的微服务单元,随后通过SFC内冗余微服务单元的合并及SFC间微服务单元的复用,减少微服务单元的实例化,降低SFC的处理时间。仿真结果表明,所提算法在降低平均部署网络成本的同时,其SFC端到端时延相较于传统的映射算法降低了14.81%。     

Performance analysis for the dynamic virtual path bandwidth control method in ATM networks

Broadband ISDN (integrated services digital network) should provide various kinds of communication services for multimedia traffic, including voice, computer data, still picture and motion video, and an ATM (asynchronous transfer mode) technology is expected to satisfy those demands. In ATM networks, a VP (virtual path) concept is introduced for simplifying the network resource management. However, if the bandwidth of each VP is fixed, it cannot absorb traffic load fluctuation. In this case, it is likely to happen that one VP has no remaining bandwidth while other VPs on the same physical link have free capacities. Another extremity is that a VP is not introduced, and that all VCs along the same physical link share the whole bandwidth of the link. This can achieve an efficient use of the link, but it apparently requires complicated call set-up procedures. In this paper, we propose a new dynamic VP bandwidth control method, in which the bandwidth allocated to each VP is dynamically changed according to traffic fluctuation. More specifically, in the case that multiple VPs are multiplexed on the same link between two nodes, when the utilization of some VP is increased, that VP requests an additional bandwidth. When the traffic load becomes low and the utilization of a VP is decreased, a part of the assigned bandwidth is released. We consider two methods for this purpose; one is the basic method in which the bandwidth increase request is issued after the VP bandwidth is exhausted. The other is the look-ahead method where the bandwidth increase is requested in advance before the bandwidth starvation. An approximate analysis for the above methods is provided, and the validation of its accuracy is assessed by comparing with simulation results. Through numerical examples, we show that our methods can provide performance improvement in terms of call loss probabilities of each VP.     

一种基于主-备份节点同步映射的VNF热备份机制

网络功能虚拟化实现了网络功能与专属硬件平台的分离,虚拟网络功能（Virtual Network Function,VNF）通过动态组合形成服务功能链,实现同一硬件平台部署不同的功能服务。针对软件定义网络功能服务可靠性和物理网络资源效率问题,提出了一种基于主备份节点同步映射的VNF节点热备份机制。首先,选择满足节点资源约束的物理节点为主备份节点候选映射对;然后,选择满足带宽约束的最短物理链路为服务路径,实现节点与链路资源总开销的优化。实验结果表明,与传统的备份机制相比,该方法能够满足电信级高可靠性的服务需求,降低了VNF节点备份资源总开销,提高了服务请求的接受率和底层物理网络资源的利用率。     

Construction mechanism for service path over reconfigurable service-centric network

In order to enhance the flexible and intelligent network's service ability,a novel architecture called recon-figurable service-centric network (ReSCNet) was proposed which decomposed traditional network capabilities and ser-vices into fine-grained network functional unit.Then based on service routing matrix algorithm to orchestrate and deploy atomic service flexibly,a service path was built which possess smaller cost,lower time delay,higher degree of load bal-ance and higher reliability.Finally,the performance of service routing matrix algorithm was evaluated on the innovation experiment platform NetFPGA-10G.The simulation results show that the algorithm has a better performance and can cus-tomize an optimal service path for users while meet the specific functions and performance constraints.     

基于DP I的智能网关业务Qo S保障和带宽提速研究

文章提出了基于DPI(深度包检测)的智能网关业务 QoS(服务质量)保障和带宽提速方案。阐述了智能网关上的DPI现状,通过智能网关上的DPI识别出用户高优先级业务,采取绝对优先级策略,实现 QoS保障;通过 DPI 的带宽检测机制,及时发现用户带宽瓶颈,配合智能网关的门户推送功能以及电信运营商平台,实现实时带宽提速。通过进行用户高优先级业务保障和实时带宽提速,来提升电信用户体验视角。     

网络功能虚拟化中的性能感知服务组合优化

服务功能链是网络功能虚拟化的重要支撑,为了构建满足功能和性能需求的服务功能链,需要建立服务的性能模型,从而产生基于性能的服务组合优化问题。一种基于性能模型的服务组合优化问题被建模,并针对复杂约束情况下的无效解干扰,提出了改进的模拟退火算法,该算法包含基于层次属性的产生函数和基于偏离度的目标函数。仿真结果表明,该算法提高了21%的服务组合成功率,同时降低了组合成本和时间消耗。仿真结果验证了所提算法的有效性。     

Service function chain construct algorithm based on reliability

With the continuous expansion of network size and content quantity,network operators often face the problem of data transmission interruption,thus how to improve the reliability of data transmission has become a research hotspot.Started with the huge advantages of NFV environment over traditional TCP/IP architecture based on the background that every network node has the capability of security service,a reliability algorithm for constructing functional service chains was proposed.First,the network topology was introduced and abstracted it into a digraph for a better analyzation.Then,several quantitative indices were used to define the upper and lower bounds of failure probability and resolved the model through a heuristic algorithm.The experimental results show that the proposed algorithm increases the reliability of service chain selection and spends less time.     

Optimal sensor and path selection for target tracking in wireless sensor networks

This paper addresses target tracking in wireless sensor networks where the nonlinear observed system is assumed to progress according to a probabilistic state space model. Thus, we propose to improve the use of the quantized variational filtering by jointly selecting the optimal candidate sensor that participates in target localization and its best communication path to the cluster head. In the current work, firstly, we select the optimal sensor in order to provide the required data of the target and to balance the energy dissipation in the wireless sensor networks. This selection is also based on the local cluster node density and their transmission power. Secondly, we select the best communication path that achieves the highest signal‐to‐noise ratio at the cluster head; then, we estimate the target position using quantized variational filtering algorithm. The best communication path is designed to reduce the communication cost, which leads to a significant reduction of energy consumption and an accurate target tracking. The optimal sensor selection is based on mutual information maximization under energy constraints, which is computed by using the target position predictive distribution provided by the quantized variational filtering algorithm. The simulation results show that the proposed method outperforms the quantized variational filtering under sensing range constraint, binary variational filtering, and the centralized quantized particle filtering. Copyright © 2012 John Wiley & Sons, Ltd.     

Cross-domain service chain mapping mechanism based on Q-learning

A virtual service resources controlling architecture with regional centralized management and global coordinated scheduling was proposed for the problem of cross-domain service chain mapping in SDNFV environment. On this basis, an effective mapping framework was built and the cross-domain mapping problem was modeled as an ILP with the purpose of minimizing mapping cost. A partitioning algorithm was designed to solve the problem based on Q-learning mechanism under this framework. Simulation results show that the performances of this method are better than other traditional methods on average partition time, average mapping cost, and acceptance ratioof service chain mapping request.     

一种基于SDN的移动自组织网络服务路径重建算法

针对基于SDN的移动自组织网络链路故障时的服务路径重建问题,提出一种服务路径分级重建方法,通过备份重建和计算重建相结合的过程提高了服务路径重建的时效性;同时,考虑服务路径重建可能引发的路径冲突问题,从图论的基本原理出发,给出了完备的判定重建定理,在快速重建的基础上亦保证重建服务路径的有效性。     

A traffic balance scheme of group emotion recognition by using the service function chain

Most researches of emotion recognition focus on single person information. However, everyone's emotions will affect each other. For example, when the teacher is angry, the student's nervousness will increase. But the facial expression information of the light single is already quite large. It means that group emotion recognition will encounter a huge traffic bottleneck. Therefore, there is a vast amount of data collected by end‐devices that will be uploaded to the emotion cloud for big data analysis. Because different emotions may require different analytical methods, in the face of diverse big data, connecting different emotion clouds is a viable alternative method to extend the emotion cloud hardware. In this paper, we built a software defined networking (SDN) multi‐emotion cloud platform to connect different emotion clouds. Through the advantages of the splicing control plane and the data plane, the routing path can be changed using software. This means that the individual conditions of different students can be handled by a dedicated system via service function (SF). The load balancing effect between different emotion clouds is achieved by optimizing the SFC. In addition, we propose a SFC‐based dynamic load balancing mechanism which eliminates a large number of SFC creation processes. The simulation results show that the proposed mechanism can effectively allocate resources to different emotion clouds to achieve real‐time emotion recognition. This is the first strategy to use SFC to balance the emotion data that the teachers can change teaching policy in a timely manner in response to students' emotions.     

Joint relay station deployment and frequency reuse scheme for two-hop cellular networks

To fully exploit the performance benefits of relay station (RS),in the two-hop cellular networks covering hotspots,when the number of RSs is predetermined,both RS deployment and frequency reuse scheme ...     

Service function chain embedding algorithm with wireless multicast in mobile edge computing network

To resolve the excessive system overhead and serious traffic congestion in user-oriented service function chain (SFC) embedding in mobile edge computing (MEC) networks,a content-oriented joint wireless multicast and SFC embedding algorithm was proposed for the multi-base station and multi-user edge networks with MEC servers.By involving four kinds of system overhead,including service flow,server function sustaining power,server function service power and wireless transmission power,an optimization model was proposed to jointly design SFC embedding with multicast beamforming.Firstly,with Lagrangian dual decomposition,the problem was decoupled into two independent subproblems,namely,SFC embedding and multicast beamforming.Secondly,with the L_p norm penalty term-based successive convex approximation algorithm,the integer programming-based SFC embedding problem was relaxed to an equivalent linear programming one.Finally,the non-convex beamforming optimization problem was transformed into a series of convex ones via the path following technique.Simulation results revealed that the proposed algorithm has good convergence,and is superior to both the optimal SFC embedding with unicasting and random SFC embedding with multicasting in terms of system overhead.     

基于模型检测的服务链信息流安全可组合验证方法

提出了一种可组合的服务链信息流安全验证方法。在保证单一组件信息流安全的基础上,给出相邻组件可组合的信息流安全条件和验证算法。实验和仿真结果表明,相比传统模型检测方法,所提的可组合验证算法能够有效减小验证开销,提高验证效率。     

蓝牙网络接入点频繁路径选择切换算法

蓝牙网络接入点切换问题的研究对于解决蓝牙移动性有很重要的现实意义。提出了一种频繁路径选择算法,接入点实时检测同移动点间链路,根据接收功率强度和前一段时间从当前位置切换到相邻接点的概率,确定最佳侯选接入点集,当从当前接入点AP接收到的功率下降到1个阈值时,移动主机MH开始切换。这种算法能够减少不必要的切换,降低链路负荷,而且切换时间较短。     

Service function chain deployment algorithm based on optimal weighted graph matching

Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.