Congestion control in cognitive radio networks with event-triggered sliding mode

The increasing demand for assorted services from extensive wireline and wireless users place a significant burden on the band-limited radio spectrum. To settle the demand, smart reuse and management of the spectrum are necessary. In this contribution, Cognitive Radio being an emerging technology provides a platform to share the same spectrum between Primary Users (licensed) and Secondary Users (unlicensed) for significant improvement in the spectrum efficiency. The coexistence of users for data communications in a band-limited channel calls for a robust congestion controller to maximize throughput. This work presents the design of a robust nonlinear congestion controller based on event-triggered sliding mode for Cognitive Radio Networks. The goal is to maintain desired Quality of Service of the network with optimum bandwidth and resource utilization. The controller has been designed on the notions of sliding mode, better known for its inherent robustness and disturbance rejection capabilities. An event-triggering scheme has been incorporated with the sliding mode for optimum utilization of the available resources. The signal is sampled and control is updated only when a predefined condition gets violated while ensuring acceptable closed-loop behavior of the system. The efficiency of the proposed controllers has been validated using simulations.     

An Internet friendly transport protocol for continuous media over best effort networks

In this paper, we design and evaluate an Internet friendly transport‐level protocol (IFTP) for solving the TCP‐friendly problem. IFTP has two modes of operation. In the standard mode, the IFTP connection faithfully emulates the behaviour of TCP in order to roughly obtain a bandwidth equal to that of a TCP connection. In the extended mode, a simple modification is used to grant QoS‐differentiated services to selected connections. Connections running in the extended mode can get enhanced bandwidth while still emulating the general behaviour of TCP. We develop an analytical model for the congestion control mechanism of IFTP. We also derive analytically the amount of bandwidth that IFTP may be able to claim from TCP in ideal and non‐ideal environments. We evaluate IFTP through simulation and prove its TCP friendliness as well as provide performance results on some of the important metrics such as packet delay, delay jitter, packet loss and link utilization. Copyright © 2002 John Wiley & Sons, Ltd.     

PAQM: an adaptive and proactive queue management for end‐to‐end TCP congestion control

Two functions, the congestion indicator (i.e. how to detect congestion) and the congestion control function (i.e. how to avoid and control congestion), are used at a router to support end‐to‐end congestion control in the Internet. Random early detection (RED) (IEEE/ACM Trans. Networking 1993; 1 (4):397–413) enhanced the two functions by introducing queue length averaging and probabilistic early packet dropping. In particular, RED uses an exponentially weighted moving average (EWMA) queue length not only to detect incipient congestion but also to smooth the bursty incoming traffic and its resulting transient congestion. Following RED, many active queue management (AQM)‐based extensions have been proposed. However, many AQM proposals have shown severe problems with detection and control of the incipient congestion adaptively to the dynamically changing network situations. In this paper, we introduce and analyse a feedback control model of TCP/AQM dynamics. Then, we propose the Pro‐active Queue Management (PAQM) mechanism, which is able to provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function under a wide range of traffic environments. The PAQM stabilizes the queue length around the desired level while giving smooth and low packet loss rates and high network resource utilization. Copyright © 2004 John Wiley & Sons, Ltd.     

Design of a fuzzy traffic controller for ATM networks

This paper presents the design of a fuzzy traffic controller that simultaneously manages congestion control and call admission control for asynchronous transfer mode (ATM) networks. The fuzzy traffic controller is a fuzzy implementation of the two-threshold congestion control method and the equivalent capacity admission control method extensively studied in the literature. It is an improved, intelligent implementation that not only utilizes the mathematical formulation of classical control but also mimics the expert knowledge of traffic control. We appropriately choose input linguistic variables of the fuzzy traffic controller so that the controller is a closed-loop system with stable and robust operation. We extract knowledge of conventional control methods from numerous analytical data using a clustering technique and then use this knowledge to set parameters of the membership functions and fuzzy control rules via fuzzy set manipulation (linguistically stated but mathematically treated) with the aid of an optimization technique named genetic algorithm (GA). Simulation results show that the proposed fuzzy admission control improves system utilization by a significant 11%, while maintaining the quality of service (QoS) contract comparable with that of the conventional equivalent capacity method. The performance of the proposed fuzzy congestion control method is also 4% better than that of the conventional two-threshold congestion control method     

Adaptive low‐priority transfer for high bandwidth and delay product networks

As the exponential growth of the Internet, there is an increasing need to provide different types of services for numerous applications. Among these services, low‐priority data transfer across wide area network has attracted much attention and has been used in a number of applications, such as data backup and system updating. Although the design of low‐priority data transfer has been investigated adequately in low speed networks at transport layer, it becomes more challenging for the design of low‐priority data transfer with the adaptation to high bandwidth delay product networks than the previous ones. This paper proposes an adaptive low‐priority protocol to achieve high utilization and fair sharing of links in high bandwidth delay product networks, which is implemented at transport layer with an end‐to‐end approach. The designed protocol implements an adaptive congestion control mechanism to adjust the congestion window size by appropriate amount of spare bandwidth. The improved congestion mechanism is intent to make as much use of the available bandwidth without disturbing the regular transfer as possible. Experiments demonstrate that the adaptive low‐priority protocol achieve efficient and fair bandwidth utilization, and remain non‐intrusive to high priority traffic. Copyright © 2016 John Wiley & Sons, Ltd.     

Comparative analysis of cumulative distribution function for TCP congestion window size and triple‐duplicate period

Various version of Transmission Control Protocol (TCP) congestion window model are available in the literature. TCP congestion control is handled in two phases: (a) slow start and (b) congestion avoidance. This paper deals with congestion avoidance phase that is based on additive increase multiplicative decrease (AIMD) mechanism in which window size either increase by one or cuts to half of the previous window size. For distribution of window sizes, a model developed by Yan et al has been presented for two loss indications: (a) triple duplicate (TD) and (b) time‐outs (TOs) only while it does not deal with the window size limitation. It does not allow to cap over the TCP congestion window size if the buffer size is restricted to a fixed value though window size could not move beyond that. The unconstrained window size moves on in the presence of low loss probability. In this paper, we propose a model for the case where the window size is bounded by a maximum value that makes applicable to window size limitation as well. Further, the work has been extended to develop a new model that obtains a cumulative distribution function for TD periods (TDPs). The proposed model is validated on ns‐2, and we conclude that observed results for distribution function are very closed to our proposed model.     

A compensated PID active queue management controller using an improved queue dynamic model

Beside the major objective of providing congestion control, achieving predictable queuing delay, maximizing link utilization, and robustness are the main objectives of an active queue management (AQM) controller. This paper proposes an improved queue dynamic model while incorporating the packet drop probability as well. By applying the improved model, a new compensated PID AQM controller is developed for Transmission Control Protocol/Internet Protocol (TCP/IP) networks. The non‐minimum phase characteristic caused by Padé approximation of the network delay restricts the direct application of control methods because of the unstable internal dynamics. In this paper, a parameter‐varying dynamic compensator, which operates on tracking error and internal dynamics, is proposed to not only capture the unstable internal dynamics but also reduce the effect of uncertainties by unresponsive flows. The proposed dynamic compensator is then used to design a PID AQM controller whose gains are obtained directly from the state‐space representation of the system with no further gain tuning requirements. The packet‐level simulations using network simulator (ns2) show the outperformance of the developed controller for both queuing delay stability and resource utilization. The improved underlying model leads also to the faster response of the controller. Copyright © 2013 John Wiley & Sons, Ltd.     

Queue‐based congestion detection and multistage rate control in event‐driven wireless sensor networks

Protocols for sensor networks have traditionally been designed using the best effort delivery model. However, there are many specific applications that need reliable transmissions. In event‐driven wireless sensor networks, the occurrence of an event may generate a large amount of data in a very short time. Among them, some critical urgent information needs to be transmitted reliably in a timely manner. In this scenario, congestion is inevitable because of the constraints in available resources. How to control the congestion is very important for the reliable transmission of urgent information. To address this problem, we propose a queue‐based congestion detection and a multistage rate control mechanism. In our proposed mechanism, not only the current queue length but also the queue fluctuation are adopted as indications of congestion. Each sensor node evaluates its congestion level locally and determines its congestion state with a state machine. We design a multistage rate adjustment mechanism for nodes to adjust their rates depending on their congestion states. We also distinguish high‐priority critical traffic from low‐priority non‐critical traffic. Extensive simulation results confirm the superior performance of our proposed protocol with respect to throughput, loss probability, and delay.Copyright © 2012 John Wiley & Sons, Ltd.     

Evaluation of congestion control protocols for ABR traffic over ATM networks

Congestion control is very important for effective and stable operation of ATM (Asynchronous Transfer Mode) networks. Owing to the bursty and unpredictable characteristic of data network traffic, its congestion control is particularly a challenge for network researchers and designers. The ATM Forum has recently adopted rate‐based congestion control for ABR (Available Bit‐Rate) traffic which is the service class defined for data network applications. However, there is a number of congestion control schemes prevalent. ATM Forum has decided not to specify switch behaviour for ABR traffic; this has further introduced additional ambiguity. Consequently, an evaluation and comparison of the existing protocols would provide valuable guidance for network designers and engineers; it would also give insight for researchers to explore the essence of different congestion control schemes. In the first part of this paper, we investigate the effectiveness of ABR congestion control in the presence of bursty source traffic and the relationship between the burst time scale and the ABR control time scale. Two ABR congestion control schemes, the ABR Explicit Forward Congestion Indication (EFCI) and ABR Congestion Indication (CI) schemes, are compared with Unspecified Bit Rate (UBR) transport which makes no effort to control congestion. Traffic sources of various burst lengths of 100, 1000, 10000, and an equal mix of 100 and 10000 ATM cells are used in simulations. It is found that ABR congestion control schemes effectively control low frequency, medium to long‐term traffic load transients. This is further supported by the result of integrating TCP over ATM congestion control schemes included in the paper. ABR control schemes do not control high frequency, short‐term load transients well, but ABR control is not necessary in such cases since short‐term transients do not require a large amount of buffering. In the second part of this paper, we evaluate and compare six rate‐based congestion control protocols including Scheme I: EFCI, Scheme II: EFCI with separate RM queues, Scheme III: CI, Scheme IV: CI with separate RM queues, Scheme V: the CAPC2 ER (Explicit Rate), and Scheme VI: the EFCI with utilization‐based congestion indication. Each scheme is simulated and compared in the LAN, WAN, and GFC (General Fairness Configuration) environments specified by the ATM Forum. Effects of varying VC (Virtual Circuits) number and changing endsystem–switch distance has been investigated. Their fairness is also compared using the GFC configuration. We have found that ER control scheme performs significantly better than the other five binary control schemes by its faster response to congestion, smoother regulation of bit‐rates, lower queueing delay, shorter buffer queue length, and fairness. Among the other five schemes, the CI scheme performs better than the EFCI scheme. Providing separate RM queues has significantly improved the EFCI scheme in the WAN environment, but has little effect on the CI scheme. Link utilization‐based congestion detection has suffered from either low utilization or an excess cell loss which is unacceptable in most data applications. Copyright © 2000 John Wiley & Sons, Ltd.     

On network bandwidth sharing for transporting rate‐adaptive packet video using feedback

While existing research shows that feedback‐based congestion control mechanisms are capable of providing better video quality and higher link utilization for rate‐adaptive packet video, there has been relatively little study on how to share network bandwidth among competing rate‐adaptive video connections, when feedback control is used in a fully distributed network. This paper addresses this issue by presenting a framework of network bandwidth sharing for transporting rate‐adaptive packet video using feedback. We show how a weight‐based bandwidth sharing policy can be used to allocate network bandwidth among competing video connections and design a feedback control algorithm using an Available Bit Rate (ABR)‐like flow control mechanism. A novel video source rate adaptation algorithm is also introduced to decouple a video source's actual transmission rate from the rate used for distributed protocol convergence. Our feedback control algorithm provides guaranteed convergence and smooth source rate adaptation to our weight‐based bandwidth sharing policy under any network configuration and any set of link distances. Finally, we show the on‐line minimum rate renegotiation and weight adjustment options in our feedback control algorithm, which offer further flexibility in network bandwidth sharing for video connections. Copyright © 2000 John Wiley & Sons, Ltd.     

Distributed multichannel assignment with congestion control in wireless mesh networks

In Multichannel Wireless Mesh Network architecture, topology discovery, traffic profiling, channel assignment and routing are essential. From the existing work done so far, we can observe that no work has been carried out on the combined solution of multichannel assignment with routing protocol and congestion control. In this paper, we propose to design a Distributed Multichannel Assignment with Congestion control (DMAC) routing protocol. In this protocol, a traffic‐aware metric provides the solution for multichannel assignment and congestion control. Hence, the proposed protocol can improve the throughput and channel utilization to a very high extent. The proposed algorithm avoids self‐interference by not assigning a channel to any link whose incident links have already been assigned channels. By our simulation results, we show that our proposed protocol attains high throughput and delivery ratio along with reduced delay. Copyright © 2011 John Wiley & Sons, Ltd.     

OFEX Controller to Improve Queueing and User Performance in Multi‐bottleneck Networks

We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi‐bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX‐controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention‐based multi‐access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.     

Adaptive predictive congestion control of high-speed ATM networks

This paper proposes an auto regressive moving average (ARMAX)-based adaptive control methodology to prevent congestion in high-speed asynchronous transfer mode (ATM) networks. An adaptive controller is developed to control traffic where sources adjust their transmission rates in response to the feedback information from the network switches. Specifically, the buffer dynamics at a given switch is modeled as a nonlinear discrete-time system and an ARMAX controller is designed so as to predict the explicit values of the transmission rates of the sources so as to prevent congestion. Tuning methods are provided for the unknown coefficients of the ARMAX model to estimate the unpredictable and statistically fluctuating network traffic. Mathematical analysis is given to demonstrate the stability of the closed-loop system so that a desired quality of service (QoS) can be guaranteed. The QoS is defined in terms of cell loss ratio (CLR), transmission delay and buffer utilization. We derive design rules mathematically for selecting the parameters of the ARMAX algorithm such that the desired performance is guaranteed during congestion and potential tradeoffs are shown. Simulation results are provided to justify the theoretical conclusions for multiple source/single switch scenarios using both ON/OFF and MPEG data. The performance of the proposed congestion control scheme is also evaluated in the presence of feedback delays for robustness considerations.     

An effective network congestion control method for multilayer network

The congestion control problem in a single node network has been solved by the nonlinear feedback control method,which has been proven to be effective and robust for different router’s queue size.However,these control models are based on the single layer network architecture,and the senders and receivers are directly connected by one pair of routers.With the network architecture being more and more complex,it is a serious problem how to cooperate many routers working in the multilayer network simultaneously.In this paper,an effective Active Queue Management（AQM）scheme to guarantee the stability by the nonlinear control of imposing some restrictions on AQM parameter in multilayer network is proposed.The nonlinear control can rely on some heuristics and network traffic controllers that appear to be highly correlated with the multilayer network status.The proposed method is based on the improved classical Random Early Detection（RED）differential equation and a theorem for network congestion control.The theorem proposed in the paper proved that the stability of the fluid model can effectively ensure the convergence of the average rate to its equilibrium point through many routers in multilayer network.Moreover,when the network capacity is larger,the proposed scheme can still approach to the fullest extensibility of utilization and ensure the stability of the fluid model.The paper reveals the reasons of congestion control in multilayer network,provides a theorem for avoiding network congestion,and gives simulations to verify the results.     

Application of a new explicit‐rate ABR traffic controller

In broadband integrated communication systems, the classical method of max–min fair‐rate allocation for traffic control does not support the weighted‐rate guarantee. The weighted‐rate guarantee is necessary for available‐bit rate (ABR) service models. This fact motivates that the weighted max–min (WMM) fair‐rate allocation for the ABR traffic is widely studied. However, the combination of close‐loop feedback control with WMM algorithm has not appeared in the previous research. In this paper, a practical WMM fair‐rate allocation model is proposed. This scheduling scheme combines and integrates the congestion avoidance using proportional control (CAPC) and the weighted max–min fair‐rate allocation. This model is designed to achieve higher utilization and also bounded delay for ABR traffic flow control. In the system under analysis, the performance of this new weighted traffic scheduler is evaluated. The system presented in this paper is also compared with WMM and CAPC methods. Copyright © 2001 John Wiley & Sons, Ltd.     

A cross‐layer TCP for providing fairness in wireless mesh networks

The fair allocation of resources among different nodes is one of the critical problems in wireless mesh networks. Existing solutions mainly focus on rate‐limitation policies or distributed fair MAC schemes at the potential expense of total network utilization. This paper investigates a special starvation problem among TCP flows that are different hops away from the BS, as well as its recently proposed solution, the ‘Minimum Content Window’ policy based on IEEE 802.11e. It is found that the aggregate throughput degrades sharply because the effect of this policy on the TCP congestion mechanism has been overlooked. This paper proposes a priority‐based congestion control by using ‘Cross‐Layer Explicit Congestion Notification’. Analysis and simulation results demonstrate that our scheme can improve the fairness of TCP flows while the aggregate throughput is at least 20% higher than the ‘Minimum Content Window’ policy. Copyright © 2011 John Wiley & Sons, Ltd.     

Dynamic handover algorithm with interference cancellation in 5G networks for emergency communication

The integration of 5G networks with cognitive radio (CR) technology enables the software‐defined networking (SDN) infrastructure to support emergency applications. In future, CR can be integrated with 5G and many wireless networks like Wi‐Fi, WSN, and MANET for efficient spectrum utilization with higher data rate and lower latency. This CR technology allows unlicensed users to access the licensed spectrum, whenever it is free. In this paper, an efficient SDN architecture with cognitive ability for emergency network is proposed in which the SDN controller prolong communication between disaster victims and first responders and so the first responders can arrive at the spot directly and rescue the victims. The SDN controller has cognitive ability so that the victims can utilize the vacant licensed band to communicate with the first responders, thereby improving the spectrum utilization of the network. Another two main challenges during emergency are the occurrence of interference and link failure. The proposed dynamic handover algorithm with interference cancellation (DHAIC) cancels the interference between the nodes inside the network and performs dynamic handoff, whenever link failure occurs between the cluster head (CH) and the controller. An optimum throughput and minimal delay is achieved to ensure the network performance.     

Robust \mathcal{H}_{\infty} State Feedback Control of Networked Control Systems with Congestion Control

This paper examines the problem of robust state feedback control of networked control systems with a simple congestion control scheme. This simple congestion control scheme is based on comparing current measurements with last transmitted measurements. If their difference is less than a prescribed percentage of the current measurements then no measurement is transmitted to the controller. The controller always uses the last transmitted measurements to control the system. With this simple congestion control scheme, a robust $\mathcal {H}_{\infty}$ state feedback controller design methodology is developed based on the Lyapunov–Krasovskii functional approach. Sufficient conditions for the existence of delay mode dependent controllers are given in terms of bilinear matrix inequalities (BMIs). These BMIs are converted into quasi-convex linear matrix inequalities (LMIs) and solved by using the cone complementarity linearization algorithm. The effectiveness of the simple congestion control in terms of reducing the network bandwidth is elaborated using simulation examples.     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

A study on a receiver‐based management scheme of access link resources for QoS‐controllable TCP connections

Although the bandwidth of access networks is rapidly increasing with the latest techniques such as DSL and FTTH, the access link bandwidth remains a bottleneck, especially when users activate multiple network applications simultaneously. Furthermore, since the throughput of a standard TCP connection is dependent on various network parameters, including round‐trip time and packet loss ratio, the access link bandwidth is not shared among the network applications according to the user's demands. In this thesis, we present a new management scheme of access link resources for effective utilization of the access link bandwidth and control of the TCP connection's throughput. Our proposed scheme adjusts the total amount of the receive socket buffer assigned to TCP connections to avoid congestion at the access network, and assigns it to each TCP connection according to characteristics in consideration of QoS. The control objectives of our scheme are (1) to protect short‐lived TCP connections from the bandwidth occupation by long‐lived TCP connections, and (2) to differentiate the throughput of the long‐lived TCP connections according to the upper‐layer application's demands. One of the results obtained from the simulation experiments is that our proposed scheme can reduce the delay of short‐lived document transfer perceived by the receiver host by up to about 90%, while a high utilization of access link bandwidth is maintained. Copyright © 2006 John Wiley & Sons, Ltd.