Balancing buffer utilization in meshes using a "restricted area" concept

Adaptive routing and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptive routing area. To avoid such traffic congestion, a concept of the restricted area is proposed. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routing algorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routing algorithms with the restricted areas yield constantly larger throughput and smaller latency than routing algorithms without using the concept.     

传感器网络中一种拥塞避免、检测与缓解策略

拥塞控制是无线传感器网络中的一个关键性问题,它不但影响传输可靠性,而且会浪费宝贵的能量资源.提出了一个全新的拥塞避免、检测与缓解策略,该策略主要包含两部分:拥塞避免(COTA)和拥塞检测及缓解(CODEM).COTA从全网出发,基于路径的启发式信息分配流量,避免给潜在的热点区域分配过多负载.CODEM使用精确的拥塞度量来检测拥塞,并采取适当的措施来缓解拥塞,同时保证数据传输的可靠性.此外,还利用现有radio的多频特性有效地为控制报文进行拥塞隔离.详细的实验表明了COTA CODEM的优势.     

一种基于IEEE 802.11e的多跳无线网络拥塞控制协议

多跳无线网络中网络拥塞的出现将严重降低网络的性能。基于802.11e提供的区分业务类型的信道接入优先级机制,提出了一种对尽力而为(best-effort)类型业务动态调整其优先级进行网络拥塞控制的协议。该算法的主要思想是对发生网络拥塞的节点提升其业务流传输的优先级使其获得更多的传输机会以缓解拥塞状况,并对严重的网络拥塞状况采取反向施压的策略降低上游节点业务流的转发速率。仿真结果表明,该算法有效地提高了网络重负载情况下的吞吐量。     

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.     

Stable Queue Management in communication networks

Since Active Queue Management (AQM) was recommended by the Internet Engineering Task Force (IETF) as an efficient way to overcome performance limitations of Transmission Control Protocol (TCP), several studies have proven control theory to be a promising field for the design and analysis of congestion control in homogenous communication networks. AQM is gaining increased importance due to reports of buffer-induced latencies throughout the Internet. The increasing volume and diversity of traffic types (i.e., data, voice, and video) suggests that traffic management mechanisms, in general, and AQM schemes, specifically, must not only focus on the critical issue of congestion control but must also consider the QoS demands of heterogeneous traffic. However, to combine quality-of-service provisioning with congestion control, AQM design needs to be reconsidered. In this paper, we propose a state feedback controller design scheme for heterogeneous networks preserving the closed-loop system stability. Delay dependant stability conditions of the closed loop system are derived based on the Lyapunov-Krasovskii method. The proposed approach offers flexible choice of control parameters allowing the network administrator to control fairness and response time for each individual source node in a network of multiple links with different delay properties. The performance and robustness of the proposed controller were illustrated and analyzed using event-based computer simulations.     

Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks

Network performance in tightly-coupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point by reducing the load on the network. Congestion control via source throttling-a common technique to reduce the network load-prevents new packets from entering the network in the presence of congestion. Unfortunately, prior schemes to implement source throttling either lack vital global information about the network to make the correct decision (whether to throttle or not) or depend on specific network parameters, or communication patterns. This paper presents a global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different communication patterns for k-ary n-cube networks. Our design is composed of two key components. First, we use global information about a network to obtain a timely estimate of network congestion. We compare this estimate to a threshold value to determine when to throttle packet injection. The second component is a self-tuning mechanism that automatically determines appropriate threshold values based on throughput feedback. A combination of these two techniques provides high performance under heavy load, does not penalize performance under light load, and gracefully adapts to changes in communication patterns.     

Network Performance Under Bimodal Traffic Loads

In actual multicomputer networks, communications consist of hybrid traffic in which messages exhibit a variety of sizes. However, to date, most studies on network performance are based on traffic loads of uniformly-sized messages. We investigate the performance of wormhole-routed networks under bimodal traffic distributions, a mix of short and long messages. Our studies show that the presence of long messages degrades network performance for short messages dramatically, qualitatively changing network behavior. We present an analytical model for wormhole-routed networks which not only models network performance under uniformly sized message loads more accurately than existing models, but also can be extended to support bimodal traffic distributions. The model is validated against detailed simulation of routing networks, over a variety of message size distributions and message lengths. In virtually all cases, the model accurately predicts both network throughput and average message latency to within 8%. Because the impact of long messages can be severe, we consider three techniques-packetization, virtual lanes, and adaptive routing-to alleviate their impact. Packetization reduces the blocking time of long messages, improving network performance in most cases. Virtual lanes and adaptive routing together provide sufficient routing freedom to eliminate much of the blocking, producing performance comparable or even superior to that produced by packetization. Together, all three techniques are complementary, providing robust performance over a variety of traffic mixes and message sizes.     

Priority-based rate control for service differentiation and congestion control in wireless multimedia sensor networks

In wireless multimedia sensor networks (WMSNs) a sensor node may have different types of sensor which gather different kinds of data. To support quality of service (QoS) requirements for multimedia applications having a reliable and fair transport protocol is necessary. One of the main objectives of the transport layer in WMSNs is congestion control. We observe that the information provided may have different levels of importance and argue that sensor networks should be willing to spend more resources in disseminating packets carrying more important information. Some applications of WMSNs may need to send real time traffic toward the sink node. This real time traffic requires low latency and high reliability so that immediate remedial and defensive actions can be taken when needed. Therefore, similar to wired networks, service differentiation in wireless sensor networks is also an important issue. We present a priority-based rate control mechanism for congestion control and service differentiation in WMSNs. We distinguish high priority real time traffic from low priority non-real time traffic, and service the input traffic based on its priority. Simulation results confirm the superior performance of the proposed model with respect to delays, delay variation and loss probability.     

基于SDN架构的高性能网络拥塞避免策略

拥塞管理是高性能网络领域的重要研究方向,网络拥塞会对网络的全局性能产生较大影响。现有的拥塞管理多采用分布式拥塞避免策略,能够在一定程度上解决网络的拥塞问题,但其处理过程基于局部信息,不能充分利用网络资源,处理效率偏低。近期,人们提出软件定义网络(SDN)架构,该架构采用集中控制器和多层网络技术,能够较好地获取网络的全局信息。在原有工作的基础上提出了一种基于SDN架构的全局拥塞避免策略OSCP,该策略在拥塞信息获取和控制信息的传输上,改进了原有的解决方案,并结合自适应传输进行网络路由。实验结果表明,该策略可以较好地避免和解决网络中存在的拥塞问题,降低网络延迟并提高饱和吞吐率。     

Packet video transport in ATM networks with single-bit feedback

The promise of a broadband integrated service digital network has led to the design of mechanisms for efficient transport of real-time compressed video in packet switching networks. We examine feedback control for video transport in ATM networks where the available feedback is a single bit of information carried in the cell header. We investigate the performance of three single-bit schemes for source rate adaptation. Two were originally for congestion control of bursty data traffic and are modified to control video traffic. The third scheme conveys more information about the state of queue(s) at the bottleneck. The simulation results show that all three schemes for feedback control of VBR video streams work remarkably well. During severe network congestion, the signal quality degrades gracefully, but not uniformly across all connections. Based on insights from the initial simulations, we propose a scheme to improve the fairness of service and demonstrate its effectiveness.     

带冲突避免和流量自适应的低功耗侦听MAC协议

为提升无线传感器网络在能耗、时延以及动态适应负载方面的综合性能, 对几种典型MAC协议进行了分析, 提出了一种带冲突避免和流量自适应的LCT-MAC协议。在该协议中, 长前导码被划分为多个小前导码, 并嵌入目的节点地址信息, 避免了串音; 节点可以根据网络流量调整睡眠周期, 减少了时延; 在重负载时, 节点能基于优先级信息选择退避时长, 避免冲突。仿真结果表明, 与S-MAC协议和LPL协议相比, LCT-MAC协议降低了传输时延, 并减少了全网能耗和数据包碰撞次数, 具有优良的综合性能。     

一个适用于DTN网络的拥塞避免与解除方案

DTN(delay-tolerant network,延迟容忍网络)的网络特点及其采用的托管传输机制易造成网络受限资源(如缓存、带宽等)的耗尽,形成网络拥塞,导致网络性能的下降。传统TCP拥塞控制机制不适用于DTN网络。提出了一个全新的适用于DTN网络的拥塞避免与拥塞解除方案。拥塞避免根据在足够小的时间段内DTN链路的传输延迟和传输能力的确定性,建立DTN网络有向多径图,对数据发送速率、接收速率、带宽使用等链路负载分割与约束控制,尽可能地提高网络资源的利用率。拥塞解除在节点存储资源划分的基础上,通过节点内存储资源转换与节点间报文转移相结合的方法,解除DTN网络的拥塞状况。仿真结果显示,与其他DTN拥塞控制机制相比,所提方案具有良好的报文交付率、网络开销等网络性能。     

Adaptive congestion control scheme in mobile ad-hoc networks

In the past, several authors have expressed their concerns over the poor congestion control in mobile wireless ad-hoc networks using traditional reference layer model. Many solutions were proposed to handle growing traffic and congestion in the network, using link layer information. Existing solutions have shown difficulties in dealing with congestion with varying packets drop. Moreover, ensuring the superior performance of congestion control schemes with traditional referenced layer model is a challenging issue, due to quick topology changes, dynamic wireless channel characteristics, link-layer contentions, etc. In this paper, we propose an effective cross-layer adaptive transmission method to handle the congestion in mobile wireless ad-hoc networks adequately. Simulation results exemplify the usefulness of the proposed method in handling congestion, and yields better results compared to existing approaches.     

一种基于FNN的高速网络拥塞控制策略

以ATM（asynchronous transfer mode)为研究对旬,同种基于模糊神经网络（fuzzy neural network,简称FNN）的流量预测和拥塞控制策略,拥塞控制是高速网络（如ATM）研究中的关键问题之一,传统的基于BP神经网络的流量预测方法因其收敛速度较慢且具有较大的误差,影响了拥塞控制效果,而模糊神经网络由于具有处理不确定性问题和很强的学习能力,很好地解决这一问题,最后通过仿真,比较和分析了基于BP神经网络和基于FNN方法和性能,证明此方法是有效的。     

主动网络拥塞控制研究与实现

随着Internet的迅速发展,网络流量急剧增长,网络的拥塞问题日益突出,阐述了拥塞产生的原因,介绍了主动网络的思想和体系结构,着重探讨了主动网络在拥塞控制和网络管理等方面的应用,描述了主动拥塞控制系统中主动节点的内部结构,提出了主动拥塞控制系统的一种实现.实验结果显示,实行主动拥塞控制的网络比实行传统拥塞控制的网络在性能上有了一定程度的提高.     

Defense Against Injecting Traffic Attacks in Wireless Mobile Ad-Hoc Networks

In ad-hoc networks, nodes need to cooperatively forward packets for each other. Without necessary countermeasures, such networks are extremely vulnerable to injecting traffic attacks, especially those launched by insider attackers. Injecting an overwhelming amount of traffic into the network can easily cause network congestion and decrease the network lifetime. In this paper, we focus on those injecting traffic attacks launched by insider attackers. After investigating the possible types of injecting traffic attacks, we have proposed two sets of defense mechanisms to combat such attacks. The first set of defense mechanisms is fully distributed, while the second is centralized with decentralized implementation. The detection performance of the proposed mechanisms has also been formally analyzed. Both theoretical analysis and experimental studies have demonstrated that under the proposed defense mechanisms, there is almost no gain to launch injecting traffic attacks from the attacker's point of view     

TCP CAE: an improved congestion control using comparative ACK-based estimator

TCP receivers deliver ACK packets to senders for reliable end-to-end transfer. However, due to network congestion in the backward direction, ACK packets may not be successfully transferred, which causes the degradation of TCP performance. To overcome this problem, this paper proposes a reverse congestion warning mechanism and a congestion handling mechanism in heterogeneous networks with heavy background traffic in the backward direction. In the proposed scheme, senders detect the reverse direction congestion and execute an exponential backoff algorithm in advance instead of waiting for RTO expiration. According to the simulation results using the NS-2 network simulator, the proposed scheme shows a performance elevation of 20% than Reno, 150% than New Reno, and 450% than Westwood, respectively, under heterogeneous networks and that the error rate of the radio link is 1% when the backward network is congested.     

An integrated congestion control mechanism for optimized performance using two-step rate controller in optical burst switching networks

Optical burst switching (OBS) is a promising solution to implement the optical internet backbone. However, the lack of adequate congestion-control mechanisms may result in high burst loss. Schemes such as fiber delay line (FDL), wavelength conversion, and deflection routing to reduce burst collision are unable to prevent the network congestion effectively. To address this problem, we propose and investigate a global solution, called Integrated Congestion-Control Mechanism (ICCM), for OBS networks. ICCM, which combines congestion avoidance with recovery mechanism, restricts the amount of burst flows entering the network according to the feedback information from core routers to edge routers to prevent network congestion. Also, a flow-policing scheme is proposed to intentionally drop the overloaded traffic with a certain probability at a core router to support fairness among flows. Moreover, the transmission rate of each flow is controlled to achieve optimized performance such as maximizing throughput or minimizing loss probability using two-step rate controller at the edge router. Simulation results show that ICCM effectively eliminates congestion within the network and that, when combined with a flow-policing mechanism, the fairness for competing flows can be supported while maintaining effective network performance.     

无线传感器网络中基于多向量的拥塞控制

由于无线传感器网络结点分发信息非常方便，因此它在军事和智能居家领域有着广泛的应用前景。如何在这些网络中建立公平、高效、节能的传轮机制将数据汇集到基站是该网络中的一个重要问题。本文提出了一种分布式动态的对不同的路由路径建立多向量信号控制的算法。该算法同时考虑了不同结点的流量，子结点的数目以及子结点的层数等，并将信息快速反馈到检测到的拥塞中，从而迅速缓解拥塞。模拟实验结果和分析表明该机制具有公平性、有效性、稳定性和节能性。     

EasiCC:一种保证带宽公平性的传感器网络拥塞控制机制

实用的传感器网络拥塞控制方案不仅需要满足多项网络性能指标,而且必须控制开销很小,提出了一种满足上述要求的拥塞控制机制EasiCC(EasiNet congestion control mechanism).在EasiCC中,数据流源节点将数据报文按比例划分到各优先等级中,各网络节点根据网络拥塞程度动态地、同步地调整报文过滤标准,结合报文过滤标准和报文优先级来调节网络流量,保证了无线信道带宽分配上的公平性;将网络准入控制和队列丢包手段相结合来调整网络流量,保证了网络综合性能指标.EasiCC控制开销很少,已在实际传感器网络平台中实现.模拟验证和实验测试结果显示,EasiCC能够公平地为各数据流分配发报速度和网络带宽,并且在报文传输成功率、传输延迟等性能指标上均有良好的表现.