Automatic handover control for distributed load balancing in mobile communication networks

In this paper, we propose an auto-tuning of mobility algorithm in the mobile communication systems as a load balancing self-optimization use case. This paper presents a distributed approach in which the traffic load can be balanced systematically by utilizing the effective load information of neighboring cells. The proposed load balancing scheme detects a load imbalance in the network and resolves the problem automatically by controlling the handover parameter as a nonlinear function of the load difference. Based on control theory, we analyze the adaptive behavior of the proposed controller and derive condition for system stability. Results from asymptotic analysis and simulation indicate that the proposed local controller of each individual cell effectively achieves the global properties, such that the load difference in the network is stabilized globally within a predetermined threshold. Extensive simulation results also show that the proposed scheme outperforms the existing methods by reducing call blocking rate of the overloaded cells.     

A conflict avoidance scheme between mobility load balancing and mobility robustness optimization in self-organizing networks

In the self-organizing networks, mobility load balancing (MLB) and mobility robustness optimization are two significant functions. There is a close relationship between them, as they both adjust the handover parameters to achieve their respective goals. The conflict may happen when both of them adjust the same handover parameters in the opposite directions. Conflict avoidance methods have been proposed in the existing literature. However, all of the existing methods cannot get the optimum values of handover parameters. Moreover, the load distribution of the neighbor cells is neglected, which has a great impact on the network performance. To address these issues, an effective scheme based on the load level of neighbor cells is presented. Firstly, the objectives for MLB are designed and the MLB problem is formulated as a linear programming problem, which can be readily solved by the well-established methods. Furthermore, considering the load distribution of the neighbor cells, the appropriate values of handover parameters for MLB can be obtained. Finally, we provide the framework of MLB procedures. The simulation results verify the performance of the proposed scheme outperforms the exiting methods.     

A distributed backoff-channel deflection algorithm with load balancing for optical burst switching networks

Optical burst contention is one of the major factors that cause the burst loss in the optical burst switching (OBS) networks. So far, various contention resolution schemes have been proposed. Among them, the deflection path is more attractive due to its low requirement for optical buffer in capability and quantity. However, these deflection path algorithms do not consider the successful transmission rate of deflection traffic, and the deflection traffic??s impacts on the original traffic of the deflection path are not concerned. Meanwhile, the offset-time deficit problem for deflected bursts is ignored. Therefore, in order to reduce the burst loss probability in OBS networks, a Distributed Backoff-channel DeFlection algorithm with load balancing, for short DBDF-LB, is proposed. It consists of two parts, that is, the deflection with load balancing and the backoff-channel buffering scheme. Firstly, from the perspective of the network-wide load balancing, the optimal deflection path, on which the contention-failure burst is deflected with the minimum hops and the least burst loss probability, is selected. Secondly, the extra offset-time for the deflected burst is provided through the backoff-channel scheme. Finally, by numerical simulations, compared with the classical shortest path deflection algorithm, the DBDF-LB can obviously reduce the burst loss probability, about 50%, with a little extra overhead.     

A distributed mobility control scheme in LISP networks

The locator identifier separation protocol (LISP) has been made as an identifier-locator separation scheme for scalable Internet routing. However, the LISP was originally designed for fixed network environment, rather than for mobile network environment. In particular, the existing LISP mobility control schemes use a centralized map server to process all the control traffics, and thus they are intrinsically subject to some limitations in mobile environment, such as large overhead of mapping control traffics at central map server and degradation of handover performance. To overcome these problems, we propose a distributed mobility control scheme in LISP networks. In the proposed scheme, we assume that a mobile host has a hierarchical endpoint identifier which contains the information of its home network domain. Each domain has a distributed map server (DMS) for distributed mapping management of Endpoint Identifiers (EIDs) and Locators (LOCs). For roaming support, each DMS maintains a home EID register and a visiting EID register which are used to keep the EID-LOC mappings for mobile hosts in the distributed manner. For performance analysis, we compare the control traffic overhead (CTO) at map servers, the signaling delay required for EID-LOC mapping management, and the handover delay for the existing and proposed schemes. From numerical results, it is shown that the proposed distributed scheme can give better performance than the existing centralized schemes in terms of CTO, total signaling delay for EID-LOC mapping management, and handover delay.     

支持业务均衡的OBS网络分布式回退偏射路由算法

突发竞争是引起光突发交换(OBS)网络丢包的主要因素之一,而作为一种有效的突发竞争解决方法的偏射路由,因其对光缓存器的性能和数量要求较低而备受关注。然而,现有偏射路由算法忽略了偏射业务对偏射路径上原有业务的影响以及业务被偏射后自身的成功传输率,同时也忽略由偏射引起的偏置时间不够的问题,致使OBS网络整体丢包率较高。为此,本文提出了一种支持业务均衡的分布式回退偏射路由算法(DBDF-LB),基本思路在于:从全网业务均衡出发,根据网络状态信息分布式的为偏射业务选择一条丢包率最小、跳数最短的路径;然后通过回退机制,利用网络资源来缓存突发包,从而补偿由偏射引起的额外偏置时间。与典型的最短路径偏射算法(SPDF)相比,DBDF-LB能有效降低丢包率约23~50%,而成功传输突发包所经历的平均跳数增加不到1跳。     

Effects of imperfect power control and user mobility on a CDMAcellular network

Code-division multiple-access (CDMA) is one of the major candidate access techniques for third generation systems. A great deal of effort has been devoted to the study of the capacity it can support. This paper presents analytical derivations which allow the determination of the link availability in the presence of user mobility and power control imperfections in a CDMA network; moreover, it provides the guidelines which permit the implementation of a simple and flexible simulation tool which is independent of the specific CDMA implementations. As a matter of fact, the reported concepts can be applied to any asynchronous CDMA system, i.e., they hold both for the American Standard IS-95 and for the European Community Standard developed in the framework of the RACE CODIT Project     

基于嵌入式的分布式电源节能控制系统的设计与实现

分布式电源改变了传统节能调度方法的刚性特征,使传统节能调度模式无法适应分布式电源的功耗管理的多样性需求,节能效果较差。因此,设计基于嵌入式的分布式电源节能控制系统,系统中的控制器通过温度采集模块获取电源温度,传递给控制执行电路,调控电源运行状态。充电电路将采集到的蓄电池电压值反馈给控制器,微控制器对电压值进行A/D变换,按照蓄电池电压值分析蓄电池电量,对蓄电池充电、放电过程进行管理。通过CAN总线接口,完成CAN总线数据的收发,实现电源功耗的网络化远程控制。软件设计中,给出LPC11C14控制器软件流程,电源控制软件流程图以及关键代码。实验结果表明,所设计系统对分布式电源进行节能控制的控制能力高、节能效果显著。     

网络负载均衡的研究及初步实现

随着Internet的高速发展，基于IP的应用成为网络最普遍、最有用甚至是必不可少的部分。网络负载均衡提高了网络的性能，增强了网络的可用性和可伸缩性。介绍了Windows 2000网络负载均衡的解决方案。     

A study on cell association in heterogeneous networks with joint load balancing and interference management

This paper presents the characteristic analysis of channel gain for two conductor type power line communication (PLC) system using analytical transient model. The analysis of frequency responses is presented by incorporating various lengths of transmission lines and loads at terminal side. It is suggested that variations in the frequency responses of PLC channel, especially under transient condition within the transmission line (TL) can be investigated more effectively by using the transient model. Performance of transient model is found to be significantly better than the previously available work in the literature. More accurate results are achieved in simulation as compared to results obtained from typical \(\pi \) model of lumped circuit.     

A dynamic load balancing algorithm for Quality of Service and mobility management in next generation home networks

Heterogeneity of connection technologies and nodes mobility open new challenges in home networks control strategies. Moreover, user’s needs are changing towards applications requiring high transmission speeds such as 3D gaming, enhanced interactivity and high definition video. Each of those applications puts several constraints on the network capabilities to guarantee requirements on the Quality of Service. In this paper we introduce an innovative concept based on fast load balancing algorithm operating on top of a convergence layer, in order to rapidly react to network changes and contemporaneously to satisfy strict application demands. We formulated the load balancing problem as a Multi-Commodity Flow and resolved it with a column generation approach using Lagrangian Relaxation and Dijkstra algorithm. The load balancing problem computational complexity is decreased with respect to state of the art load balancing solutions based on linear programming techniques. Proof of concept simulation results are reported.     

A novel four-tier software-defined network architecture for scalable secure routing and load balancing

Software-defined networking is an emerging paradigm for supporting flexible network management. In the traditional architecture for a software-defined network (SDN), the controller commonly uses a general routing algorithm such as Open Shortest Path First (OSPF), which chooses the shortest path for communication. This may cause the largest amount of network traffic, especially in large-scale environments. In this paper, we present the design for a novel SDN-based four-tier architecture for scalable secure routing and load balancing. In Tier 1, user authentication is conducted using elliptic curve cryptography (ECC); this avoids unnecessary loads from unauthorized users. In Tier 2, packet classification is performed based on the packet characteristics using the fuzzy analytical hierarchy process (fuzzy AHP), and packets are placed into three individual queues. In Tier 3, scalable secure routing is achieved by selecting the optimal path using the improved particle swarm optimization and ant colony optimization algorithms. With these optimization algorithms, we can adaptively change the number of users, the number of switches, and other parameters. In Tier 4, the recommended secure cluster (multicontroller) management is accomplished using an algorithm that employs modified k-means clustering and a recurrent neural network. Deep reinforcement learning (DRL) is also proposed for updating the controller information. Experimental results are analyzed using the OMNeT++ network simulator, and the evaluated performance displayed improvement over a variety of existing methods in terms of response time (50% to 60%), load (55%), execution time (3.2%), throughput (9.8%), packet loss rate (1.02%), end-to-end delay (50%), and bandwidth consumption (45%).     

基于4G网络的智能家居系统的设计与实现

针对传统智能家居控制系统在网络组建方面的不足,提出了一种基于S3C2440和ZigBee技术的通用集散远程控制家庭网关系统设计方案。该系统以S3C2440作为主控核心,采用CC2440实现家庭内部网络的组建,利用4G手机实现信息家电的远程控制,该系统功耗小,易于扩展,便于维护,具有一定的实用价值和推广价值。     

基于异频切换负载均衡算法研究与实现

在商用LTE基站系统中,小区之间存在业务量不均衡的情况,特别是热点区域,某些小区处于高负载状态,为了均衡小区的业务负载,引入了移动负载均衡(MLB)技术。选择合适用户(UE)切换到相邻低负载小区,从而有效地提高了整体网络资源效率和吞吐量,同时也能增强用户的性能体验。提出了一种以用户的RSRP和邻区PRB利用率为参数,基于UE业务量的异频切换负载均衡算法,选择出适量的UE切换到目标邻区中,从而达到网络负载均衡。根据实际基站调试结果表明,该算法能够快速精确地切换特定业务量的UE,明确了要卸载的业务量,并且提升了网络吞吐量和UE吞吐量。     

Power control for data load balancing with coverage in dynamic femtocell networks

We consider the load balancing and coverage problem of femtocell networks in indoor environment. We propose a novel framework exploiting the Voronoi diagram with respect to the radio propagation distance. Our initial power assignment scheme achieves maximal indoor coverage with minimized maximum required transmit power, which results in reduced interference. Our approach can adopt any radio propagation model to achieve more accurate coverage for an indoor environment with various obstacles. Time varying data traffic may cause unbalanced data load of base stations producing traffic overload. Our dynamic power control algorithm redistributes the data load by automatically adjusting transmit power levels according to data traffic estimation while preserving coverage. Moreover, we present an algorithm to cope with the dynamic deletion and insertion of femto base stations. Simulations show that the proposed scheme achieves better coverage, reduced interference, and good load balance compared to previous algorithms.     

Admission control with load balancing in IEEE 802.11-based ESS mesh networks

In this paper we study connection admission control (CAC) in IEEE 802.11-based ESS mesh networks. An analytical model is developed for studying the effects of CAC on mesh network capacity. A distributed CAC scheme is proposed, which incorporates load balancing when selecting a mesh path for new connections. Our results show that connection level performance, including both average number of connections and connection blocking probability, can be greatly improved using the proposed mechanism compared to other admission control schemes. Dongmei Zhao received the Ph.D. degree in Electrical and Computer Engineering from the University of Waterloo, Waterloo, Ontario, Canada in June 2002. Since July 2002 she has been with the Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada where she is an assistant professor. Dr. Zhao’s research interests include modeling and performance analysis, quality-of-service provisioning, access control and admission control in wireless networks. Dr. Zhao is a member of the IEEE. Jun Zou received his B. Eng. and M. Eng. Degrees from Tianjin University, China in 1999 and 2002, respectively. He worked at Siemens Communication Networks Ltd., Beijing from 2002 to 2004. Currently, he is a PhD. student at McMaster University, Canada. His research interests include wireless networking, routing protocols, architecture of next generation networks and network security. Terence D. Todd received the B.A.Sc., M.A.Sc. and Ph.D. degrees in Electrical Engineering from the University of Waterloo, Waterloo, Ontario, Canada. While at Waterloo Dr. Todd spent 3 years as a Research Associate with the Computer Communications Networks Group (CCNG). He is currently a Professor of Electrical and Computer Engineering at McMaster University in Hamilton, Ontario, Canada. At McMaster he has been the Principal Investigator on a number of projects in the optical networks and wireless networking areas. Professor Todd spent 1991 on research leave in the Distributed Systems Research Department at AT&T Bell Laboratories in Murray Hill, NJ. He also spent January-December 1998 on research leave at The Olivetti and Oracle Research Laboratory in Cambridge, England. While at ORL he worked on the piconet project which was an early embedded wireless network testbed. Dr. Todd’s research interests include metropolitan/local area networks, wireless communications and the performance analysis of computer communication networks and systems. Dr. Todd is a past Editor of the IEEE/ACM Transactions on Networking and currently holds the NSERC/RIM/CITO Chair on Pico-Cellular Wireless Internet Access Networks Dr. Todd is a Professional Engineer in the province of Ontario and a member of the IEEE.     

A simple distributed autonomous power control algorithm and itsconvergence

For wireless cellular communication systems, one seeks a simple effective means of power control of signals associated with randomly dispersed users that are reusing a single channel in different cells. By effecting the lowest interference environment, in meeting a required minimum signal-to-interference ratio of ρ per user, channel reuse is maximized. Distributed procedures for doing this are of special interest, since the centrally administered alternative requires added infrastructure, latency, and network vulnerability. Successful distributed powering entails guiding the evolution of the transmitted power level of each of the signals, using only focal measurements, so that eventually all users meet the ρ requirement. The local per channel power measurements include that of the intended signal as well as the undesired interference from other users (plus receiver noise). For a certain simple distributed type of algorithm, whenever power settings exist for which all users meet the ρ requirement, the authors demonstrate exponentially fast convergence to these settings     

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.     

P2P网络非对称DHT方法及负载均衡技术研究

研究了适应异构网络环境的非对称结构化对等网的构造和优化算法。提出包括稳定性、带宽、延迟等参数的综合临近测度作为选择临近邻居的尺度;设计基于这种测度的邻居选择算法和路由算法;引入一种流量控制机制避免部分节点过载。通过仿真实验验证了算法的有效性,结果表明新算法的平均路径长度(跳数)缩短为基本Chord协议的50%以下;延迟缩短为65%;同时可以有效地控制胖节点的过载。     

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.