WDM网络中基于均衡策略的波长分配算法

对WDM光网络中的波长分配问题进行了研究,采用波长均衡分配的思路解决瓶颈容量对网络性能的影响,并给出了一种启发式算法--最大剩余瓶颈容量算法(Maximum Bottleneck Capacity,MaxBC).该算法把负载引起的波长损失均衡地分布在网络中,使得链路的信道容量受到的影响更小.通过仿真比较了MaxBC与MaxSum、RCL算法在网络拥塞概率等网络性能上的优劣.     

网络负载均衡的控制理论及实践战略

网络负载均衡技术NLB（Network Load Balancing）采用完全分配算法来为集群中的服务器分配进入的访问流量,当集群中的某台服务器失效时,NLB会自动转发数据到其他可用的服务器上。负载均衡由多台服务器以对称的方式组成一个服务器集合,每台服务器都具有等价的地位,都可以单独对外提供服务而无须其他服务器的辅助。通过某种负载分担技术,将外部发送来的请求均匀分配到对称结构中的某一台服务器上,而接收到请求的服务器独立地回应客户的请求。均衡负载能够平均分配客户请求到服务器列阵,籍此提供快速获取重要数据,解决大量并发访问服务问题。     

模糊聚类CIAP在雷达组网中的应用

随着雷达网络传输技术的发展,雷达网络中的数据拥塞和流量分配不均衡问题亟待解决.文中针对多个被覆线与无线AP所组成的雷达传输网络中的流量分配不均衡问题,对多链路负载均衡算法(CIAP)中的任务调度算法进行改进.算法依据网络传输链路本身的固有特性,在进行链路碎片调度时,采用模糊聚类的思想对任务调度算法进行改进,该算法根据网络中各链路的剩余带宽和链路时延对负载较大的链路的路由碎片进行实时调度.实验结果表明,与传统的基于循环招标任务调度的多链路负载均衡算法比较,改进的算法能够迅速高效地均衡雷达网络中的链路负载.     

基于DHCP服务器状态的动态负载均衡算法

负载均衡是DOCSIS/PacketCable网络环境中DHCP服务集群亟待解决的问题,负载均衡算法是给集群中各服务器分配任务的核心,本文提出了一种根据服务器状态来分配任务的算法,给出了服务器性能、负载量、权值及服务器状态的计算。算法引入了根据随机数和服务器的状态选择服务器的方法,在考虑服务器真实负载,处理能力的基础上,尽量简化负载均衡器的任务分配算法。测试结果显示该算法优于基于实时性能动态反馈的负载均衡算法。     

一种改进的动态反馈负载均衡算法

在集群系统中,负载均衡算法是影响系统性能的关键因素之一.为了进一步提高集群系统的性能,有必要对负载均衡算法进行优化.通过对最小连接算法和DFB(Dynamic Feed-Back)算法的详细分析,提出了一种改进的动态反馈负载均衡算法.该算法通过收集每台服务器的实时性能参数,动态地计算出各服务节点的分配概率,并由此决定用户请求分配给哪一个服务节点.通过对上述三种算法性能的测试,得出了该算法能够有效提高集群系统性能的结论.     

一种基于分布式服务器集群的可扩展负载均衡策略技术

提出了一种基于软件定义网络的分布式数据库负载均衡算法,将数据、控制、应用分离的同时计算服务器集群中单个服务器的实际负载.通过查询流量采样记录来决策最少连接的服务器路径,减少了访问请求的响应时间,提高了系统吞吐量和容错能力,实现了充分利用服务器资源的目的.内网中的分布式数据库实验对通用负载均衡技术和基于软件定义网络的负载均衡技术进行了比较,在不同服务器集群的负载状态下,后者的平均响应时间小于前者,并得到了更好的负载均衡效果.     

RoF通信系统中一种动态负载均衡策略研究与仿真

针对RoF系统的结构特点建立了一种树型结构模型.基于该模型,提出了一种动态负载均衡算法.仿真显示该算法实现了处理节点间的负载均衡,对比表明采用该负载均衡策略的系统具有较低的任务等待延时,系统性能有所提高.     

一种基于改进遗传算法的动静态负载均衡算法

针对目前负载均衡算法在低负载情况下影响系统效率及在高负载情况下分配效率不佳等问题，基于Nginx服务器，文中提出了一种在改进遗传算法基础上动静态结合的负载均衡算法。该算法选择使用CPU性能、内存性能、磁盘I/O和网络带宽等服务器性能参数作为服务器节点性能评价指标及低负载下的静态加权轮询算法权值，并基于该指标根据节点性能使用率所占集群平均负载使用率的变化，设计了在高负载情况下的动态负载均衡算法。通过引入操作转换阈值及动态三角函数操作概率的改进遗传算法，实现了静态算法优势区转变为动态算法优势区的阈值计算。通过设计对比实验，证明了文中算法在实验环境下相比于加权轮询算法、概率择优算法和dnfs＿conn算法更具有较好的负载均衡效果，相比于dnfs＿conn算法在平均响应时间和实际并发连接数等数值上具有15%左右的提升。     

基于最大流的无线mesh网络负载均衡信道分配算法

针对无线mesh网络中各信道间的干扰情况及流量负载均衡问题,定义了负载均衡的目标优化函数,设计一种基于最大流的负载均衡信道分配算法。该算法优先考虑为负载量比较大的链路分配更多的带宽,使得一些关键链路能够承受较大的流量负载,实现各信道的负载均衡,减少网络拥塞,降低分组丢失率和延迟。实验结果表明,该算法较好地平衡了网络负载,在网络业务较重的情况下还能获得较好的网络性能。     

基于动态反馈机制的服务器负载均衡算法研究

针对当前已有负载均衡算法无法准确反映服务器负载的大小和手动设置服务器权值比较固定等方面所存在的不足,提出了一种基于动态反馈机制的服务器负载均衡算法。本算法综合考虑服务器各种性能因素,并根据当前负载动态调整权值,再依据算法调整服务器负载,使得服务器实现负载均衡。通过使用OPNET仿真软件证明该算法相对于传统算法能够减少服务器延迟,提高平均响应速率,并且有效地平衡了集群中服务器的负载。     

On-Line Routing in WDM–TDM Switched Optical Mesh Networks

This paper considers the on-line traffic grooming problem in WDM–TDM switched optical mesh networks without wavelength conversion capability. In such a network, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. In this paper, we present an on-line traffic grooming algorithm for the concerned problem. The objective is to efficiently route connection requests with fractional wavelength capacity requirements onto high-capacity wavelengths and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new connection requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.     

移动性感知下基于负载均衡的任务迁移方案

针对移动边缘计算中用户移动性导致服务器间负载分布不均,用户服务质量(Quality of Service, QoS)下降的问题,提出了一种移动性感知下的分布式任务迁移方案。首先,以优化网络中性能最差的用户QoS为目标,建立了一个长期极大极小化公平性问题(Max Min Fairness, MMF),利用李雅普诺夫(Lyapunov)优化将原问题转化解耦。然后,将其建模为去中心化部分可观测马尔可夫决策过程(Decentralized Partially Observable Markov Decision Process, Dec-POMDP),提出一种基于多智能体柔性演员-评论家(Soft Actor-Critic, SAC)的分布式任务迁移算法,将奖励函数解耦为节点奖励和用户个体奖励,分别基于节点负载均衡度和用户QoS施加奖励。仿真结果表明,相比于现有任务迁移方案,所提算法能够在保证用户QoS的前提下降低任务迁移率,保证系统负载均衡。     

具负载平衡之IPTV影音串流系统

影音媒体具高带宽及实时特性,因此影音串流系统的服务质量的提升端赖影音服务器的有效管理。在此提出一套Video replication及Access request distribution的算法,藉由将热门影音分散到各影音服务器以及影音存取的分散,以达到各影音服务器系统负载平衡的效果。在此比较了3个不同的算法的负载平衡的状况,经实例验证,提出的算法确能达到影音服务器负载平衡的效果,承载更多的系统服务要求。该系统构建在Smart-i TV的IPTV系统台,并讨论了实作的相关技术。     

Service function chain embedding algorithm with wireless multicast in mobile edge computing network

To resolve the excessive system overhead and serious traffic congestion in user-oriented service function chain (SFC) embedding in mobile edge computing (MEC) networks,a content-oriented joint wireless multicast and SFC embedding algorithm was proposed for the multi-base station and multi-user edge networks with MEC servers.By involving four kinds of system overhead,including service flow,server function sustaining power,server function service power and wireless transmission power,an optimization model was proposed to jointly design SFC embedding with multicast beamforming.Firstly,with Lagrangian dual decomposition,the problem was decoupled into two independent subproblems,namely,SFC embedding and multicast beamforming.Secondly,with the L_p norm penalty term-based successive convex approximation algorithm,the integer programming-based SFC embedding problem was relaxed to an equivalent linear programming one.Finally,the non-convex beamforming optimization problem was transformed into a series of convex ones via the path following technique.Simulation results revealed that the proposed algorithm has good convergence,and is superior to both the optimal SFC embedding with unicasting and random SFC embedding with multicasting in terms of system overhead.     

Virtual topology reconfiguration on optical WDM networks considering traffic grooming

This paper investigates the virtual topology reconfiguration (VTR) problem of optical WDM networks by taking the traffic grooming factor into consideration. Firstly, by applying a common “divide and conquer” approach, the problem is categorized and handled as two independent sub-problems, triggering policy and the proper algorithm. Secondly, the VTR problem considering traffic grooming is formulated with new variables and constraints by a mixed-integer linear program (MILP). In order to handle the tradeoff between the advantages and disadvantages of VTR, both network resource utilization and network disruption are examined and quantified in terms of measurable parameters. A new multi-objective VTR algorithm called integrated reconfiguration (IR) algorithm is proposed to provide better overall VTR performance. Different from previous studies this newly proposed VTR algorithm combines three main factors (traffic load, traffic grooming ratio and route length of lightpaths) into one single objective and considers them all when reconfiguring. The results of simulations indicate that proposed VTR policy, periodic VTR triggering policy with IR algorithm, achieves performance improvements for overall VTR performance.     

Load balance in hierarchical routing network

In this article, the problem of load balance in hierarchical routing network is studied. Since conventional shortest path first (SPF) algorithm over aggregated topology in hierarchical routing network may result in worse routing performance, a traffic sharing path selection algorithm and a variable weight scheme are put forward for hierarchical routing network, which can equilibrate the utilities of link resources and reduce the blocking probability of connections with the improvement on survivability. Simulations are conducted to evaluate proposed variable weight and traffics balance (VWTB) algorithm, which combines traffic sharing and variable weight. From the simulation results, it can be found that the proposed VWTB algorithm can balance the traffics and equilibrate the utilities of link resources significantly.     

An Ant-based Multipath Routing Algorithm for QoS Aware Mobile Ad-hoc Networks

In the wireless ad-hoc network management, Quality of Service (QoS) is an important issue. Along with the QoS ensuring, another desirable property is the network reliability. In data communications, multi-path routing strategy can cope with the problem of traffic overloads while balancing the network resource consumption. In this paper, we propose a new multipath routing algorithm for QoS-sensitive multimedia services. Based on the ant colony optimization technique, the proposed algorithm can establish effective multi-paths to enhance the network reliability. According to the load balancing strategy, data packets are adaptively distributed through the established paths while maintaining an acceptable level of QoS requirement. The most important feature of the proposed approach is its adaptability to current traffic conditions. Simulation results indicate the superior performance of the proposed algorithm, while other schemes cannot offer such an attractive performance balance.     

On dimensioning optical grids and the impact of scheduling

When deploying Grid infrastructure, the problem of dimensioning arises: how many servers to provide, where to place them, and which network to install for interconnecting server sites and users generating Grid jobs? In contrast to classical optical network design problems, it is typical of optical Grids that the destination of traffic (jobs) is not known beforehand. This leads to so-called anycast routing of jobs. For network dimensioning, this implies the absence of a clearly defined (source, destination)-based traffic matrix, since only the origin of Grid jobs (and their data) is known, but not their destination. The latter depends not only on the state of Grid resources, including network, storage, and computational resources, but also the Grid scheduling algorithm used. We present a phased solution approach to dimension all these resources, and use it to evaluate various scheduling algorithms in two European network case studies. Results show that the Grid scheduling algorithm has a substantial impact on the required network capacity. This capacity can be minimized by appropriately choosing a (reasonably small) number of server site locations: an optimal balance can be found, in between the single server site case requiring a lot of network traffic to this single location, and an overly fragmented distribution of server capacity over too many sites without much statistical multiplexing opportunities, and hence a relatively large probability of not finding free servers at nearby sites.     

一种SDN中基于SR的多故障恢复与规避机制

针对SDN中的多故障恢复问题,提出了一种基于分段路由的多故障恢复与规避机制.为实现故障的快速恢复,在数据平面通过SR技术预部署一个可对多故障提供快速恢复能力的链路环备份系统;为防止故障恢复时造成部分链路负载过重引发再故障,提出最优化流量平滑算法对负载超过设定阈值的链路实施流量均衡处理.实验结果表明,与已有的SDN多故障恢复机制OAM-Based和Fast Failover相比,所提机制的平均故障恢复成功率分别提高了6.7%和8.5%,且控制器通信开销仅为传统OpenFlow方案的9%,同时,所提机制对故障恢复时导致的链路负载过重问题进行了处理,从故障规避的角度为网络提供保护.     

ATM based multimedia servers

Next-generation multiprocessors will be deployed as servers in a multimedia environment. Current servers cannot handle multimedia traffic internally and effectively deliver the network's high bandwidth to the processing and storage subsystems. Three proposed scalable, subsystem-based, multimedia server architectures use ATM to tackle this problem