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.

Aperiodic Checkpoint Placement Algorithms—Survey and Comparison

In this article we summarize some aperiodic checkpoint placement algorithms for a software system over infinite and finite operation time horizons, and compare them in terms of computational accuracy. The underlying problem is formulated as the maximization of steady-state system availability and is to determine the optimal aperiodic checkpoint sequence. We present two exact computation algorithms in both forward and backward manners and two approximate ones;constant hazard approximation and fluid approximation, toward this end. In numerical examples with Weibull system failure time distribution, it is shown that the combined algorithm with the fluid approximation can calculate effectively the exact solutions on the optimal aperiodic checkpoint sequence.

Repulsive firefly algorithm-based optimal switching device placement in power distribution systems

To achieve optimal configuration of switching devices in a power distribution system,this paper proposes a repulsive firefly algorithm-based optimal switching device placement method.In this method,the influence of territorial repulsion during firefly courtship is considered.The algorithm is practically applied to optimize the position and quantity of switching devices,while avoiding its convergence to the local optimal solution.The experimental simulation results have showed that the proposed repulsive firefly algorithm is feasible and effective,with satisfying global search capability and convergence speed,holding potential applications in setting value calculation of relay protection and distribution network automation control.

A NOVEL 2-D GENETIC ALGORITHM FOR STANDARD PE PLACEMENT IN OPTOELECTRONIC MCM

In order for optical interconnection technologies to be incorporated into the next generation parallel computers, new optoelectronic computer aided design, integration, and packaging technologies must be investigated. One of the key issues in designing is the system volume, which is determined by maximum interconnection distance(MID) between PEs. A novel 2 D genetic algorithm was presented in this paper at the first time, and used to solve the placement of twin butterfly multistage networks based on transmissive physical model. The experiment result shows that this algorithm case works better than other algorithm cases.

A Data-Placement Strategy Based on Genetic Algorithm in Cloud Computing

With the development of Computerized Business Application, the amount of data is increasing exponentially. Cloud computing provides high performance computing resources and mass storage resources for massive data processing. In distributed cloud computing systems, data intensive computing can lead to data scheduling between data centers. Reasonable data placement can reduce data scheduling between the data centers effectively, and improve the data acquisition efficiency of users. In this paper, the mathematical model of data scheduling between data centers is built. By means of the global optimization ability of the genetic algorithm, generational evolution produces better approximate solution, and gets the best approximation of the data placement at last. The experimental results show that genetic algorithm can effectively work out the approximate optimal data placement, and minimize data scheduling between data centers.

Algorithms for the Optimization of Well Placements—A Comparative Study

The Artificial Bee Colony (ABC) is one of the numerous stochastic algorithms for optimization that has been written for solving constrained and unconstrained optimization problems. This novel optimization algorithm is very efficient and as promising as it is;it can be favourably compared to other optimization algorithms and in some cases, it has been proven to be better than some known algorithms (like Particle Swarm Optimization (PSO)), especially when used in Well placement optimization problems that can be encountered in the Petroleum industry. In this paper, the ABC algorithm has been modified to improve its speed and convergence in finding the optimum solution to a well placement optimization problem. The effects of variations of the control parameters for both algorithms were studied, as well as the algorithms’ performances in the cases studied. The modified ABC (MABC) algorithm gave better results than the Artificial Bee Colony algorithm. It was noticed that the performance of the ABC algorithm increased with increase in the number of its optimization agents for both algorithms studied. The modified ABC algorithm overcame the challenge posed by the use of uniformly generated random numbers with very rough NPV surface. This new modified ABC algorithm proposed in this work will be a great tool in optimization for the Petroleum industry as it involves Well placements for optimum oil production.

A Computational Comparison between Optimization Techniques for Wells Placement Problem: Mathematical Formulations, Genetic Algorithms and Very Fast Simulated Annealing

This study considers several computational techniques for solving one formulation of the wells placement problem (WPP). Usually the wells placement problem is tackled through the combined efforts of many teams using conventional approaches, which include gathering seismic data, conducting real-time surveys, and performing production interpretations in order to define the sweet spots. This work considers one formulation of the wells placement problem in heterogeneous reservoirs with constraints on inter-well spacing. The performance of three different types of algorithms for optimizing the well placement problem is compared. These three techniques are: genetic algorithm, simulated annealing, and mixed integer programming (IP). Example case studies show that integer programming is the best approach in terms of reaching the global optimum. However, in many cases, the other approaches can often reach a close to optimal solution with much more computational efficiency.

Large Scale VLSI Module Placement Using LFF Heuristics by Stages

We present a deterministic algorithm for large-scale VLSI module placement. Following the less flexibility first （LFF） principle,we simulate a manual packing process in which the concept of placement by stages is introduced to reduce the overall evaluation complexity. The complexity of the proposed algorithm is （N1 ＋ N2 ） × O（ n^2 ） ＋ N3× O（n^4lgn） ,where N1, N2 ,and N3 denote the number of modules in each stage, N1 ＋ N2 ＋ N3 = n, and N3〈〈 n. This complexity is much less than the original time complexity of O（n^5lgn）. Experimental results indicate that this approach is quite promising.

Adaptive Controller Placement in Software Defined Wireless Networks

Controller placement problem(CPP)is a critical issue in software defined wireless networks(SDWN).Due to the limited power of wireless devices,CPP is facing the challenge of energy efficiency in SDWN.Nevertheless,the related research on CPP in SDWN hasn’t modeled the energy consumption of controllers so far.To prolong the lifetime of SDWN and improve the practicability of research,we rebuilt a CPP model considering the minimal transmitted power of controllers.An adaptive controller placement algorithm(ACPA)is proposed with the following two stages.First,data field method is adopted to determine sub-networks for different network topologies.Second,for each sub-network we adopt an exhaustive method to find the optimal location which meets the minimal average transmitted power to place controller.Compared with the other algorithms,the effectiveness and efficiency of the proposed scheme are validated through simulation.

A global harmony search algorithm for finding optimal capacitor location and size in distribution networks

Shunt capacitors are broadly applied in distribution systems to scale down power losses, improve voltage profile and boost system capacity. The amount of capacitors added and location of deployment in the system highly determine the advantage of compensation. A novel global harmony search(GHS) algorithm in parallel with the backward/ forward sweep power flow technique and radial harmonic power flow was used to investigate the optimal placement and sizing of capacitors in radial distribution networks for minimizing power loss and total cost by taking account load unbalancing, mutual coupling and harmonics. The optimal capacitor placement outcomes show that the GHS algorithm can reduce total power losses up to 60 k W and leads to more than 18% of cost saving. The results also demonstrate that the GHS algorithm is more effective in minimization of power loss and total costs compared with genetic algorithm(GA), particle swarm optimization(PSO) and harmony search(HS) algorithm. Moreover, the proposed algorithm converges within 800 iterations and is faster in terms of computational time and gives better performance in finding optimal capacitor location and size compared with other optimization techniques.

Graph Partitioning Method to Determine Servers Placement in CDN

To determine CDN cache servers'placement reasonably,an idea that using graph partitioning to solve the problem was put forward through theoretical analysis and the specific algorithm of partitioning was researched. The concept of graph partitioning for CDN was defined. The conditions of graph partitioning for CDN were demonstrated: the sum of the weights of the nodes in each subarea is as close as possible; edge cut between the subareas is as large as possible; internal nodes in each subarea are connected as far as possible. By reference to light vertex matching algorithm of graph partitioning for network simulation,a multilevel k-way algorithm of graph partitioning for CDN was proposed. The maximized edge cut k-way KL refinement algorithm was discussed. Graph partitioning is a feasible way to solve the problem of CDN servers'placement. Multilevel k-way algorithm is a feasible algorithm for CDN graph partitioning.

A Comparison between Evolutionary Metaheuristics and Mathematical Optimization to Solve the Wells Placement Problem

The Wells Placement Problem (WPP) consists in choosing well locations within an oil reservoir grid to maximize the reservoir total oil production, subject to distance threshold between wells and number of wells cap constraints. A popular approach to WPP is Genetic Algorithms (GA). Alternatively, WPP has been approached in the literature through Mathematical Optimization. Here, we conduct a computational study of both methods and compare their solutions and performance. Our results indicate that, while GA can provide near-optimal solutions to instances of WPP, typically Mathematical Optimization provides better solutions within less computational time.

Sensor Placement for Sensing Coverage and Data Precision in Wireless Sensor Networks

We present a novel paradigm of sensor placement concerning data precision and estimation.Multiple abstract sensors are used to measure a quantity of a moving target in the scenario of a wireless sensor network.These sensors can cooperate with each other to obtain a precise estimate of the quantity in a real-time manner.We consider a problem on planning a minimum-cost scheme of sensor placement with desired data precision and resource consumption.Measured data is modeled as a Gaussian random variable with a changeable variance.A gird model is used to approximate the problem.We solve the problem with a heuristic algorithm using branch-and-bound method and tabu search.Our experiments demonstrate that the algorithm is correct in a certain tolerance,and it is also efficient and scalable.

Real-coded genetic algorithm for optimal vibration controlof flexible structure

Presents the study on the optimum location of actuators/sensors for active vibration control in aerospace flexible structures with the performance function first built by maximization of dissipation energy due to control action and a real coded genetic algorithm then proposed to produce a global optimum solution, and proves the feasibility and advantages of this algorithm with the example of a standard test function and a two collocated actuators/sensors cantilever, and comparing the results with those given in the literatures.

A New Method for Optimal Placement of <i>TCSC</i>Based on Sensitivity Analysis for Congestion Management

In this paper a new method has been proposed to determine optimal location and best setting of Thyristor Controlled Series Compensator (TCSC). Seeking the best place is performed using the sensitivity analysis and optimum setting of TCSC is managed using the genetic algorithm. The configuration of a typical TCSC from a steady-state perspective is the fixed capacitor with a thyristor controlled reactor (TCR). The effect of TCSC on the network can be modeled as a controllable reactance inserted in the related transmission line. This paper employs the DIgSILENT simulator and the DPL as a programming tool of the DIgSILENT to show the validity of the proposed method. The effectiveness of sug-gested approach has been tested on IEEE 14-bus system.

智能反射面室内部署的位置规划方法

智能反射面(IRS/RIS)应用于实际无线通信系统时,如何优选布放位置及面板取向,是提升技术实效所面临的主要问题之一。RIS布放的数学规划问题,不仅有优化目标的设计,还要考虑通信环境的建筑物分布和可选部署面的有效散射截面。相比于室外较为开放的空间,RIS的室内部署存在更多限制性条件。针对室内既有墙面的RIS布放,该文设计了多终端接入选址规划模型和等价问题。为约化其非线性计算,通过单终端退化分析,给出目标函数的卡西尼卵形线分布特征,证明RIS布放范围限于各终端及基站在部署面投影的重叠区,提出基于对半搜索法的高效启发式算法。数值仿真了2种复杂室内结构的多终端接入场景,结果表明所提算法不仅有显著加速效益,还可扩展用于多RIS网络规划。

基于改进遗传算法的大型体育场馆传感器优化布置研究

为高效、准确地对大型体育场馆结构进行健康监测,根据其结构特点,提出了一种基于多种群非支配重组遗传算法(MP-RGA)的传感器优化布置方法。引入二重编码解决离散优化问题,通过多种群策略提高算法的搜索能力,通过非支配重组解决以往遗传算法优化后期的多样性丧失问题,最后采用自适应化交叉、变异策略改善算法前期的收敛速度和后期的寻优能力。以西安国际足球中心屋盖为例,通过数值算例验证不同传感器布置数量下利用该算法确定传感器布置方案时的有效性。结果表明:与量子遗传算法(QGA)和粒子群算法(PSO)相比,多种群非支配重组遗传算法收敛速度更快,以模态置信度准则为目标的优化效果分别提升了41.88%和91.27%;依据所提算法优化得到的传感器布置方案实际应用效果良好,表明该算法适用于大型体育场馆的传感器优化布置问题。

双目标优化与生成对抗网络结合的框架结构阻尼器布置方案智能设计方法

为实现框架结构的阻尼器智能化布置,结合减震设计原理和智能算法,采用双目标优化算法和生成对抗网络算法分别进行阻尼器竖向和水平智能布置研究,并将该方法应用到两个框架结构减震设计工程案例中。在框架结构减震设计中,采用双目标优化算法进行阻尼器竖向布置,并与逐层逼近法、工程师设计和非减震设计进行对比,结果表明,采用该优化算法得到的阻尼器竖向布置方案能有效降低层间位移角和楼层加速度,提高结构的抗震性能。在确定各楼层的阻尼器数量后,利用训练好的生成对抗网络生成模型,可快速、自动地选择和确定各楼层阻尼器的平面安装位置,生成的平面布置与工程师设计的平面布置在相似性差异度综合评价指标上小于临界值0.1,说明两者相似度较高,且有利于提高原结构的抗扭能力。将双目标优化算法与生成对抗网络相结合,不仅能满足框架结构的减震性能目标,而且可实现阻尼器布置方案的智能设计,提升减震工程设计效率。

Distributed Middlebox Placement Based on Potential Game

In this paper, we analyse the deployment of middlebox. For a given network information and policy requirements, an attempt is made to determine the optimal location of middlebox to achieve the best performance. In terms of the end-to-end delay as a performance optimization index, a distributed middlebox placement algorithm based on potential game is proposed. Through extensive simulations, it demonstrates that the proposed algorithm achieves the near-optimal solution, and the end-to-end delay decreases significantly.

一种联合边缘服务器部署与服务放置的方法

边缘计算(EC)在靠近用户的网络边缘部署边缘服务器(ES),并将服务放置在ES上,从而可以满足用户的服务需求。独立研究ES部署和服务放置问题的成果已有很多,但两者存在高度耦合关系。考虑到EC系统的收益,有必要提供付费服务,使得EC系统处理用户服务请求时会获得相应收入。同时,EC系统处理用户服务请求时会产生时延和能耗成本,为了最大化EC系统的收益,在用户服务请求和服务价格不同的约束下,需要合适的服务放置方案来提高EC系统的收益。为此,在ES与基站之间的位置关系、ES部署和服务放置之间的耦合关系、服务副本数和服务价格等约束下,提出一种包括改进的k-means算法和多智能体强化学习算法的两步方法,使EC系统的收益最大化。首先,构建一个联合ES部署和服务放置模型,其中ES部署明确考虑了基站之间的位置关系,服务放置明确考虑了ES部署的位置,以及不同的服务请求和价格;然后,基于基站的位置关系和基站的服务请求负载,通过带约束的k-means算法,在不同约束条件下分别确定最佳的ES部署位置以及ES的协作域;最后,以最大化EC系统收益为目标,通过多智能体强化学习算法在ES上放置服务。实验结果表明,与对比方法相比,所提方法能够提高收益7%~23%。