Jointly optimal congestion control, channel allocation and power control in multi-channel wireless multihop networks

In this paper, to increase end-to-end throughput and energy efficiency of the multi-channel wireless multihop networks, a framework of jointly optimize congestion control in the transport layer, channel allocation in the data link layer and power control in the physical layer is proposed. It models the network by a generalized network utility maximization (NUM) problem with elastic link data rate constraints. Through binary linearization and log-transformation, and after relaxing the binary constraints on channel allocation matrix, the NUM problem becomes a convex optimization problem, which can be solved by the gateway centralized through branch and bound algorithm with exponential time complexity. Then, a partially distributed near-optimal jointly congestion control, channel allocation and power control (DCCCAPC) algorithm based on Lagrangian dual decomposition technique is proposed. Performance is assessed through simulations in terms of network utility, energy efficiency and fairness index. Convergence of both centralized and distributed algorithms is proved through theoretic analysis and simulations. As the available network resources increase, the performance gain on network utility increases.     

A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet

We survey some recent results on modeling, analysis and design of congestion control schemes for the Internet. Using tools from convex optimization and control theory, we show that congestion controllers can be viewed as distributed algorithms for achieving fair resource allocation among competing sources. We illustrate the use of simple mathematical models to analyze the behavior of currently deployed Internet congestion control protocols as well as to design new protocols for networks with large capacities, delays and general topology. These new protocols are designed to nearly eliminate loss and queueing delay in the Internet, yet achieving high utilization and any desired fairness.     

AIMD算法在公平性收敛中的应用分析

系统地分析了AIMD(addictive increase multiplicative decrease)算法在拥塞控制过程的公平性收敛中的应用,包括分布式动态资源分配模型、公平性指标函数、应用于公平性收敛的AIMD算法以及公平性收敛动力学分析等问题。     

Distributed bandwidth allocation based on alternating evolution algorithm

In a network, end nodes have to compete for bandwidth through some distributed congestion control algorithms. It is a great challenge to ensure the efficiency and fairness of the distributed control algorithms. TCP congestion control algorithms do not perform well in terms of their efficiency and fairness in high speed networks. In this paper, we propose a novel asymptotic evolution algorithm based on the Logistic Model to allocate limited bandwidth resource. The algorithm introduces an explicit bandwidth pre-allocation factor. The factor is carried by the packet and is computed in routers based on the information of the router capacity, the aggregate load, and the instantaneous queue length; therefore the algorithm does not require the routers to keep the per-flow state. According to this pre-allocation bandwidth factor, the senders asymptotically adjust their sending rate and the bandwidth factor changes asymptotically along with the variation of the aggregate load and the queue length in the routers; therefore the sending rate and the pre-allocation bandwidth factor form alternating evolution and eventually reach a steady state.     

ICN中改进的拥塞控制和请求转发策略研究

针对信息中心网络(ICN)中终端用户体验不佳,网络资源利用率低等不足,对ICN中联合多径拥塞控制和请求转发问题展开研究。将该问题看成是以用户吞吐量最大化和总体网络成本最小化为目标的全局优化问题。通过分解策略解决这一全局优化问题,为接收机确定一组最优拥塞控制策略,为网络节点确定一组分布式动态请求转发算法。为了评估本文设计的性能,使用CCNx部署本文协议,并设置测试床用于大规模实验仿真。不同网络场景下的实验评估证明了本文方案的效率和全局公平性,达到最优方案的预期效果,即使面对路径内缓存和网络拥塞导致的延时不确定性也具有稳定的性能。     

A fairness analysis of LAN/WAN protocol relays

Functional standardization activities in ISO and in regional workshops are currently addressing network layer relays for the interconnection of several types of subnetworks. Relay systems are critical systems in the overall performance of the network because they are the points where network congestion can be built up or avoided. Particularly, when the interconnected subnetworks have very dissimilar bandwidths, congestion control becomes a very important issue in relay systems design. This paper addresses the problem of congestion control in relay systems for LAN/WAN interworking. Congestion control deals with the avoidance of collapse situations in intermediate systems due to traffic overload. It deals also with the guarantee of fairness in resource utilization, considering user needs of communication services expressed in terms of Quality of Service (QoS) parameters. To ensure congestion collapse avoidance and fairness, a channel service algorithm is proposed. Simulation results show that, in a situation of overload and for different traffic patterns with different QoS requirements, the relay's channel service and acknowledgment algorithms can guarantee justice in resource utilization and the expected QoS among the active channels.     

基于路由器的网络拥塞控制算法的研究

随着Internet的发展，人们越来越关注网络的性能。本文对路由器中采用的四种拥塞控制算法进行了分析和研究。吸收了这些算法的优点，提出了一种新的拥塞控制算法IMA，IMA算法提高了效率和公平性。     

Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks

The transport control protocol (TCP) has been widely used in wired and wireless Internet applications such as FTP, email and http. Numerous congestion avoidance algorithms have been proposed to improve the performance of TCP in various scenarios, especially for high speed and wireless networks. Although different algorithms may achieve different performance improvements under different network conditions, designing a congestion algorithm that can perform well across a wide spectrum of network conditions remains a great challenge. Delay-based TCP has a potential to overcome above challenges. However, the unfairness problem of delay-based TCP with TCP Reno blocks widely the deployment of delay-based TCP over wide area networks. In this paper, we proposed a novel delay-based congestion control algorithm, named FAST-FIT, which could perform gracefully in both ultra high speed networks and wide area networks, as well as keep graceful fairness with widely deployed TCP Reno hosts. FAST-FIT uses queuing delay as a primary input for controlling TCP congestion window. Packet loss is used as a secondary signal to adaptively adjust parameters of primary control process. Theoretical analysis and experimental results show that the performance of the algorithm is significantly improved as compared to other state-of-the-art algorithms, while maintaining good fairness.     

Femtocell网络的鲁棒议价博弈功率控制

针对具有不完美信道状态信息的Femtocell双层网络，为了保证网络效用最大化、最小服务质量要求及Femtocell用户之间的效用公平，提出了基于议价博弈的鲁棒功率控制方案.在保证宏小区用户正常传输情况下，考虑到Femtocell家庭用户的最小服务质量要求，将Femtocell网络的鲁棒功率控制问题转化为议价博弈功率控制问题.为了保证Femtocell家庭用户之间的公平性，给出了Kalai-Smorodinsky（K-S）议价博弈解，证明了议价博弈解的存在性和唯一性，并提出了一种基于二分查找算法的分布式鲁棒功率控制方案.仿真结果表明，所提出的算法不仅具有较好的收敛性能，而且能够较好地保证用户之间的公平性.     

一种基于二步流控方法的片上动态虚通道路由器

片上硅面积和功耗受到严重限制,报文缓冲区容量也受到严重限制,如何高效使用报文缓冲区是NoC设计的关键问题之一.动态划分虚通道缓冲区是高效使用报文缓冲区的有效方法之一,但会增加拥塞程度,甚至出现无限拥塞的情况.提出一种基于二步流控方法的片上动态虚通道(DAVC)路由器,该二步流控方法将报文分成报文头和报文体两部分分别运用流控算法.实验结果表明:与静态虚通道(SAVC)片上路由器相比,在缓存容量相等的情况下,DAVC路由器能提高23.2%的吞吐率,传输延迟降低27.2%;在DAVC缓存容量减半的情况下可获得相近的性能,节省28.3%的面积与23.8%的漏电流功耗.     

因特网拥塞控制的稳定性、公平性和可扩展性

基于对偶模型理论,从公平性、稳定性和可扩展性三个方面结合多个发展线索,对因特网拥塞控制研究的发展和近况进行综述,并阐释和辨析了一些重要概念和算法,如网络拥塞控制算法的公平性概念,基于窗口调整和基于速率调整的端节点算法,调度算法与主动队列管理算法,端节点算法、中间节点算法与对偶模型理论中原始算法、对偶算法及原始-对偶算法的对应关系,基于速率和基于队列的中间节点算法。对这一研究领域的最新研究成果作了更全面的分析和更深层次的理解。最后指出了几个有意义的研究方向。     

A new congestion control algorithm for improving the performance of a broadcast-based multiprocessor architecture

Congestion occurring in the input queues of broadcast-based multiprocessor architectures can severely limit their overall performance. The existing congestion control algorithms estimate congestion based on a node’s output channel parameters such as the number of free virtual channels or the number of packets waiting at the channel queue. In this paper, we have proposed a new congestion control algorithm to prevent congestion on broadcast-based multiprocessor architectures with multiple input queues. Our algorithm performs congestion control at the packet level and takes into account the next input queue number which will be accessed by the processor, which form the fundamental differences between our algorithm and the algorithms based on the idea of virtual channel congestion control. The performance of the algorithm is evaluated by OPNET Modeler with various synthetic traffic patterns on a 64-node Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) architecture employing the message passing protocol. Performance measures such as average input waiting time, average network response time and average processor utilization have been collected before and after applying the algorithm. The results show that the proposed algorithm is able to decrease the average input waiting time by 13.99% to 20.39%, average network response time by 8.76% to 20.36% and increase average processor utilization by 1.92% to 6.63%. The performance of the algorithm is compared with that of the other congestion control algorithms and it is observed that our algorithm performs better under all traffic patterns. Also, theoretical analysis of the proposed method is carried out by using queuing networks.     

Fast convergence to network fairness

Most AQM algorithms, such as RED, assure fairness through randomness in congestion notification. However, randomness results in fair allocation of network resources only when time limitations are not considered. This is not compatible with the current Internet, where traffic oscillations are frequent and the demand for fair treatment is rather urgent, due to short duration of most applications. Given the short duration of most modern Internet applications, fast convergence to fairness is necessitated. In this paper, we use fairness as the major criterion to adjust traffic and present a corresponding algorithm of active queue management, which is called Explicit Global Congestion Notifier (EGCN). EGCN notifies flows almost simultaneously about incipient congestion by marking packets arriving at the router’s queue, when the load in the network increases and buffer overflow is expected. This is a new approach compared with the random notification policy of RED or ECN. EGCN distributes the burden to adjust backward to more flows and consequently allows for smoother window adjustments. We elaborate on the properties of system-wide response in terms of fairness, smoothness and efficiency. Simulation results demonstrate a clear-cut advantage of the proposed scheme.     

主动网络与TCP融合的拥塞控制方法

最近有大量研究是针对网络拥塞控制的,但是问题仍然非常复杂。TCP的可伸缩性、灵敏性、稳定性和公平性是必需的特性。文章分析了主动网络体系结构的设计思想,在主动网络中,网络不仅具备基本的数据包寻址转发的功能,而且还具有动态编程的能力。在此基础上将主动网络设计思想引入到拥塞控制算法的研究中,针对其在传统网络中存在的一系列问题提出了基于主动网络的拥塞控制算法CCAAN,解决了它们在传统网络研究中存在的问题。实验结果显示AMCA收敛性很好,可以充分利用有效带宽,并且对于TCP公平的动态变化能够迅速做出反应。     

一种新型的端到端TCP拥塞控制机制

拥塞控制机制是决定TCP协议性能的重要因素。传统拥塞控制机制在卫星网络中运用时会导致TCP性能的大幅下降。本文提出了一种新的适应于卫星网络大延时特点的端到端拥塞控制机制,通过观察连续的不同长度的数据包的RTT的变化来确定网络带宽和适宜的拥塞窗口。实验结果证明,这种新机制在吞吐量、公平性、友好性方面均好于当前主流的端到端拥塞控制机制。     

一种无线传感器网络的优化速率控制方法

拥塞控制是无线传感器网络中的一个关键性问题。从解决拥塞问题出发,提出了一个基于优化速率的拥塞控制算法ORCC。算法构建了一个分布式的分簇网络结构,利用缓冲的占用情况进行拥塞检测,并使用基于优化理论的速率调节策略来保证网络吞吐量的稳定,从而通过求解出的最优解来实现簇内节点效用的最大化。仿真实验表明,ORCC算法不仅能有效缓解网络拥塞,降低平均延迟,还具有较好的网络传输公平性。     

Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams

Rate adaptive multimedia streams adjust the encoding rate dynamically (with corresponding changes in media content resolution) in response to changing levels of congestion along the route. The field of optimization based congestion control has yielded sophisticated distributed algorithms for resource allocation among competing elastic streams. In this work we study the fundamental tradeoffs for a class of optimization based distributed algorithms for rate adaptive streams. We focus on three tradeoffs: (i) the tradeoff between maximizing client average quality of service (QoS) and client fairness, (ii) the tradeoff between granularity of control (both temporal and spatial) and QoS, and (iii) the tradeoff between maximizing the received volume and minimizing the fluctuations in received rate. We illustrate these tradeoffs through extensive ns-2 simulations on two distinct topologies – (i) a single bottleneck like and (ii) a linear network.     

无线传感器网络中一种实用的公平性控制模型

公平性问题是拥塞控制中的重要级问题,目的是确保所有数据源共享同等的端到端网络带宽.为了适应传感器网络的特点,扩展了传统公平性的定义,提出了一种基于信息量的公平性定义,并基于该定义提出了一套公平性控制模型CFRC.与现有工作不同,CFRC不需要预先确定数据源,对路由结构没有限制,节点上也不需要维护任何数据流信息和全局状态信息,而是动态地实现公平性控制.CFRC使用一种基于感知面积的信息量计算算法,每个节点只需简单的本地计算而无需复杂的计算开销.在带宽分配上,提出了一种干扰源感知的带宽分配方法,以拥塞节点为中心找到所有干扰源,根据干扰源的信息量来分配信道带宽,充分实现公平性目标.模拟结果表明,CFRC能根据各数据源产生报文的信息量进行公平性控制,降低丢弃报文数目.     

实时多播流的弹性公平性和基于门限的拥塞控制策略

该文提出了关于实时IP多播流基于速率弹性的公平性定义，并结合有关多播组规模估计的机制和多播拥塞控制算法。实现了一种基于门限的实时多播业务的等级拥塞控制策略，使实时多播流在满足瞬态弹性公平性的同时，也基本满足稳态的比例公平性，并对此进行了仿真验证。     

TPDCM:一种新型的分布式拥塞管理方案

提出一种新型的面向区分服务网络的分布式拥塞管理方案,基本思想是利用拥塞状态反馈信息在边缘节点或主机上实施拥塞管理。该方案主要包括三个组成部分:流量控制信息协议、早期拥塞检测和流量控制算法。该方案具有以下特点:(1)在核心网络中,拥塞控制机制独立于特定的传输层协议;(2)对将要发生的拥塞做出快速响应;(3)降低网络的分组丢失率;(4)不需要在网络核心节点中保存每个传输流的状态信息。实验结果表明,与标准的区分服务网络相比,该方案能在TCP和UDP聚集之间公平地分配带宽并能显著地降低分组丢失率。