A genetic algorithm‐based flow update scheduler for software‐defined networks

Software‐defined networking (SDN) facilitates network programmability through a central controller. It dynamically modifies the network configuration to adapt to the changes in the network. In SDN, the controller updates the network configuration through flow updates, ie, installing the flow rules in network devices. However, during the network update, improper scheduling of flow updates can lead to a number of problems including overflowing of the switch flow table memory and the link bandwidth. Another challenge is minimizing the network update completion time during large‐network updates triggered by events such as traffic engineering path updates. The existing centralized approaches do not search the solution space for flow update schedules with optimal completion time. We proposed a hybrid genetic algorithm‐based flow update scheduling method (the GA‐Flow Scheduler). By searching the solution space, the GA‐Flow Scheduler attempts to minimize the completion time of the network update without overflowing the flow table memory of the switches and the link bandwidth. It can be used in combination with other existing flow scheduling methods to improve the network performance and reduce the flow update completion time. In this paper, the GA‐Flow Scheduler is combined with a stand‐alone method called the three‐step method. Through large‐scale experiments, we show that the proposed hybrid approach could reduce the network update time and packet loss. It is concluded that the proposed GA‐Flow Scheduler provides improved performance over the stand‐alone three‐step method. Also, it handles the above‐mentioned network update problems in SDN.     

软件定义数据中心网络混合路由机制

针对数据中心网络流量大小分布不均匀、传输性能需求不相同的特征,提出了面向传统树型数据中心网络结构的软件定义混合路由机制SHR（software-defined hybrid routing）。SHR通过统计计算将数据流分为大流和小流,为满足其不同的传输性能需求,对大流采用自适应路由算法,对小流采用流量无视路由算法。SHR在OpenFlow机制的基础上,将部分控制权从控制器下放至交换机,以减轻网络的额外负载。在Fat-Tree网络拓扑结构上建立流量模型进行性能分析与仿真实验,结果表明,与传统的等价多路径转发ECMP算法相比,SHR能够提高网络吞吐量,降低数据流丢弃率和分组端到端时延,同时减轻网络的额外负载。     

SDN‐based wireless body area network routing algorithm for healthcare architecture

The use of wireless body area networks (WBANs) in healthcare applications has made it convenient to monitor both health personnel and patient status continuously in real time through wearable wireless sensor nodes. However, the heterogeneous and complex network structure of WBANs has some disadvantages in terms of control and management. The software‐defined network (SDN) approach is a promising technology that defines a new design and management approach for network communications. In order to create more flexible and dynamic network structures in WBANs, this study uses the SDN approach. For this, a WBAN architecture based on the SDN approach with a new energy‐aware routing algorithm for healthcare architecture is proposed. To develop a more flexible architecture, a controller that manages all HUBs is designed. The proposed architecture is modeled using the Riverbed Modeler software for performance analysis. The simulation results show that the SDN‐based structure meets the service quality requirements and shows superior performance in terms of energy consumption, throughput, successful transmission rate, and delay parameters according to the traditional routing approach.     

Genetic algorithm‐based content distribution strategy for F‐RAN architectures

Fog radio access network (F‐RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm‐based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F‐RAN. First, an F‐RAN system model is presented that includes a certain number of randomly distributed fog access points (F‐APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F‐RANs is described. Third, the details of the proposed optimal genetic algorithm‐based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.     

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

Software‐defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size‐limited and power‐hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software‐defined networking routing problem, namely, size‐limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP‐hard and difficult to approximate, a low‐complexity particle swarm optimization–based and power‐efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real‐network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.     

一种软件定义无线网络负载均衡架构及算法

软件定义网络( SDN)为实现异构无线网络中的负载均衡提供了新的思路。设计了一种软件定义的无线网络负载均衡架构,并提出对应算法。首先,根据接收信号强度构建候选网络列表;其次,根据各候选网络的可用负载比率标准差进行负载差异分级;再次,将服务质量匹配度函数和负载均衡指数线性组合成联合优化函数,并根据负载差异分级对联合优化的权重进行动态调整,合理设置门限进行接纳控制。与传统算法相比,所提算法一方面可使各类业务阻塞率明显降低大约20%,另一方面使不同网络的归一化负载更加接近。该算法在进行网络负载均衡的同时,能够有效降低业务阻塞率,从而有效提升异构无线网络的整体性能。     

Adaptive routing and wavelength assignment method based on SDN

Routing and wavelength assignment is an important resource allocation method of all-optical network.Aiming at the problem of traditional method combined with the new architecture,an adaptive multi-objective routing and wavelength assignment method based on SDN was proposed,which could realize the allocation of link resources of all-optical network through self-regulation.Based on the SDN service function chain model,service scheduling time and link service quality were taken as the scheduling objective,routing and wavelength assignment problem was constructed as the 0-1 integer programming problem,meanwhile,binary hybrid topology particle swarm optimization algorithm was used to optimize the network resources for optimal scheduling.The simulation results show that the proposed method is superior to the traditional classical algorithms in the test of recovery time,blocking rate and resource utilization.     

Software‐defined networking approach for enhanced evolved packet core network

The evolved packet core (EPC) network is the mobile network standardized by the 3rd Generation Partnership Project and represents the recent evolution of mobile networks providing high‐speed data rates and on‐demand connectivity services. Software‐defined networking (SDN) is recently gaining momentum in network research as a new generation networking technique. An SDN‐based EPC is expected to introduce gains to the EPC control plane architecture in terms of simplified, and perhaps even software‐based, vendor independent infrastructure nodes. In this paper, we propose a novel SDN‐based EPC architecture along with the protocol‐level detailed implementation and provide a mechanism for identifying information fields exchanged between SDN‐EPC entities that maintains correct functionality with minimal impact on the conventional design. Furthermore, we present the first comprehensive network performance evaluation for the SDN‐based EPC versus the conventional EPC and provide a comparative analysis of 2 networks performances identifying potential bottlenecks and performance issues. The evaluation focuses on 2 network control operations, namely, the S1‐handover and registration operations, taking into account several factors, and assessing performance metrics such as end‐to‐end delay (E2ED) for completion of the respective control operation, and EPC nodes utilization figures.     

Power savings in software defined data center networks via modified hybrid genetic algorithm

In modern data centers, power consumed by network is an observable portion of the total energy budget and thus improving the energy efficiency of data center networks (DCNs) truly matters. One effective way for this energy efficiency is to make the size of DCNs elastic along with traffic demands by flow consolidation and bandwidth scheduling, i.e., turning off unnecessary network components to reduce the power consumption. Meanwhile, having the instinct support for data center management, software defined networking (SDN) provides a paradigm to elastically control the resources of DCNs. To achieve such power savings, most of the prior efforts just adopt simple greedy heuristic to reduce computational complexity. However, due to the inherent problem of greedy algorithm, a good-enough optimization cannot be always guaranteed. To address this problem, a modified hybrid genetic algorithm (MHGA) is employed to improve the solution's accuracy, and the fine-grained routing function of SDN is fully leveraged. The simulation results show that more efficient power management can be achieved than the previous studies, by increasing about 5% of network energy savings.     

一种软件定义网络带内控制连接建立方法

鉴于软件定义网络（Software Defined Network,SDN）中带外控制方式的代价及成本较高,基于带内连接网络拓扑,提出了一种SDN带内控制连接建立方法。该方法首先通过链路层发现协议（Link Layer Discovery Protocol,LLDP）完成SDN控制器IP分发和SDN交换机IP分配,其中SDN交换机IP分配采用基于可变长子网掩码（Variable Length Subnet Mask,VLSM）的全自动IP分配技术来实现;之后,基于无类别域间路由（Classless Inter domain Routing,CIDR）的路由聚合技术实现带内路由自动构建。实验结果表明,该方法能够实现SDN交换机与SDN控制器带内控制连接的自动建立,减小了SDN网络的配置复杂度和部署难度,同时使SDN交换机路由表条目数量得到控制,降低了带内路由构建的复杂性,为SDN控制平面与转发平面控制信道的建立提供了设计参考。     

QL-STCT：一种SDN链路故障智能路由收敛方法

针对软件定义网络（SDN）链路故障发生时的路由收敛问题,提出了Q-Learning子拓扑收敛技术（QL-STCT）实现软件定义网络链路故障时的路由智能收敛。首先,选取网络中的部分节点作为枢纽节点,依据枢纽节点进行枢纽域的划分。然后,以枢纽域为单位构建区域特征,利用特征提出强化学习智能体探索策略来加快强化学习收敛。最后,通过强化学习构建子拓扑网络用于规划备用路径,并保证在周期窗口内备用路径的性能。实验仿真结果表明,所提方法能够有效提高链路故障网络的收敛速度与性能。     

A consistent QoS routing strategy for video streaming services in SDN networks

The software‐defined networking (SDN) paradigm proposes to decouple the control plane (decision‐making process) and the data plane (packet forwarding) to overcome the limitations of traditional network infrastructures, which are known to be difficult to manage, especially at scale. Although there are previous works focusing on the problem of quality of service (QoS) routing in SDN networks, only few solutions have taken into consideration the network consistency, which reflects the adequacy between the decisions made and the decisions that should be taken. Therefore, we propose a network architecture that guarantees the consistency of the decisions to be taken in an SDN network. A consistent QoS routing strategy is then introduced in a way that avoids any quality degradation of prioritized traffic while optimizing resources usage. Thus, we proposed a traffic dispersion heuristic in order to achieve this goal. We compared our approach with several existing framework in terms of best‐effort flows average throughput, average video bitrate, and video quality of experience (QoE). The emulation results, which are performed using the Mininet environment, clearly demonstrate the effectiveness of the proposed approach that outperforms existing frameworks.     

ABC algorithm‐based trustworthy energy‐efficient MIMO routing protocol

This paper introduces artificial bee algorithm (ABC)‐based energy‐efficient protocol with security for the enhancement of lifetime of wireless sensor network. A trustworthy energy‐efficient routing MIMO (TEEM) technique is used by implementing MIMO technique in TEER protocol to isolate malicious nodes and to reduce the fading effects and interference in the network. The performance of ABC‐based trustworthy energy‐efficient MIMO routing (ABC‐TEEM) protocol is analysed. Alive node performance, residual energy, throughput analysis, and pocket loss rate of ABC‐TEEM protocol for WSN are computed and compared with the performance of existing TEEM protocol for various diversity orders.     

Entire network load‐aware cooperative routing algorithm for video streaming over mobile ad hoc networks

In this paper, we present an entire network load‐aware cooperative routing algorithm based on IEEE 802.11 multi‐rate for video streaming over mobile ad hoc networks. The proposed routing algorithm is designed to minimize the consumed time slots while guaranteeing the required time slots at all the pairs of adjacent nodes over the route and the contention neighbors of these nodes to support the route. Furthermore, the proposed routing algorithm can distribute the network loads well over the entire network. This technology is essential because video streaming applications require stringent quality of service and even larger network resources compared with traditional data services, and these demands may dramatically increase the entire network load and/or cause network congestion. Finally, experimental results are provided to show a performance of the proposed routing algorithm. Copyright © 2011 John Wiley & Sons, Ltd.     

基于网络编码的机会网络高效路由算法

针对采用Epidemic机制的机会网络路由算法在数据分组传送阶段存在通信冗余的问题,提出了一种基于网络编码的高效路由算法--NCBER(network-coding-based epidemic routing）。NCBER在传送数据分组的过程中使用主动异或网络编码和多播,并取消了 Request（请求）控制分组,从而减少数据分组的转发次数和控制分组数量,降低网络开销,缩短分组传输时延。理论分析和仿真结果表明,NCBER 算法在网络开销和数据分组端到端时延性能方面优于经典的Epidemic路由算法及其改进算法MRRMR（message redundancy removal of multi-copy routing）,并且使数据传送成功率保持在100%。     

Dynamic deployment algorithm for multi-controllers based on bidirectional matching in software defined networking

Aiming at the controller load imbalance problem in distributed SDN,a multi-controller dynamic deployment algorithm based on bidirectional matching was proposed.Through collecting hop counts,delay and flow information in the network periodically,match lists of switch and controller was built respectively.According to the principle of optimal queuing,switches and controllers were selected from two match lists for implementing bidirectional matching,and the relationship of matching with the help of simulated annealing algorithm was optimized,which achieved dynamic deployment for multi-controller in distributed network.Results show that,compared with the existing approaches,this algorithm can match the connections between switches and controllers reasonably,and reduce the queue delay of flow request effectively.Moreover,and the controller load balancing rate has increased by 17.9% at least.     

Genetic algorithm‐based scheduling in cognitive radio networks under interference temperature constraints

The proliferation of wireless technologies and services has intensified the demand for the radio spectrum. However, the currently existing fixed spectrum assignment policy leads to an inefficient and unevenly distributed spectrum utilization. Cognitive radio paradigm has been proposed to alleviate these drawbacks by employing dynamic spectrum access (DSA) methodology. Federal Communications Commission (FCC) has proposed the interference temperature model, which enables the unlicensed users to utilize the licensed frequencies simultaneously with the licensed users as long as they conform to the interference temperature constraints. Recently, throughput and delay optimal schedulers that meet the interference temperature constraints in cognitive radio networks have been formulated in the literature. However, these schedulers have high computational complexity. In this paper, we propose genetic algorithm (GA)‐based suboptimal methods addressing these throughput and delay optimal scheduling problems. The simulation results corroborate that our GA‐based approach yields very close performance to the optimal solutions and operates with much lower complexity. Copyright © 2010 John Wiley & Sons, Ltd.     

Survey of controller placement problem in software defined network

In order to change situation of high management complexity in current Internet,software defined network (SDN) was proposed,which mainly aimed to directly control forwarding behaviors of data-flow by using flow strategies generated by controllers.With the deployment and applications of SDN,research communities found that the controller placement in SDN network could directly affect network performance.In recent years,controller placement problem (CPP) has become a hot topic,where performance metric and searching algorithms are important research areas.Based on current researches,the existing controller placement problem was systematically analyzed and summarized,which was expected to be helpful for the follow-up research.     

SDN中一种基于拓扑变换的功能组合方法

现有软件定义网络(SDN)中的功能组合方法大多都在单节点内进行,均未考虑单节点交换机的功能承载力.为此,首先提出一种基于拓扑变换的功能组合方法,通过拓扑变换将功能组合分散到多个节点中进行处理.其次,将拓扑变换建模成0-1线性规划问题并提出了综合搜索算法进行求解.最后,基于NetFPGA-10G和Ryu控制器完成了所提功能组合方法的原型系统实现.实验结果表明,与现有方法相比,所提出的功能组合方法在降低流处理时延和存储开销的同时提高了组合效率.