面向服务移动社交网络中基于信任的分布式服务组合方法

针对服务不透明性、信任需求主观性及移动参与者连接机会性对面向服务移动社交网络中可信服务组合带来的问题,提出基于信任的分布式服务组合方法.该方法基于格模型建立分布式服务信任评估框架,分别在组件和组合级评估服务信任度以避免不可信的数据传输;通过分析服务依赖关系,实现满足全局和局部信任约束可信服务选择;基于蒙特卡洛方法建立可信路径选择、优化和容错算法传输服务评估调用信息.实验结果表明所提方法在服务评估开销低,在路径选择成功率和信任度高,是适应面向服务移动社交网络的服务组合方法.     

基于信任路径搜索的分布式虚拟化环境下可信服务组件选择方法——HA_OTPS

可信服务组件选择是实现分布式虚拟化环境下服务可信性保障的关键.将服务组件选择抽象为多限制优化路径问题后,可以通过搜索信任路径来选择服务组合所需组件,但现有的信任路径搜索算法计算复杂度过高、性能表现差,同时在建立可信服务组件选择模型时缺少从服务组件信任关系和证据传播的角度出发,对可信服务构建与组合过程中服务组件社会关系方面考虑.针对以上不足,本文提出可信质量QoD概念,引入组件亲和度等属性来对分布式虚拟化环境可信服务组件选择模型加以描述与限制,并设计一种基于QoD的启发式优化信任服务路径搜索算法HA_OTPS,选择优化信任服务路径上的服务组件来满足用户可信性需求.实验结果表明,与现有的信任路径搜索算法相比,HA_OTPS算法具有运行时间较短、搜索结果效用值较高等优势.     

基于最长有效功能序列的服务功能链部署算法

服务功能链的服务性能取决于功能的部署位置和数据传输路径的选择。针对资源有限的网络中的服务功能链部署问题,该文设计了一种基于最长有效功能序列(LEFS)的服务功能链部署算法,以功能复用和带宽需求联合优化为目标,在控制路径长度的同时根据LEFS逐步搜索中继节点,直至满足服务请求。仿真结果表明,该算法能够均衡网络资源,同时优化网络的功能部署率和带宽利用率,与其他算法相比,网络资源利用率降低了10%,可以支持更多的服务请求,且算法计算复杂度低,可以实现对服务请求的快速响应。     

分簇拓扑下backpressure算法的延迟性改进研究

Backpressure算法是一种自适用的路由调度算法,它从理论上解决throughput-optimal问题,但是在实际网络部署中,存在节点维护数据队列的数量繁多和数据路由繁长问题,致使数据传输延迟较长。文中就此问题出发,把backpressure算法应用到分簇拓扑上,使用shadow算法实现backpressure算法下的路由调度,采用LIFO策略调度队列,同时又对路径选择了做了优化。仿真结果表明,数据传输的延迟性大大降低。     

探索性数据分析在LoRa通信SNR性能的研究

为了降低数据传输信噪比,提高传输质量,在实际部署过程中需合理配置LoRa物理层参数。为此,基于探索性数据分析,提出一种优化配置参数选择的预测模型。首先,设置物理层参数配置,收集数据;其次,利用探索性数据分析剔除数据中的异常值,并计算各配置参数和信噪比的相关性;最后,通过ID3决策树算法构建预测模型,建立配置参数和SNR之间的关系,以此提高传输信噪比,改善数据传输质量。实验结果表明,预测模型可以有效地对LoRa通信技术中信噪比性能进行优化。     

运用备份服务位置和概率QoS模型的Web服务组合算法

针对工作流服务数的增加过程中最初规划的潜在成本较高以及很多服务组合算法可靠性不足等问题,提出了一种利用备份服务位置和概率服务质量（QoS）模型的服务组合算法。该算法计算服务集群的QoS优化选择,为每个服务包含足够数量的备份服务,且考虑了备份服务位置,以便在单个故障点上进行评估。由于这些备份服务分布均匀,防止了任务失败的发生。对于服务选择问题,采用一种改进的多目标优化（MOO）算法,利用聚类和QoS模型来计算可行解集合。仿真实验采用JMETAL 3.1框架,评估备份服务位置的收益以及算法的可靠性。结果表明,相比于其他MOO算法,提出的算法可靠性更高,从备份服务位置所获得的收益更高。     

基于多策略离散差分进化的移动互联网个性化服务组合

移动互联网技术的普及使人们不再满足于单一功能的服务,而更倾向于按需定制的个性化服务或服务组合.提出了一种应用于Web服务组合的多策略离散差分进化(multi-strategy discrete differential evolution,MDDE)算法.该算法采用随机选择框架,调用具有不同特性的变异策略,是一种搜索能力和收敛速度均衡的离散差分进化算法.实验结果表明,MDDE算法在求解Web服务组合优化问题中比原始DE算法的收敛精度更高,稳定性更好.     

一种新的 QoS 全局最优 Web 服务选择算法

针对运用单目标优化算法求解基于 QoS 的 Web 服务选择问题的不足,设计了一种新的 QoS 全局最优Web 服务选择算法.该算法同时优化组合服务的多维 QoS 属性的多个目标函数,并产生 QoS 全局最优的 Pareto 最优解集.首先建立服务选择问题的多目标优化数学模型,然后采用归档式多目标模拟退火设计该算法以优选 Web服务.实验结果表明了该算法是可行的,实现了全局 QoS 最优化的组合服务.     

基于联合备份的服务功能链可靠性保障的部署方法

在网络功能虚拟化(NFV)环境中,针对服务功能链(SFC)部署时的可靠性问题,该文提出对备份虚拟网络功能选择、备份实例放置和服务功能链部署的联合优化方法。首先,定义一个单位开销可靠性提高值的虚拟网络功能衡量标准,改进备份虚拟网络功能选择方法;其次,采用联合备份的方式调整相邻备份实例之间的放置策略,以降低带宽资源开销;最后,将整个服务功能链可靠性保障的部署问题构建成整数线性规划模型,并提出一种基于最短路径的启发式算法,克服整数线性规划求解的复杂性。仿真结果表明,该方法在优先满足网络服务可靠性需求的同时,优化资源配置,提高了请求接受率。     

基于分布式选择探测算法的服务路由机制

当前网络中间件服务部署方式僵化单一，难以支持未来多样化的网络服务需求.针对此问题，本文从可重构信息通信基础网络中引入元服务的思想，提出一种支持在控制层进行定制编排以及在数据面按需部署的服务路由机制.该机制将服务路径构建问题建模为多约束最优化问题，并针对性设计了分布式选择探测算法，通过对探针的分布式选择处理进行最优服务路径的构建.仿真结果表明，相较于现有算法，本文提出的服务路由机制在付出较小探测开销的情况下，有效提高了路径服务质量以及服务请求成功率.     

Runtime reconfiguration of data services for dealing with out-of-range stream fluctuation in cloud-edge environments

The integration of cloud and IoT edge devices is of significance in reducing the latency of IoT stream data processing by moving services closer to the edge-end. In this connection, a key issue is to determine when and where services should be deployed. Common service deployment strategies used to be static based on the rules defined at the design time. However, dynamically changing IoT environments bring about unexpected situations such as out-of-range stream fluctuation, where the static service deployment solutions are not efficient. In this paper, we propose a dynamic service deployment mechanism based on the prediction of upcoming stream data. To effectively predict upcoming workloads, we combine the online machine learning methods with an online optimization algorithm for service deployment. A simulation-based evaluation demonstrates that, compared with those state-of-the art approaches, the approach proposed in this paper has a lower latency of stream processing.     

Virtual network function deployment strategy based on improved genetic simulated annealing algorithm in MEC

In order to effectively improve the end-to-end service delay of the flow in multi-clusters coexisting mobile edge computing (MEC) network,a virtual network function deployment strategy based on improved genetic simulated annealing algorithm was proposed.The delay of mobile service flow was mathematically modeled through the open Jackson queuing network.After proving the NP attribute of this problem,a solution combining genetic algorithm and simulated annealing algorithm was proposed.In this strategy,the advance mapping mechanism avoids the possibility of network congestion,and the occurrence of local optima was avoided through using the methods of individual judgment and corrective genetic.Extensive simulation was set up to evaluate the effectiveness of the proposed strategy under different parameter settings,such as different volume of requests,different scale of service nodes,different number of MEC clusters,and logical link relationships between virtual network functions.Results show that this strategy can provide lower end-to-end services delay and better service experience for latency-sensitive mobile application.     

Mobility aware edge service migration strategy

To address the problem of load imbalance among edge servers and quality of service degradation caused by dynamic changes of user locations in mobile edge computing networks,a mobility aware edge service migration algorithm was proposed.Firstly,the optimization problem was formulated as a mix integer nonlinear programming problem,with the goal of minimizing the perceived delay of user service request.Then,the delay optimization problem was decoupled into the edge service migration and edge node selection sub-problems based on the Lyapunov optimization approach.Thereafter,the fast edge decision algorithm was proposed to optimize the resource allocation and edge service migration under a given radio access strategy.Finally,the asynchronous optimal response algorithm was proposed to iterate out the optimal radio access strategy.Simulation results validate the proposed algorithm can reduce the perceived delay under the service migration cost constraint while comparing with other existing algorithms.     

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.     

基于云计算的医疗信息系统部署研究

从云计算应用于医疗行业信息化建设优势入手,提出健康云应用部署方案,并通过网络安全、数据安全、运营维护等维度的分析指出业务部署风险和规避策略,且着重介绍业务实现方案和资源配置模型,最后说明了部署效果以及下一步研究的方向。     

EA-DFPSO: An intelligent energy-efficient scheduling algorithm for mobile edge networks

Cloud data centers have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals. Mobile edge computing is emerging as a potential paradigm to host application execution at the edge of networks to reduce transmission delays. Compute nodes are usually distributed in edge environments, enabling crucially efficient task scheduling among those nodes to achieve reduced processing time. Moreover, it is imperative to conserve edge server energy, enhancing their lifetimes. To this end, this paper proposes a novel task scheduling algorithm named Energy-aware Double-fitness Particle Swarm Optimization (EA-DFPSO) that is based on an improved particle swarm optimization algorithm for achieving energy efficiency in an edge computing environment along with minimal task execution time. The proposed EA-DFPSO algorithm applies a dual fitness function to search for an optimal tasks-scheduling scheme for saving edge server energy while maintaining service quality for tasks. Extensive experimentation demonstrates that our proposed EA-DFPSO algorithm outperforms the existing traditional scheduling algorithms to achieve reduced task completion time and conserve energy in an edge computing environment.     

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.     

基于 K-means 的云化分布式 BPEL 引擎放置机制

针对分布式BPEL引擎在云中的放置问题开展研究,提出了一种基于K-means的分布式BPEL引擎放置机制,该机制将BPEL引擎放置问题模型化为相关最优化数学模型,并且将该模型映射到K-means算法进行求解。该机制还讨论了算法在不同网络拓扑随机图、树形网络拓扑的应用。最后利用统计软件R进行了相关实验仿真,仿真结果显示该放置机制可优化服务调用所占用的带宽资源。     

一种基于服务质量的多UAV容量优化方法

随着近些年来通信领域各种技术的高速发展,UAV因为其体积小、灵活性强、可快速部署等优点,越来越受到通信领域相关学者的青睐。同时,由于UAV在各个领域的应用逐渐增多,UAV网络的容量优化问题变得越来越重要。针对未来大规模用户的通信需求,提出了一种基于服务质量的多UAV容量优化方法。首先将服务质量设置为权重参数,联合用户调度、轨迹和功率分配,利用连续凸优化技术和块坐标下降算法,提出多UAV通信系统中的的容量优化算法。仿真结果证明该算法的收敛性,同时表明在相同条件下基于用户质量的多UAV容量算法能够使系统达到更高的平均传输速率。