TRACTOR: Traffic-aware and power-efficient virtual machine placement in edge-cloud data centers using artificial bee colony optimization

Technology providers heavily exploit the usage of edge-cloud data centers (ECDCs) to meet user demand while the ECDCs are large energy consumers. Concerning the decrease of the energy expenditure of ECDCs, task placement is one of the most prominent solutions for effective allocation and consolidation of such tasks onto physical machine (PM). Such allocation must also consider additional optimizations beyond power and must include other objectives, including network-traffic effectiveness. In this study, we present a multi-objective virtual machine (VM) placement scheme (considering VMs as fog tasks) for ECDCs called TRACTOR , which utilizes an artificial bee colony optimization algorithm for power and network-aware assignment of VMs onto PMs. The proposed scheme aims to minimize the network traffic of the interacting VMs and the power dissipation of the data center's switches and PMs. To evaluate the proposed VM placement solution, the Virtual Layer 2 (VL2) and three-tier network topologies are modeled and integrated into the CloudSim toolkit to justify the effectiveness of the proposed solution in mitigating the network traffic and power consumption of the ECDC. Results indicate that our proposed method is able to reduce power energy consumption by 3.5% while decreasing network traffic and power by 15% and 30%, respectively, without affecting other QoS parameters.     

人工蜂群算法研究综述

人工蜂群算法是近年来群智能方向的研究热点.首先介绍了蜂群算法的思想,然后从Markov链角度证明了蜂群算法的收敛性,从算法改进和算法应用两个方面对蜂群算法的研究现状进行了总结,与其他算法进行了优缺点的对比,最后指出了蜂群算法进一步研究的方向.     

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify‐and‐forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end‐to‐end signal‐to‐noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R_s); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.     

基于人工蜂群算法的支持向量机参数优化及应用

为了解决常用的支持向量机(SVM)参数优化方法在寻优过程不同程度的陷入局部最优解的问题,提出一种基于人工蜂群(ABC)算法的SVM参数优化方法。将SVM的惩罚因子和核函数参数作为食物源位置,分类正确率作为适应度,利用ABC算法寻找适应度最高的食物源位置。利用4个标准数据集,将其与遗传(GA)算法、蚁群(ACO)算法、标准粒子群(PSO)算法优化的SVM进行性能比较,结果表明,本文方法能克服局部最优解,获得更高的分类正确率,并在小数目分类问题上有效降低运行时间。将本文方法运用到计算机笔迹鉴别,对提取的笔迹特征进行分类,与GA算法、ACO算法、PSO算法优化的SVM相比,得到了更高的分类正确率。     

基于负荷均衡的WCDMA网络资源优化探讨

随着数据业务的爆发增长,WCDMA网络负荷不断攀升,出现了业务质量变差的现象.通过研究多种控制资源拥塞的优化策略,提出了基于系统内、系统间的负荷均衡思路和方案,并结合各种场景进行了实验验证.结论：提高了系统容量和业务QoS,改善了网络性能和用户感知.     

改进的蜂群算法评定空间直线度误差

建立了直线度误差的最小区域评定模型,提出了一种改进的蜂群算法并将其应用到直线度误差评定中。阐述了基本蜂群算法的原理,给出了评定直线度的目标函数,利用混沌序列的全局遍历性,混沌初始化蜜源位置,以期提高蜂群算法的鲁棒性。比较改进蜂群算法与两种典型群智能算法的实例计算结果,证明该算法评定球度误差时不仅收敛速度快、评价精度高,而且鲁棒性高,适用于形位误差的优化评定。     

Nonlinear blind source separation algorithm based on spline interpolation and artificial bee colony optimization

A post-nonlinear blind source separation algorithm based on spline interpolation fitting and artificial bee colony optimization was proposed for the more complicated nonlinear mixture situations.The separation model was constructed by using the spline interpolation to fit the inverse nonlinear distortion function and using entropy as the separation criterion.The spline interpolation node parameters were solved by the modified artificial bee colony optimization algorithm.The correlation constraint was added into the objective function for limiting the solution space and the outliers wuld be restricted in the separation process.The results of speech sounds separation experiment show that the proposed algorithm can effectively realize the signal separation for the nonlinear mixture.Compared with the traditional separation algorithm based on odd polynomial fitting,the proposed algorithm has higher separation accuracy.     

改进的蚁群算法及其在TSP问题中的应用

针对蚁群算法容易陷入局部最优解的缺点,提出了一种改进的蚁群算法。该算法通过禁忌当前取得的最优路径,有选择地更新信息素,而后重新搜索,有效提高了基本蚁群算法的寻优能力。文中将改进后的蚁群算法应用于TSP问题,通过对典型的Eil51.tsp进行测试,证明了改进后算法的可行性有和效性。     

Handoff optimization and load balancing in wireless LANs using association control

As users move around in wireless local area networks, they associate with different access points in succession to maintain connectivity. Without the carefully designed association control policy, it may lead to frequent handoffs and imbalanced load, which can potentially incur unacceptable delays and poor throughput. While existing works to this issue mainly focus on minimizing the number of handoffs over time, in this paper, we propose a new association control scheme with the goal of reducing the frequency of handoffs and balancing load among access points. The defined problem, handoff optimization and load balancing (HOLB,) is mathematically described as a minimum–maximum programming. Since the HOLB problem is a nondeterministic polynomial‐time hard, two constant approximation algorithms are presented to resolve it. First, we propose an α‐approximation() centralized algorithm CHOLB. CHOLB employs a novel method to simplify the original problem to the minimum‐cost maximum‐flow problem, which is solved in polynomial time. On the sis of CHOLB, we then put forward a β‐approximation () distributed algorithm DHOLB for the purpose of scalability and lightweight. DHOLB partitions the network into clusters and uses CHOLB as its local centralized algorithm within each cluster. Extensive evaluations show that the proposed algorithms outperform the existing schemes in terms of the handoff frequency and traffic load. Copyright © 2013 John Wiley & Sons, Ltd.     

Query optimization mechanisms in the cloud environments: A systematic study

The goal of a query optimizer is to provide an optimal Query Execution Plan (QEP) by comparing alternative query plans. In a distributed database system over cloud environment, the relations required by a query plan may be stored at multiple sites. This leads to an exponential increase in the number of possible equivalent plan alternatives to find an optimal QEP. Although it is not computationally reasonable to explore exhaustively all possible plans in such large search space. Although query optimization mechanisms are important in the cloud environments, to the best of our knowledge, there exists no complete and systematic review on investigating these issues. Therefore, in this paper, four categories to study these mechanisms are considered which are search‐based, machine learning‐based, schema‐based, and security‐based mechanisms. Also, this paper represents the advantages and disadvantages of the selected query optimization techniques and investigates the metrics of their techniques. Finally, the important challenges of these techniques are reviewed to develop more efficient query optimization techniques in the future.     

A novel artificial bee colony detection algorithm for massive MIMO system

As a hot‐spot of 5G, the research on detection algorithms for massive multiple input multiple output (MIMO) system is significant but difficult. The traditional MIMO detection algorithms or their improvements are not appropriate for large scaled antennas. In this paper, we propose artificial bee colony (ABC) detection algorithm for massive MIMO system. As one advanced technology of swarm intelligence, ABC algorithm is most efficient for large scaled constrained numerical combinatorial optimization problem. Therefore, we employ it to search the optimum solution vector in the modulation alphabet with linear detection result as initial. Simulation and data analysis prove the correctness and efficiency. Versus the scale of massive MIMO systems from 64 × 64 to 1024 × 1024 with uncoded four‐quadrature‐amplitude‐modulation signals, the proposed ABC detection algorithm obtains bit error rate of 10 ^− 5 at low average received signal‐to‐noise‐ratio of 12 dB with rapid convergence rate, which approximates the optimum bit error rate performance of the maximum likelihood and achieves the theoretical optimum spectral efficiency with low required average received signal‐to‐noise‐ratio of 10 dB in similar increasing regularity, over finite time of low polynomial computational complexity of per symbol, where N_T denotes the transmitting antennas' number. The proposed ABC detection algorithm is efficient for massive MIMO system. Copyright © 2016 John Wiley & Sons, Ltd.     

A novel ant colony optimization algorithm for PAPR reduction of OFDM signals

The high peak‐to‐average power ratio (PAPR) is the main challenge of orthogonal frequency division multiplexing (OFDM) systems. Partial transmit sequence (PTS) is a useful approach to diminish the PAPR. Although the PTS approach significantly decreases the PAPR, it requires to explore all possible sequences of phase weighting factors. Hence, the computational cost exponentially increases with the number of divided subblocks. This paper proposes a novel PTS technique based on ant colony optimization (ACO) to diminish the high PAPR and computational cost of OFDM systems. By the new representation of phase factors as a graph, the improved ACO algorithm is combined with the PTS method to explore the optimal compound of the phase rotation factors. Simulation results represent that the proposed ACO‐based PTS approach significantly reduces the PAPR and improves the computational cost at the same time. A comparative analysis of the other meta‐heuristics shows that the ACO‐PTS approach outperforms the genetic algorithm, particle swarm optimization, and gray wolf optimization in terms of reducing PAPR.     

基于蚁群优化的高性能拥塞控制路由机制

为了有效地解决偏远地理区域通信网络存在的网络拥塞严重、数据成功传输率低、数据冗余率高以及网络整体性能不佳等问题,通过考虑网络节点运动区域性特点,基于蚁群优化机制,设计出一种新型的容延容断网络 (DTN) 拥塞控制路由优化算法。该算法结合蚁群优化机制中的信息素因子,在同一对源、目的网络节点之间进行多次数据信息传输操作。在数据信息传输方向上,获取各个网络节点的中转跳数平均值,评估各个网络节点的中转价值;参考蚁群优化机制中的启发值因子,将网络节点的中转价值与剩余存储容量相关联,构成网络节点作为中转节点的评定参数,选取评定参数最大的网络节点完成其中转任务。实验表明：该算法有效控制了网络拥塞,提高了数据成功传输率,降低了数据信息冗余率,使网络整体性能得到进一步优化。     

一种基于蚁群优化的分簇路由算法

在无线传感器网络路由协议的研究中,能量高效是其首要设计目标.传统LEACH协议产生簇头数目比较随机,并且簇头直接与基站通信导致能量消耗过快.在分析传统和改进LEACH路由协议的基础上,提出了一种簇头数目固定的簇头选择机制,解决了簇头分布不均匀的问题.并且将蚁群优化算法应用到无线传感器网络的路径选择中,利用蚁群的动态适应性和寻优能力,在簇头与基站之间形成一条最优路径进行通信.在Matlab平台下对新提出的算法进行仿真测试实验,实验结果表明,相对于LEACH路由协议,该算法降低了平均能量消耗,延长了网络的生命周期.     

超密集网中一种基于人工蜂群的节能分簇算法

超密集网络中,密集部署的低功率基站将会加大系统的能耗,并且造成紧缺频谱资源的浪费.探寻干扰协调和系统节能的可行性方法在超密集网络架构下提出基站的休眠—唤醒—活跃机制,减小了休眠基站直接转为活跃状态的开启时间;另外,提出一种基于人工蜂群染色分簇算法,尽可能使用最少的颜色给拓扑图中的小区染色,并对簇内活跃基站进行优化功率分配.经仿真表明,休眠—唤醒—活跃机制能够提升系统的能源效率,染色分簇算法也可以改善用户的频谱效率和吞吐量.     

An efficient clustering and load balancing of distributed cloud data centers using graph theory

The prime focus of the Cloud Service Providers is enhancing the service delivery performance of the distributed cloud data centers. The clustering and load balancing of distributed cloud data centers have significant impact on its service delivery performance. Hence, this paper models distributed cloud data center environment as a network graph and proposes a two‐phase cluster‐based load balancing (CLB) algorithm based on a graph model. The first phase proposes a Cloud Data Center Clustering algorithm to cluster the distributed cloud data centers based on their proximity. The second phase proposes a Client‐Cluster Assignment algorithm to perform uniform distribution of the client requests across the clusters to enable load balancing. To assess the performance, the proposed algorithms are compared with other K‐constrained graph‐based clustering algorithms namely, graph‐based K‐means and K‐spanning tree algorithms on a simulated distributed cloud data center environment. The experimental results reveal that the proposed CLB algorithm outperforms the compared algorithms in terms of the average clustering time, load distribution, and fairness index and hence improves the service delivery performance of the distributed cloud data centers.     

基于信息熵的蚁群聚类DBSCAN改进算法

针对DBSCAN算法对数据分布不均匀和大规模数据处理问题上的不足,提出了一种新的整合算法,算法使用信息熵和蚁群聚类技术对聚类数据集进行代表性子集选择,在子集基础上进行DBSCAN聚类,实验证明这一算法能显著降低I/O耗费和内存需求,有效地解决含有分类属性的高维大规模数据集的聚类问题。     

Resource scheduling in mobile edge computing using improved ant colony algorithm for space information network

With the development of space information network (SIN), new network applications are emerging. Satellites are not only used for storage and transmission but also gradually used for calculation and analysis, so the demand for resources is increasing. But satellite resources are still limited. Mobile edge computing (MEC) is considered an effective technique to reduce the pressure on satellite resources. To solve the problem of task execution delay caused by limited satellite resources, we designed Space Mobile Edge Computing Network (SMECN) architecture. According to this architecture, we propose a resource scheduling method. First, we decompose the user tasks in SMECN, so that the tasks can be assigned to different servers. An improved ant colony resource scheduling algorithm for SMECN is proposed. The heuristic factors and pheromones of the ant colony algorithm are improved through time and resource constraints, and the roulette algorithm is applied to route selection to avoid falling into the local optimum. We propose a dynamic scheduling algorithm to improve the contract network protocol to cope with the dynamic changes of the SIN and dynamically adjust the task execution to improve the service capability of the SIN. The simulation results show that when the number of tasks reaches 200, the algorithm proposed in this paper takes 17.52% less execution time than the Min-Min algorithm, uses 9.58% less resources than the PSO algorithm, and achieves a resource allocation rate of 91.65%. Finally, introducing dynamic scheduling algorithms can effectively reduce task execution time and improve task availability.     

Ant colony optimization based load balancing routing and wavelength assignment for optical satellite networks

An ant colony optimization (ACO) based load balancing routing and wavelength assignment (RWA) algorithm (ALRWA) was put forward for the sake of achieving a fairy load balancing over the entire optical satellite networks. A multi-objective optimization model is established considering the characteristic of global traffic distribution. This not only employs the traffic intensity to modify the light path cost, but also monitors the wavelength utilization of optical inter-satellite links (ISLs). Then an ACO algorithm is utilized to solve this model, leading to finding an optimal light path for every connection request. The optimal light path has the minimum light path cost under satisfying the constraints of wavelength utilization, transmission delay and wavelength-continuity. Simulation results show that ALRWA performs well in blocking probability and realizes efficient load balancing. Meanwhile, the average transmission delay can meet the basic requirement of real-time business transmission.     

融合改进人工蜂群和K均值聚类的图像分割

针对人工蜂群优化的K均值算法易陷入局部最优、搜索精度不够、分割图像不够细致等问题,本文融合自适应人工蜂群和K均值聚类,提出了一种新的图像分割算法。算法首先利用距离最大最小乘积对种群进行初始化;其次采用自适应搜索参数动态调整邻域搜索范围,使人工蜂群算法快速收敛于全局最优;然后将人工蜂群输出的所有蜜源进行K均值聚类,克服K均值聚类结果对初始聚类中心的依赖,再将聚类划分结果进行Powell局部搜索,加快算法收敛的速度,将得到的新聚类中心更新蜂群中蜜源位置。最后,将本文算法与其他两种同类分割算法进行试验对比。实验结果表明:与其他两种算法相比,本文提出的分割算法在保证运行时间的前提下,分割准确率比其他两种算法分别至少提高了3.5%和4.8%,表现出了较高的分割质量。