Multipath congestion control algorithm based on link capacity

Factors such as link differences and TCP friendliness constraints lead to the problem of unfair bandwidth allocation when the TCP congestion control mechanism was applied directly to multi-path transmission.To address the problem,it was proposed that a multipath congestion control algorithm was based on link capacity.The proposed algorithm which was based on the concept of feedback regulation achieved multipath joint congestion control by establishing the M/M/1 cache queue model to adjust the throughput rate of senders.Experimental results show the proposed algorithm can improve the multipath transmission bandwidth utilization and the multipath congestion control algorithm responsiveness,and ensure the fairness of multipath transmission.     

无线多媒体网络中自适应拥塞控制算法的研究

提出了一种适用于采用无线接入多媒体流的拥塞控制算法,简称adaptive-MQWB(adaptivemediaQoSandwirelessbandwidth)。该算法依据当前带宽的动态变化率,在满足多媒体传输的最大时延的前提下,以最佳目标队长为实现目标,寻求最优的主动队列管理方案。仿真结果表明,与目前已有的MADR、tuned-RED算法相比,adaptive-MQWB算法在带宽动态变化的自适应性和多媒体传输时延的QoS保证方面都表现出更好的性能优势。     

Signalling minimizing handover parameter optimization algorithm for LTE networks

In currently deployed cellular networks, a lot of time and effort is put by operators into the optimization of radio resource management functions. The use of self-optimization algorithms will eliminate the need for manual monitoring and offline analysis, as these algorithms constantly strive to improve network performance in an automated fashion. However, expectations have to be kept realistic as in some cases it may not be possible for network performance to be significantly improved. A trade-off has to be made between the performance enhancement that these algorithms can achieve and the resources they need for doing so. This article proposes a mechanism which will minimize signalling determined by the use of a handover (HO) self-optimization algorithm. This algorithm derives the proper values of the main HO control parameters based on the observed network performance, while the signalling minimizing mechanism will be used as a stop condition, as, due to shadow fading or coverage holes, performance can only be improved up to a point. After this point, performance will only slightly vary with different control parameter settings but the observed gain will not compensate for the possible instability and signalling load introduced by these changes. By using the signalling minimizing mechanism in combination with the HO self-optimization algorithm, network performance will be maintained while the signalling load will be significantly diminished.     

混合网络下的ECLN拥塞控制跨层优化算法

针对有线网络中的拥塞控制机制ECN进行改进,引入网络负荷因子的概念来更准确、有效的更新发送方的窗口大小,并将它和无线网络中的WELN机制相结合,提出了ECLN机制来提高在混合网络下的网络性能,并用NS2仿真工具在物理层引入无线信道错误模型来模拟无线链路上的丢包现象.仿真结果表明,该算法能够有效降低丢包数,明显提高网络的吞吐量.     

Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs

Network on Chip (NoC) has been proposed as a solution for addressing the challenges in System on Chip (SoC) design. Designing a topology and its routing schemes are vital problems in a NoC. One of the major challenges that designers face today in 3D integration is how to route the data packets within a layer and across the layers in a scalable and efficient manner. In any 3D topology, minimizing the amount of data packet transmissions during the routing is still an open problem. Any efficient traditional routing schemes should avoid deadlocks and minimize network congestion from a source node to a destination node.     

Stability and sensitivity for congestion control in wireless mesh networks with time varying link capacities

A critical challenge for wireless mesh networks is the design of efficient transport protocols that provide high bandwidth utilization and desired fairness in the multi-hop, wireless environment. While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both wireline and wireless networks, a common assumption therein is fixed link capacities. This unfortunately will limit the application scope in wireless mesh networks where channels are ever changing. In this paper, we explicitly model link capacities to be time varying and investigate congestion control problems in multi-hop wireless networks. In particular we propose a primal–dual congestion control algorithm which is proved to be trajectory stable in the absence of feedback delay. Different from system stability around a single equilibrium point, trajectory stability guarantees the system is stable around a time varying reference trajectory. Moreover, we obtain sufficient conditions for the scheme to be locally stable in the presence of delay. Our key technique is to model time variations of capacities as perturbations to a constant link. Furthermore, to study the robustness of the algorithm against capacity variations, we investigate the sensitivity of the control scheme and through simulations to study the tradeoff between stability and sensitivity.     

一种缓解低轨卫星馈电切换中用户群切换的算法

卫星互联网发展已经逐渐被纳入到第六代移动通信技术(6G)概念方案中,基于透明转发可降低系统建设成本,同时系统容量不受星上处理能力限制.但透明转发模式的低轨(Low Earth Or-bit,LEO)卫星系统会出现卫星馈电链路切换情况下用户发生大规模群切换的问题,影响局部地理区域用户通信体验.将透明转发系统低轨卫星跨信关...     

An efficient algorithm for the link allocation problem on ATM-basedpersonal communication networks

The personal communication network (PCN) is an emerging wireless network that promises many new services for the telecommunication industry. The proliferation of demands for extending wireless services to integrated services which supports the transmission of data and multimedia information has resulted in the need for broadband wireless systems that are able to provide service capabilities similar to those of wireline networks. The ATM cell-relay paradigm is one possible approach to provide broadband wireless transmission with PCNs using the ATM switching networks for interconnection of PCN cells. In an ATM-based PCN, the communication path between a pair of mobile terminals might be elongated due to the mobility of the terminals. The link allocation problem is that of allocating backbone links among ATM switches to reduce the effects of terminal mobility on the performance of ATM-based PCNs. Huang and Wang (1997) have shown that this problem is NP-complete. In this paper, we propose a new efficient heuristic algorithm for the link allocation problem. One novel feature of our algorithm is that we are able to derive sufficient conditions under which our algorithm is able to guarantee optimal solutions. Our empirical study shows that the average lengths of communication paths obtained by our algorithm are shorter than those obtained by Huang and Wang's algorithm. In addition, the number of successfully established paths obtained by our algorithm is significantly more than that obtained by the aforementioned     

A distributed link scheduling algorithm for CDMA packet radio networks

A distributed algorithm for the conflict-free channel allocation in CDMA (code division multiple access) networks is presented. Dynamic adjustment to topological changes is also considered. Though the schedules produced by our algorithm are not optimal with respect to link schedule length, the algorithm is simple and practical. The link schedule length minimization problem is NP-complete. Here the length of a link schedule is the number of time slots it uses. The algorithm guarantees a bound 2 — 1 time slots on the TDMA cycle length, where is the maximum degree of a station (i.e., maximum number of stations that a station can reach by radio links) in the network. The message complexity of a station isO().     

网络最大流问题的一种新的符号ADD求解算法

通过对网络及网络最大流问题的符号代数判定图描述,在Trff算法的基础上,给出了网络最大流问题的一种新的符号ADD求解算法。与Dinic、Karzanov算法相比,本文算法的空间复杂度较低。实验结果表明,该算法可处理更大规模的问题。     

Routing and transmission scheduling for minimizing broadcast delay in multirate wireless mesh networks using directional antennas

Using directional antennas to reduce interference and improve throughput in multihop wireless networks has attracted much attention from the research community in recent years. In this paper, we consider the issue of minimum delay broadcast in multirate wireless mesh networks using directional antennas. We are given a set of mesh routers equipped with directional antennas, one of which is the gateway node and the source of the broadcast. Our objective is to minimize the total transmission delay for all the other nodes to receive a broadcast packet from the source, by determining the set of relay nodes and computing the number and orientations of beams formed by each relay node. We propose a heuristic solution with two steps. Firstly, we construct a broadcast routing tree by defining a new routing metric to select the relay nodes and compute the optimal antenna beams for each relay node. Then, we use a greedy method to make scheduling of concurrent transmissions without causing beam interference. Extensive simulations have demonstrated that our proposed method can reduce the broadcast delay significantly compared with the methods using omnidirectional antennas and single‐rate transmission. In addition, the results also show that our method performs better than the method with fixed antenna beams. Copyright © 2012 John Wiley & Sons, Ltd.     

A utility-based distributed maximum lifetime routing algorithm for wireless networks

Energy-efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts toward it, a distributed routing algorithm that maximizes network lifetime is still missing. To address this problem, this paper proposes a novel utility-based nonlinear optimization formulation to the maximum lifetime routing problem. Based on this formulation, a fully distributed localized routing algorithm is further presented, which is proved to converge at the optimal point, where the network lifetime is maximized. Solid theoretical analysis and simulation results are presented to validate the proposed solution.     

XCP拥塞控制算法研究

随着网络的发展,网络拥塞问题越来越受到人们的重视.现在网络中普遍采用的TCP拥塞控制算法不能很好地解决网络的拥塞,尤其是在高带宽时延乘积的网络中.新出现的XCP协议是一个优秀的协议,它的拥塞控制能更好地适应未来网络环境,提供更高的效率和更好的公平性.     

TCP拥塞控制算法研究

随着各种网络应用的不断涌现,网络拥塞问题变得越来越严重,解决这一问题也就越来越重要。阐述了TCP拥塞控制的基本原理,然后介绍了现有的几种TCP拥塞控制算法,并对这些算法进行了分析比较,结果表明虽然每种算法都有其优点,但也存在不足,不能从根本上解决拥塞问题。文章最后指出了拥塞控制的问题所在以及解决方法的发展趋势。     

Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths

In the present paper, routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques based on the combination of integer linear programming based lpsolver and graph coloring are complex and require extensive use of heuristics such as rounding heuristic which makes them slow and sometimes practically not reasonable. Another method employs the greedy approach in graph theory for obtaining available edge disjoint paths. Even though it is fast, it produces a solution for any connection request which is far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow to have the maximum quantity of edge disjoint paths. Here, we compare the offered method with previous edge disjoint paths algorithms applied to the RWA. Comprehensive computer simulation shows that the proposed method outperforms previous ones significantly in terms of running time. Furthermore, the new method shows compatible or better performance comparing to others in number of wavelengths used.The earlier version was published in ICCS 2004, Poland (Krakow). This research was supported by the Ministry of Information and Communication, Korea under the Information Technology Research Center support program supervised by the Institute of Information Technology Assessment, IITA-2005-(C1090-0501-0019).     

异构传感器网络中汇聚节点位置优化路由算法

在异构无线传感器网络模型下,针对采集节点发送数据能量消耗过高及路由时分组丢失率过大等情况,对数据汇聚节点的位置优化及路由进行了研究,提出了移动汇聚节点位置优化路由算法（MLOYIH）。先根据蚁群算法的原理对移动节点与静态节点进行分组,再在组内寻找适合的位置放置汇聚节点,最后根据供电情况,选择合适的跳算进行路由。经过仿真实验与性能分析表明,MLOYIH算法与传统算法比较,能量消耗降低到64%,分组丢失率不高于3%。     

Parameter tuning of rate-based congestion control algorithm for ABR service class in ATM networks

A rate-based congestion control algorithm has been developed and standardized in the ATM forum for ABR service class. In the standard the behaviour of source and destination end systems is specified by several control parameters such as RIF (rate increase factor) and RDF (rate decrease factor). In spite of the fact that the performance of the rate-based congestion control algorithm depends heavily on the selection of these control parameters, no selection method of parameters is shown in the standard. In this paper, by extending our previous work, appropriate settings of rate-control parameters in the various circumstances are investigated. We first analyse the dynamical behaviour of the rate-based congestion control for multiple groups of ABR connections with different propagation delays. Next we evaluate the effect of CBR traffic on ABR connections. Simulation results for a multihop network configuration are also presented to exhibit the trade-off relationship among cell loss probability, link utilization and fairness. Finally, a selection method of control parameters in the multihop network is proposed based on our analytic methods and simulation results © 1998 John Wiley & Sons, Ltd.     

一种3GPP LTE网络的TCP拥塞控制方法

现有的传输控制协议(TCP)拥塞控制机制源自有线网络,未考虑无线基站介质访问控制(MAC)层调度器的特性,影响了TCP协议在长期演进(LTE)系统上的传输性能。提出一种跨层的TCP拥塞控制方法,由MAC层和TCP共同解决TCP虚假超时问题。此方法中,MAC层提供超时信息,TCP层识别出虚假超时后调整数据速率,从而避免系统性能损失,保证MAC层稳定工作。仿真结果表明,在保证用户公平性的同时,新方法可以有效解决虚假超时问题,提高用户实际吞吐量。     

动态关断资源栅格的异构无线网络基站节能算法

针对现有的基于载频/时隙关断的基站节能算法没有考虑异构网络之间的协同或者只考虑单一的业务与实际网络情况不相适应的问题,在异构网络环境下提出了动态关断资源栅格(RG,resource grid)的基站节能新算法——DRGSM(dynamic resource grid shut mode)算法。该算法根据网络的即时负载,当有业务接入时,动态打开RG以满足业务的QoS要求;当RG闲置时,即将其关断以实现节能。仿真结果表明,所提算法较现有的基于载频/时隙关断的基站节能算法,明显地降低了能耗,提高了节能百分比。     

面向SDN的拥塞控制算法研究

随着SDN技术飞速发展,SDN拥塞控制技术成为网络研究的一个热点。文章围绕基于SDN的数据中心网络拥塞问题,首先归纳总结产生拥塞的原因;其次,设计一种新的拥塞控制算法,即当网络中有节点处于拥塞状态,控制器选择一条或者多条合适的数据流在拥塞节点进行重路由传输并降低发送速率;仿真结果表明,所提出的算法降低了丢包率,提高了带宽利用率。