Hop-by-hop congestion control for ad hoc wireless-LAN: a model-based control approach

This paper presents a congestion control protocol for ad-hoc Wireless-LAN (WLAN) with Bandwidth-on Demand (BoD) access. The novelty of this paper is in the extensive use of model-based control methodologies to simultaneously compute the capacity requests necessary to access the network (BoD) and the capacity allocations required to regulate the rates of the traffic flows (congestion control). The proposed scheme allows one to compute upper-bounds of the queue lengths in all the network buffers (thus allowing proper buffer dimensioning and, therefore, overflow prevention), avoids that the assigned capacity is left unused (thus entailing full link utilization) and guarantees the recovery of a satisfactory traffic behaviour as soon as congestion situations terminate (congestion recovery). The high-speed WLAN considered in the paper has been developed within the European Union (EU) project Wireless Indoor Flexible High Bitrate Modern Architecture (WINDFLEX). Extensive simulations prove the effectiveness of the proposed scheme.     

Performance evaluation of bandwidth allocation methods in a geostationary satellite channel in the presence of internet traffic

Resource allocation represents an important issue for the next generation TCP/IP Quality of Service-based satellite networks. Many schemes, proposed in the recent literature, consider Internet traffic as the superposition of traffic sources without distinguishing between User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) flows, even if UDP and TCP imply very different traffic characteristics. The basic idea of this work is that a resource allocation algorithm which is conscious of the difference may be more efficient because it can make use of the different behaviour of TCP and UDP in the presence of network congestion. Actually TCP reduces the source flow rate and, as a consequence, also the bandwidth occupancy when there is network congestion. The use of this feature within the bandwidth allocation scheme allows reducing the bandwidth waste due to over provisioning and using the residual bandwidth for other sources. The advantage is particularly clear over satellite channels where fading often affects the communication: having some residual bandwidth available for stations which have experienced fading can improve the satellite network performance.This paper presents a detailed performance evaluation of a bandwidth allocation scheme, called E-CAP-ABASC and studied for the satellite environment. The bandwidth is assigned to the earth stations that compose the network by a master station on the basis of a cost function whose main part is represented by a closed-form of the packet loss probabilities for the TCP and UDP traffic. The use of two different packet loss probability models for TCP and UDP allows exploiting the different features of the two traffic types, so improving the overall performance either in terms of packet loss or, on the other hand, in terms of the traffic admitted.The performance evaluation is carried out by varying the link degradation due to fading, the traffic load, and the flow balance between UDP and TCP. The results show a good performance of E-CAP-ABASC, compared with two other schemes. Advantages and drawbacks are discussed.     

A multi-model reference control approach for bandwidth-on-demand protocols in satellite networks

This paper presents a multi-model reference control (MMRC) approach for queue-based bandwidth-on-demand (BoD) procedures in geostationary satellite networks. BoD access protocols address the problem of guaranteeing a high exploitation of the valuable satellite bandwidth while offering acceptable end-to-end delays to the traffic accessing the network. In queue-based protocols, the controller objective is to drive the buffer queue length to a certain target queue length; in the proposed scheme, model references (MRs) are used to address the problem of adapting the target queue length to the statistical characteristics of the traffic. The reference queue length is computed as a weighted sum of the outputs of the different MRs; the weights are computed on-line by evaluating the network utilization achieved by each MR, in response to the actual traffic feeding the system. Moreover, the target network utilization is dynamically varied based on the estimated network load. The BoD performances are evaluated via simulations. The work underlying this paper is based on the results of the GEOCAST,¹ SATIP6² and SATSIX³ projects, financed by European Union.     

Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for Network-on-Chip

This paper proposes a novel QoS-aware and congestion-aware Network-on-Chip architecture that not only enables quality-oriented network transmission and maintains a feasible implementation cost but also well balance traffic load inside the network to enhance overall throughput. By differentiating application traffic into different service classes, bandwidth allocation is managed accordingly to fulfill QoS requirements. Incorporating with congestion control scheme which consists of dynamic arbitration and adaptive routing path selection, high priority traffic is directed to less congested areas and is given preference to available resources. Simulation results show that average latency of high priority and overall traffic is improved dramatically for various traffic patterns. Cost evaluation results also show that the proposed router architecture requires negligible cost overhead but provides better performance for both advanced mesh NoC platforms.     

Congestion control based dynamic routing in ATM networks

In this paper we describe briefly a dynamic multi-path algorithm that has been considered for connection oriented asynchronous transfer mode (ATM) networks. Our scheme takes advantage of a cell multiplexing capability that has particular advantage in networks supporting variable bit rate (VBR) traffic. The fundamental objective of the scheme is to propose a congestion control based scheme that bridges the gap between routing and congestion control as the network becomes congested. The proposed routing scheme works as a shortest path first algorithm under light traffic conditions. However, as the shortest path becomes congested under unbalanced heavy traffic, the source uses multiple paths when and if available to distribute the calls and reduce cell loss. This mechanism will provide good Quality of Service for clients within the given constraints. We compare the performance of the proposed scheme with other competitive schemes. The throughput and cell loss performance are compared via simulations. These have been carried out concentrating on a five node network, each with varying traffic patterns, with the intention of gaining insight into the strengths and weaknesses of the various schemes.     

A proportional feedback scheme for ATM networks

Available bit rate (ABR) service class is proposed by Asynchronous Transfer Mode (ATM) Forum to provide the “best-effort” services like traditional TCP/IP traffic. It is designed to make use of the remaining bandwidth not used by VBR and CBR. However, the bursty nature of ABR traffic makes it difficult to prevent buffers on ATM switches from overflowing. A number of schemes have been proposed for ABR traffic control. In this paper, a proportional scheme that is rate-based hop-by-hop flow control is proposed. A mathematical model is built to analyze the hop-by-hop flow control scheme. It is shown the scheme can utilize full bandwidth without any cell loss. It is also shown the scheme has low queuing delay and fast transient response.     

一种提高稳定性和公平性的主动队列管理机制

结合平均队列和负载衡量拥塞, 实现选择性丢包,提出早期选择性丢包算法(ESD). ESD采用指数函数计算丢包概率,使丢包概率随拥塞程度增大而指数递增;引入记录活跃连接状态信息的虚队列,并在虚队列上假轮转,以检测发送速率大的连接;区分非响应性连接和响应性连接,挑选丢包的候选连接,拥塞时优先丢弃候选连接在队列头部的数据包.实验结果表明,ESD可提高队列稳定性,降低Web流和RTT较大连接的丢包率,提高连接占用带宽的公平性,缩短应用响应时间.     

Content-Aware Distortion-Fair Video Streaming in Congested Networks

Internet is experiencing a substantial growth of video traffic. Given the limited network bandwidth resources, how to provide Internet users with good video playback quality-of-service (QoS) is a key problem. For video clips competing bandwidth, we propose an approach of Content-Aware distortion-Fair (CAF) video delivery scheme, which is aware of the characteristics of video frames and ensures max-min distortion-fair sharing among video flows. CAF leverages content-awareness to prioritize packet dropping during congestion. Different from bandwidth fair sharing, CAF targets end-to-end video playback quality fairness among users. The proposed CAF approach does not require rate-distortion modeling of the source, which is difficult to estimate. Instead, it exploits the temporal prediction structure of the video sequences along with a frame drop distortion metric to guide resource allocations and coordinations. Experimental results show that the proposed approach operates with limited overhead in computation and communication, and yields better QoS, especially when the network is congested.     

An adaptive QoS guaranteeing MAC protocol for real-time traffic in TDMA-based wireless ATM networks

This paper presents a new media access control (MAC) protocol based on forward error control (FEC), which is appropriate for supporting real-time traffic with strict QoS requirements in wireless ATM networks. As the channel BER in wireless environments is very high and varying 10⁻⁵–10⁻², previous schemes that use powerful FEC have combated to overcome this noisy channel condition at the cost of valuable bandwidth. As most previous works have been dedicated to maximize the channel efficiency, they were not able to meet QoS requirements of real-time applications in wireless networks. A new MAC protocol proposed in this paper is designed to guarantee the throughput requested by a real-time traffic user while keeping the bandwidth consumption at a minimum. The proposed scheme is for a TDMA system and uses adaptive FEC. We analyze the wireless channel and model it as a two-state error control system to design an efficient MAC protocol. We use simulation experiments to show how the proposed scheme provides QoS guarantees, and compare it with the CDMA system in terms of capacity, i.e. the number of users that can be supported.     

A real-time protocol for the Internet based on the least mean square algorithm

Generally, real-time applications based on the User Datagram Protocol (UDP) generate large volumes of data and are not sensitive to network congestion. In contrast, Transmission Control Protocol (TCP) traffic is considered "well-behaved" because it prevents the network becoming congested by means of closed-loop control of packet-loss and round-trip-time. The integration of both sorts of traffic is a complex problem, and depends on solutions such as admission control that have not yet been deployed on the Internet. Moreover, the problem of quality-of-service (QoS) and resource allocation is extremely relevant from the point of view of convergence of streaming media and data transmission on the Internet. In this paper an adaptive real-time protocol based on the least mean square (LMS) algorithm is proposed to estimate the application UDP bandwidth in order to reduce the quadratic error between the packet loss and a target. Moreover, the LMS algorithm is also applied to make sure that the reduction in the average bandwidth allocated to each TCP process will not be higher than a given percentage of the average bandwidth allocated before the beginning of the UDP application.     

Congestion prevention in broadband wireless access systems: An economic approach

While the demand for mobile broadband wireless services continues to increase, radio resources remain scarce. Even with the substantial increase in the supported bandwidth in the next generation broadband wireless access systems (BWASs), it is expected that these systems will severely suffer from congestion, due to the rapid increase in demand of bandwidth-intensive multimedia services. Without efficient bandwidth management and congestion control schemes, network operators may not be able to meet the increasing demand of users for multimedia services, and hence they may suffer an immense revenue loss. In this paper, we propose an admission-level bandwidth management scheme consisting of call admission control (CAC) and dynamic pricing. The main aim of our proposed scheme is to provide monetary incentives to users to use the wireless resources efficiently and rationally, hence, allowing efficient bandwidth management at the admission level. By dynamically determining the prices of units of bandwidth, the proposed scheme can guarantee that the number of connection requests to the system are less than or equal to certain optimal values computed dynamically, hence, ensuring a congestion-free system. The proposed scheme is general and can accommodate different objective functions for the admission control as well as different pricing functions. Comprehensive simulation results with accurate and inaccurate demand modeling are provided to show the effectiveness and strengths of our proposed approach.     

Content-aware rate allocation for efficient video streaming via dynamic network utility maximization

Nowadays it is vital to design robust mechanisms to provide QoS for multimedia applications as an integral part of the network traffic. The main goal of this paper is to provide an efficient rate control scheme to support content-aware video transmission mechanism with buffer underflow avoidance at the receiver in congested networks. Towards this, we introduce a content-aware time-varying utility function, in which the quality impact of video content is incorporated into its mathematical expression. Moreover, we analytically model the buffer requirements of video sources in two ways: first as constraints of the optimization problem to guarantee a minimum rate demand for each source, and second as a penalty function embedded as part of the objective function attempting to achieve the highest possible rate for each source. Then, using the proposed analytical model, we formulate a dynamic network utility maximization problem, which aims to maximize the aggregate hybrid objective function of sources subject to capacity and buffer constraints. Finally, using primal–dual method, we solve DNUM problem and propose a distributed algorithm called CA-DNUM that optimally allocates the shared bandwidth to video streams. The experimental results demonstrate the efficacy and performance improvement of the proposed content-aware rate allocation algorithm for video sources in different scenarios.     

Infiniband网络中All_to_All通信性能优化

All_to_All操作是一种重要的集合操作.目前的商用Infiniband网络中没有有效的拥塞控制机制.通过实验研究了2种典型的All_to_All算法在Infiniband网络中的性能,发现这些算法在传输大于32KB的大消息时会在网络中产生严重的拥塞,从而导致网络带宽利用率仅有30%~70%.尝试通过将大消息拆分成小消息、调度小消息的发送来减少网络拥塞.在任意2对进程间都建立可靠的连接,为每个连接都维护一个正在处理的发送请求计数器.当该计数器超过某个阈值后,认为这2个进程间的通信链路上发生了拥塞,此时停止向该连接的发送队列投递新的发送请求,以避免拥塞扩散到整个网络.实验结果表明该优化算法可以改善网络的拥塞程度;相比现有算法带宽利用率可以提高10%以上,最多可以提高20%.     

TRIDENT: An automated approach to traffic engineering in IP/MPLS over ASON/GMPLS networks

This paper addresses the problem of designing a capacity management/traffic engineering procedure for an IP/MPLS over ASON/GMPLS scenario. We suggest TRIDENT, a procedure whose main goal is to dynamically provide the bandwidth required to transport through an ASON the MPLS–LSPs already established at the IP/MPLS client network. TRIDENT relies on automatically triggering demands to set up or tear down the ASON switched connections, and it is based on monitoring and predicting the offered traffic at the interfaces between the IP (MPLS) and the ASON layers. TRIDENT allows providing automatic Bandwidth on Demand (BoD) and it counteracts potential congestion at the client network. Its merits are evaluated by simulation results and it has also been experimentally tested.     

自适应带宽的最大-最小公平性拥塞控制

带宽共享和拥塞控制对于Internet的健壮性和公平性是很重要的研究课题.对交换设备中流量共享拥塞链路的带宽公平分配进行研究,提出一个优化交换设备带宽的设置算法:根据出端口接收速率自适应设置入端口带宽门限,对入端口的带宽进行动态重新分配,提高资源利用率.模拟实验表明,此算法有以下优点:1)高适应性;2)最大最小公平性;3)快速响应网络变化;4)高可靠性;5)稳定性.     

ATM congestion control using Minimal Resource Allocation Networks (MRAN)

This paper presents a congestion control scheme for ATM traffic using a minimal radial basis function neural network referred to as Minimal Resource Allocation Network (MRAN). Earlier studies have shown that MRAN is well suited for online adaptive control of nonlinear time varying systems as it can adjust its size by adding and pruning the hidden neurons based on the input data. Since ATM traffic is nonlinear and time varying performance of MRAN as a congestion controller is investigated here. These studies are carried out using OPNET to model the ATM traffic. The ATM traffic model consists of bursty, Variable Bit-Rate (VBR) and custom traffic in a multiplexed form so as to generate a heavily congested traffic situation. For this scenario, the controller has to minimize the congestion episodes and maintain the Quality of Service (QoS) requirements. This paper compares the performance of the MRAN congestion controller with that of a modified Explicit Rate Indication with Congestion Avoidance (ERICA) scheme and a Back-Propagation (BP) neural controller. Simulation results indicate that MRAN controller performs better than the modified ERICA and BP controller in reducing the congestion episodes and maintaining the desirable QoS.     

Above packet level admission control and bandwidth allocation for IEEE 802.16 wireless MAN

IEEE 802.16 wireless Metropolitan Area Network (MAN) is expected to revolutionize the broadband wireless access technology. Efficient resource management is essential in providing scalability in such large IEEE 802.16-based wireless network and Quality of Service (QoS) for multimedia applications (VoIP, MPEG, FTP, WWW) is usually achieved by appropriate classification of scheduling services and grant/request mechanism. In this paper, we firstly discuss the QoS issue in IEEE 802.16 wireless MANs and propose a dynamic admission control scheme for scheduling services defined in the 802.16 specification. The proposed scheme provides the highest priority for Unsolicited Grant Service (UGS) connections and maximizes the bandwidth utilization by employing bandwidth borrowing and degradation. We develop an approximate analytical model to evaluate the system performance by assuming that the traffic processes of all scheduling services are Poisson processes. In fact, the self-similarity of non-voice traffic makes its traffic process far from Poisson process and should be modeled by Poisson Pareto Burst Process (PPBP). Therefore, in the later part of the paper, we analyze upper bound blocking probabilities of all scheduling services above the packet level using PPBP model for fractal traffic and Gaussian model for aggregated traffic in large wireless network as well as using the Chernoff bound method. Based on the analytical results, we give another admission control and bandwidth allocation mechanism above the packet level so as to minimize the blocking probability of each type of service in IEEE 802.16 wireless MAN. Analytical and simulation results are obtained and compared to demonstrate the effectiveness of proposed schemes and validate our analytical models.     

一种基于SDN和MPTCP的多径并行传输技术

本文提出了根据网络信息状态通过SDN控制器来控制MPTCP流量以提高并行传输速率。利用本文所提出的最宽不相交选路算法,为每个MPTCP连接选择一组可用带宽最宽且链路差距较小的路径集。然后使用可用路径容量的比例作为流量分配到该路径上的概率,进一步减小子流的带宽差距。最后,通过搭建Floodlight仿真实验平台,证明本方案能够避免MPTCP的不同子流经过同一路径,并有效的利用路径提升并行传输效率。     

Fast,Fair and Frugal Bandwidth Allocation in ATM Networks

Abstract. ATM networks are used to carry a variety of types of traffic. For some types of traffic, in particular Available Bit Rate (ABR) traffic, the bandwidth of a network is typically insufficient to satisfy the requests of all the sessions, and so some fair allocation scheme must be devised. The ATM Forum, the standards setting body for ATM networks, has specified that the fairness criterion for ABR traffic should be Max-Min Fairness , which intuitively means that raising the bandwidth of any session comes at the expense of some other session of no greater bandwidth. Protocols to allocate bandwidth to sessions in a max-min fair manner are an important part of a network design. For a protocol to be realistic, it must conform to the Resource Management (RM) cell mechanism specified by the ATM Forum. Such RM cells get sent as a constant fraction of all cells sent by the source; however, they have only a few fields. RM cells are the only means of communication allowed from link to link so any reasonable protocol is totally distributed and asynchronous, since the RM cell mechanism does not easily lend itself to synchronization. Finally, RM Cells must be handled very quickly at each link. We call a protocol frugal if at each link it performs O(1) computation per RM cell and uses O(1) space per session. Recently, several frugal RM cell protocols have been proposed for ABR traffic, but none have been shown to converge to the max-min fair state. Protocols that are known to converge in a linear number of maximum round-trip times require RM cell processing that is linear in the number of sessions that go through a link. In this paper we give a frugal RM cell protocol for ABR that matches the convergence time of the fastest known non-frugal protocol. A second type of ABR traffic is the Minimum Cell Rate (MCR) type, where every session can specify a minimum amount of bandwidth. The max-min fair allocation should then respect these MCR requests. We extend our results to give the first frugal RM cell protocol for MCR and achieve a quadratic convergence rate.     

Dynamic Fuzzy Controlled RWA Algorithm for IP/GMPLS over WDM Networks

This paper proposes a dynamic RWA scheme using fuzzy logic control on IP/GMPLS over WDM networks to achieve the best quality of network transmission. The proposed algorithm dynamically allocates network resources and reserves partial bandwidth based on the current network status, which includes the request bandwidth, average utilization for each wavelength and its coefficient of variance (C.V.) of data traffic, to determine whether the connection can be set up. Five fuzzy sets for request bandwidth, average rate and C.V. of data traffic are used to divide the variable space: very large (LP), large (SP), normal (ZE), small (SN), and very small (LN). Setting the fuzzy limit is a key part in the proposed algorithm. The simulation of scenarios in this paper has two steps. In the first step, the adaptive fuzzy limits are evaluated based on average transmission cost pertaining to ten network statuses. The second step is to compare the proposed algorithm with periodic measurement of traffic (PMT) in ATM networks in six network situations to show that the proposed FC-RWA algorithm can provide better network transmission.