A survey on software defined networking and its applications

Software defined networking (SDN) achieves network routing management with logically centralized control software that decouples the network data plane from the control plane. This new design paradigm greatly emancipates network innovation. This paper introduces the background of SDN technology with its design principles, explains its differentiation, and summarizes the research efforts on SDN network architecture, components and applications. Based on the observation of current SDN development, this paper analyzes the potential driving forces of SDN deployment and its future trend.     

基于软件定义网络的数据中心自适应多路径负载均衡算法

针对传统多路径负载均衡算法无法有效地感知网络的运行状态、不能综合考虑链路的实时传输状态以及大多数算法缺少自适应性的问题,基于软件定义网络(SDN)的集中控制和全网管控思想,提出一种基于蜘蛛猴优化的SDN自适应多路径负载均衡算法(SMO-LBA).首先,利用数据中心网络的感知能力来获取多路径的实时链路状态信息;然后,利用...     

Hints to improve automatic load balancing with LeWI for hybrid applications

The DLB (Dynamic Load Balancing) library and LeWI (LEnd When Idle) algorithm provide a runtime solution to deal with the load imbalance of parallel applications independently of the source of imbalance. DLB relies on the usage of hybrid programming models and exploits the malleability of the second level of parallelism to redistribute computation power across processes.     

一种软件定义网络中基于博弈的混合路由算法*

现存软件定义网络中的流量工程算法考虑单一,难以实现流量均衡,且缺乏对端到端的时延优化。对此提出一种博弈混合路由算法,以少量的显式路由与基于目的的聚合流量配置,在保证流量均衡的同时,优化网络的平均端对端时延。聚合流量配置采用纳什议价博弈理论对流量均衡与端对端时延优化场景进行联合优化建模,并设计了相应的启发式算法进行求解。实验结果表明,与现有算法相比,流量均衡程度和平均端对端时延均得到一定程度的改善,在Splintlink拓扑中,最大链路利用率平均减少6%,平均端对端时延减少12%。     

Distributed algorithms for QoS load balancing

We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decreases with the number of users that allocate the resource. In our dynamic, concurrent model, users may reallocate resources in a round-based fashion. As opposed to various settings analyzed in the literature, we assume that users have quality of service demands. A user has zero utility when falling short of a certain minimum performance threshold and having positive utility otherwise. Whereas various load-balancing protocols have been proposed for the setting without quality of service requirements, we consider protocols that satisfy an additional locality constraint: The behavior of a user depends merely on the state of the resource it currently allocates. This property is particularly useful in scenarios where the state of other resources is not readily accessible. For instance, if resources represent channels in a mobile network, then accessing channel information may require time-intensive measurements. We consider several variants of the model, where the quality of service demands may depend on the user, the resource, or both. For all cases we present protocols for which the dynamics converge to a state in which all users are satisfied. More importantly, the time to reach such a state scales nicely. It is only logarithmic in the number of users, which makes our protocols applicable in large-scale systems.     

LTE网络中具备QoS保障的动态负载均衡算法

研究了3GPPLTE网络中考虑不同服务质量(quality-of-service,QoS)要求的动态负载均衡算法.小区间的负载不均衡对于不同QoS要求用户有不同负面影响.对于有保障速率要求的用户,负载不均衡会导致较高的新呼叫阻塞率;而对于那些没有速率要求的用户,负载不均衡会导致繁忙小区中边缘用户过于恶化的吞吐量.全网中这两类用户的负载均衡问题紧密耦合,难以用一个统一的目标函数来分析研究.因此提出一个相应的多目标优化问题,其目标函数分别是针对全网内有QoS要求用户的负载均衡指示函数和针对全网内没有QoS要求用户的总效用函数,限制条件为实际小区物理资源和用户QoS要求.对该问题的复杂度进行了分析后,提出了一个实时的低复杂度低开销的分布式负载均衡算法结构,包括QoS保障的混合调度,QoS感知的负载均衡切换和呼叫准入控制.最后,系统级仿真结果显示提出的全新的负载均衡算法结构达到了较好的负载均衡效果,可以显著降低有QoS要求用户的新呼叫阻塞率,同时以略微损失全网无QoS要求用户总吞吐量的代价大幅提升繁忙小区中边缘用户的实际吞吐量.     

负载均衡算法在智慧矿山软件平台中的应用

针对现有负载均衡算法在处理智慧矿山系统数据时存在处理速度慢、无法合理利用现有资源完成任务调度等问题,提出一种基于布谷鸟搜索的加权最小连接数(CS-WLC)算法,并将其应用于智慧矿山软件平台解决负载均衡问题。该算法综合考虑后端服务器处理速率、内存容量、磁盘IO速率、网络吞吐量、进程数指标,通过对指标赋予权值计算各后端服务器利用率;根据计算结果,采用布谷鸟搜索算法对后端服务器进行全局寻优,得到一组较优解;考虑连接数及使用频率对后端服务器赋予权值,采用加权最小连接数(WLC)算法在较优解中选取负载较轻的后端服务器处理实时数据存取和用户访问请求。采用分布式融合性监控系统软件平台进行负载均衡测试,结果表明在数据量不断增多的情况下,与WLC算法相比,CS-WLC算法应答时延小、响应连接数多,从而验证了CS-WLC算法具有更好的负载均衡效果。     

遗传算法在蜜网动态负载均衡中的应用

针对蜜网动态负载均衡过程中产生的额外通信开销问题,首先分析了蜜网动态负载均衡的特点,建立了基于最小通信开销的动态负载均衡数学模型;然后设计和实现了一种利用遗传算法解决该问题的新方法。实验测试表明,与贪心算法相比,遗传算法可获得更小通信开销的负载分配方案,能进一步减少蜜网动态负载均衡中负载迁移次数,降低额外通信开销。     

A load index and load balancing algorithm for heterogeneous clusters

This paper presents a load balancing algorithm specifically designed for heterogeneous clusters, composed of nodes with different computational capabilities. The method is based on a new index, which takes into consideration two levels of processors heterogeneity: the number of cores per node and the computational power of each core. The experimental results show that this index allows achieving balanced workload distributions even on those clusters where heterogeneity can not be neglected.     

软件定义网络中利用IMKVS结合NFV的分布式网络负载均衡策略

社交网络和其他云应用程序应该能对从数据中心发出的请求作出快速响应,实现这种请求的技术之一是内存中的键值存储（IMKVS）,它是一种缓存机制,目的是为了提高整体用户体验。一般地,IMKVS系统使用一致性哈希来决定在哪存储目标,一致性哈希使用起来方法简单,但可能引起网络负载的不平衡。为了提高IMKVS的缓存性能,提出一种软件定义网络中利用IMKVS结合NFV的分布式网络负载均衡策略。该策略包含两个阶段,第一阶段设计通用的SDN负载平衡器的模块,以运行不同的负载平衡算法;第二阶段是基于IMKVS的专业化缓存,可以实现通信管理和数据复制。仿真结果表明,相比于一致性哈希,缓存服务器上的负载可改善24%,网络上的负载可改善7%,策略能够使资源利用更合理,获得更好的用户体验。     

Advanced networking services for distributed multimedia streaming applications

Increased network speeds coupled with new services delivered via the Internet have increased the demand for intelligence and flexibility in network systems. This paper argues that both can be provided by new hardware platforms comprised of heterogeneous multi-core systems with specialized communication support. We present and evaluate an experimental network service platform that uses an emergent class of devices—network processors—as its communication support, coupled via a dedicated interconnect to a host processor acting as a computational core. A software infrastructure spanning both enables the dynamic creation of application-specific services on the network processor, mediated by middleware and controlled by kernel-level communication support. Experimental evaluations use a Pentium IV-based computational core coupled with an IXP 2400 network processor. The sample application services run on both include an image manipulation application and application-level multicasting.

A hierarchical adaptive distributed algorithm for load balancing

Load balancing/sharing exploits the communication facility between the servers of a distributed system, by using the exchanging of status information and jobs between any two servers of the system in order to improve the overall performance.We propose an adaptive distributed hierarchical scheme, the Virtual Tree Algorithm (VTA), which creates a virtual binary tree structure over the actual network topology. It uses the difference-initiated (DI) technique for load balancing, which needs remote information for the transfer policy and no additional information for the location policy. We demonstrate that the introduced virtual construction keeps the exchanged messages to relatively low levels. To evaluate the performance of our policy, we present both theoretical and simulation results. By using simulation, we compare our results with one of the most representative, adaptive, symmetrical and efficient algorithms, the Variable Threshold (V_THR) algorithm.     

A load balancing framework for adaptive and asynchronous applications

We describe the design of a flexible load balancing framework and runtime software system for supporting the development of adaptive applications on distributed-memory parallel computers. The runtime system supports a global namespace, transparent object migration, automatic message forwarding and routing, and automatic load balancing. These features can be used at the discretion of the application developer in order to simplify program development and to eliminate complex bookkeeping associated with mobile data objects. An evaluation of this system in the context of a three-dimensional tetrahedral advancing front parallel mesh generator shows that overall runtime improvements of 15 percent compared to common stop-and-repartition load balancing methods, 30 percent compared to explicit intrusive load balancing methods, and 42 percent compared to no load balancing are possible on large processor configurations. At the same time, the overheads attributable to the runtime system are a fraction of 1 percent of the total runtime. The parallel advancing front method is a coarse-grained and highly adaptive application and therefore exercises all of the features of the runtime system.     

A simple yet effective load balancing extension to the PVM software system

In this paper, a load balancing extension for the PVM software system is described. This extension includes slave processes, for obtaining host CPU load information, and a master process for gathering the load information. A programming interface is included to provide the PVM user with CPU load information and a load balancing process spawn. For tested applications, the load balancing extension exhibits considerable improvement in parallel runtime performance. Results presented include parallel runtime comparisons for basic matrix oriented algorithms, a parallel fractal image compression algorithm, and selected NAS parallel benchmarks.     

基于改进遗传算法的SDN多控制器负载均衡机制研究

为解决软件定义网络中多控制器负载失衡问题,提出了一种基于非合作博弈降载的主控制器重选模型。首先,利用动态阈值来判别过载控制器;其次,采用基于优先权的迁移交换机决策机制;最后,构建以控制器集群的负载均衡度、平均总时延和交换机迁移成本作为效用函数的优化模型,采用改进的遗传算法求解,加入相似算子提高寻求全局最优解的速度及准确度。实验结果表明,该机制有效地均衡了控制平面的负载并优化了网络性能。     

SoftAir: A software defined networking architecture for 5G wireless systems

One of the main building blocks and major challenges for 5G cellular systems is the design of flexible network architectures which can be realized by the software defined networking paradigm. Existing commercial cellular systems rely on closed and inflexible hardware-based architectures both at the radio frontend and in the core network. These problems significantly delay the adoption and deployment of new standards, impose significant challenges in implementing and innovation of new techniques to maximize the network capacity and accordingly the coverage, and prevent provisioning of truly- differentiated services which are able to adapt to growing and uneven and highly variable traffic patterns. In this paper, a new software-defined architecture, called SoftAir, for next generation (5G) wireless systems, is introduced. Specifically, the novel ideas of network function cloudification and network virtualization are exploited to provide a scalable, flexible and resilient network architecture. Moreover, the essential enabling technologies to support and manage the proposed architecture are discussed in details, including fine-grained base station decomposition, seamless incorporation of Openflow, mobility- aware control traffic balancing, resource-efficient network virtualization, and distributed and collaborative traffic classification. Furthermore, the major benefits of SoftAir architecture with its enabling technologies are showcased by introducing software- defined traffic engineering solutions. The challenging issues for realizing SoftAir are also discussed in details.     

一种动态的入侵检测系统负载均衡算法

目前的入侵检测不仅需要模式匹配,而且需要协议异常检测,提出了一种新动态的负载均衡算法,采用两层结构,对网络流量按照服务类型进行初步划分之后分别对每部分流量进行二次分配,并对每种类型的流量进行相应的协议异常检测。该算法能在不牺牲系统性能的前提下有效提高网络入侵检测系统的检测效率,降低误检率,并可有效地适应网络流量的变化,降低漏检率。     

Ant-based routing for wireless multimedia sensor networks using multiple QoS metrics

In wireless sensor networks, most routing protocols consider energy savings as the main objective and assume data traffic with unconstrained delivery requirements to be a given. However, the introduction of video and imaging sensors unveils additional challenges. The transmission of video and imaging data requires both energy efficiency and QoS assurance (end-to-end delay and packet loss requirements), in order to ensure the efficient use of sensor resources as well as the integrity of the information collected. This paper presents a QoS routing model for Wireless Multimedia Sensor Networks (WMSN). Moreover, based on the traditional ant-based algorithm, an ant-based multi-QoS routing metric (AntSensNet) is proposed. The AntSensNet protocol builds a hierarchical structure on the network before choosing suitable paths to meet various QoS requirements from different kinds of traffic, thus maximizing network utilization, while improving its performance. In addition, AntSensNet is able to use a efficient multi-path video packet scheduling in order to get minimum video distortion transmission. Finally, extensive simulations are conducted to assess the effectiveness of this novel solution and a detailed discussion regarding the effects of different system parameters is provided. Compared to typical routing algorithms in sensor networks and the traditional ant-based algorithm, this new algorithm has better convergence and provides significantly better QoS for multiple types of services in wireless multimedia sensor networks.