Design of ATM Networks Congestion Controller Based on the Virtual Queue

The single bottleneck node of ATM networks is considered. The virtual queue mechanism and the method of proportion-integral-differential(PID) control are adopted in the congestion control. The sufficient condition of the considered system’s stability is given. The method of determining the PID parameters is given further. To quicken the speed of startup and remove the congestion rapidly, the factors of increase and decrease are set according to the length of queue. The result of simulation shows that the system, given an appropriate group of parameters, can acquire good robustness and dynamic performance, and guarantees the quality of service at the same time.

An Adaptive Congestion Control Optimization Strategy in SDN-Based Data Centers

The traffic within data centers exhibits bursts and unpredictable patterns.This rapid growth in network traffic has two consequences:it surpasses the inherent capacity of the network’s link bandwidth and creates an imbalanced network load.Consequently,persistent overload situations eventually result in network congestion.The Software Defined Network(SDN)technology is employed in data centers as a network architecture to enhance performance.This paper introduces an adaptive congestion control strategy,named DA-DCTCP,for SDN-based Data Centers.It incorporates Explicit Congestion Notification(ECN)and Round-Trip Time(RTT)to establish congestion awareness and an ECN marking model.To mitigate incorrect congestion caused by abrupt flows,an appropriate ECN marking is selected based on the queue length and its growth slope,and the congestion window(CWND)is adjusted by calculating RTT.Simultaneously,the marking threshold for queue length is continuously adapted using the current queue length of the switch as a parameter to accommodate changes in data centers.The evaluation conducted through Mininet simulations demonstrates that DA-DCTCP yields advantages in terms of throughput,flow completion time(FCT),latency,and resistance against packet loss.These benefits contribute to reducing data center congestion,enhancing the stability of data transmission,and improving throughput.

Congestion Control Algorithms for the Internet-A Secondary Publication

In the last five years,there has been a V-shaped recovery in the number of papers on congestion control algorithms on the Internet.In this paper,congestion problems on the Internet are discussed,such as congestion collapse and bufferbloat from the perspective of the necessity of congestion control algorithms.The typical congestion control algorithms are introduced,and the research areas and methods of congestion control algorithms are described.Recent research trends and future prospects of congestion control algorithms are also presented.

Congestion Control Using In-Network Telemetry for Lossless Datacenters

In the Ethernet lossless Data Center Networks (DCNs) deployedwith Priority-based Flow Control (PFC), the head-of-line blocking problemis still difficult to prevent due to PFC triggering under burst trafficscenarios even with the existing congestion control solutions. To addressthe head-of-line blocking problem of PFC, we propose a new congestioncontrol mechanism. The key point of Congestion Control Using In-NetworkTelemetry for Lossless Datacenters (ICC) is to use In-Network Telemetry(INT) technology to obtain comprehensive congestion information, which isthen fed back to the sender to adjust the sending rate timely and accurately.It is possible to control congestion in time, converge to the target rate quickly,and maintain a near-zero queue length at the switch when using ICC. Weconducted Network Simulator-3 (NS-3) simulation experiments to test theICC’s performance. When compared to Congestion Control for Large-ScaleRDMA Deployments (DCQCN), TIMELY: RTT-based Congestion Controlfor the Datacenter (TIMELY), and Re-architecting Congestion Managementin Lossless Ethernet (PCN), ICC effectively reduces PFC pause messages andFlow Completion Time (FCT) by 47%, 56%, 34%, and 15.3×, 14.8×, and11.2×, respectively.

QoS-Aware Congestion Control with Online Learning

In emerging applications such as industrial control and autonomous driving,end-to-end deterministic quality of service(QoS)transmission guarantee has become an urgent problem to be solved.Internet congestion control algorithms are essential to the performance of applications.However,existing congestion control schemes follow the best-effort principle of data transmission without the perception of application QoS requirements.To enable data delivery within application QoS constraints,we leverage an online learning mechanism to design Crimson,a novel congestion control algorithm in which each sender continuously observes the gap between current performance and pre-defined QoS.Crimson can change rates adaptively that satisfy application QoS requirements as a result.Across many emulation environments and real-world experiments,our proposed scheme can efficiently balance the different trade-offs between throughput,delay and loss rate.Crimson also achieves consistent performance over a wide range of QoS constraints under diverse network scenarios.

Coupled CUBIC Congestion Control for MPTCP in Broadband Networks

Recently,multipath transmission control protocol(MPTCP)was standardized so that data can be transmitted through multiple paths to utilize all available path bandwidths.However,when high-speed long-distance networks are included in MPTCP paths,the traffic transmission performance of MPTCP is severely deteriorated,especially in case the multiple paths’characteristics are heavily asymmetric.In order to alleviate this problem,we propose a“Coupled CUBIC congestion control”that adopts TCP CUBIC on a large bandwidth-delay product(BDP)path in a linked increase manner for maintaining fairness with an ordinary TCP traversing the same bottleneck path.To verify the performance excellence of the proposed algorithm,we implemented the Coupled CUBIC Congestion Control into Linux kernels by modifying the legacy MPTCP linked-increases algorithm(LIA)congestion control source code.We constructed asymmetric heterogeneous network testbeds mixed with large and small BDP paths and compared the performances of LIA and Coupled CUBIC by experiments.Experimental results show that the proposed Coupled CUBIC utilizes almost over 80%of the bandwidth resource in the high BDP path,while the LIA utilizes only less than 20%of the bandwidth for the same path.It was confirmed that the resource utilization and traffic transmission performance have been greatly improved by using the proposed Coupled CUBIC in high-speed multipath networks,as well as maintaining MPTCP fairness with competing single-path CUBIC or Reno TCP flows.

Analysis and Taxonomy of Congestion Control Mechanisms for Internet Reliable Multicast

The research of congestion control for Internet reliable multicast is one of the most active fields in reliable multicast protocol research. Many reliable multicast congestion control mechanisms have been put forward. In this paper we present principal problems of congestion control for Internet reliable multicast, analyze solutions and difficulties of solving these problems, and then give a classification of some reliable multicast congestion control mechanisms. Lastly the future work is proposed.

Local Bifurcation Analysis of a Delayed Fractional-order Dynamic Model of Dual Congestion Control Algorithms

In this paper, we propose a delayed fractional-order congestion control model which is more accurate than the original integer-order model when depicting the dual congestion control algorithms. The presence of fractional orders requires the use of suitable criteria which usually make the analytical work so harder. Based on the stability theorems on delayed fractionalorder differential equations, we study the issue of the stability and bifurcations for such a model by choosing the communication delay as the bifurcation parameter. By analyzing the associated characteristic equation, some explicit conditions for the local stability of the equilibrium are given for the delayed fractionalorder model of congestion control algorithms. Moreover, the Hopf bifurcation conditions for general delayed fractional-order systems are proposed. The existence of Hopf bifurcations at the equilibrium is established. The critical values of the delay are identified, where the Hopf bifurcations occur and a family of oscillations bifurcate from the equilibrium. Same as the delay, the fractional order normally plays an important role in the dynamics of delayed fractional-order systems. It is found that the critical value of Hopf bifurcations is crucially dependent on the fractional order. Finally, numerical simulations are carried out to illustrate the main results. © 2017 Chinese Association of Automation.

Bifurcation and stability of an improved time-delayed fluid flow model in internet congestion control

Based on the fluid flow time-delayed model proposed by Misra et al in internet congestion control, one modified time-delayed model is presented, where the influence of the communication delay on the router queue length is investigated in detail. The main advantage of the new model is that its stability domain is larger even without an extra controller. By linear stability analysis and numerical simulation, tbe effectiveness and feasibility of the novel model in internet congestion control are verified.

Congestion aware routing algorithm for delay-disruption tolerance networks

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

Bursting-like motion induced by time-varying delay in an internet congestion control model

Time delay is an problem of intemet congestion important parameter in the control. According to some researches, time delay is not always constant and can be viewed as a periodic function of time for some cases. In this work, an internet congestion control model is consid- ered to study the time-varying delay induced bursting-like motion, which consists of a rapid oscillation burst and quies- cent steady state. Then, for the system with periodic delay of small amplitude and low frequency, the method of multiple scales is employed to obtain the amplitude of the oscillation. Based on the expression of the asymptotic solution, it can be found that the relative length of the steady state increases with amplitude of the variation of time delay and decreases with frequency of the variation of time delay. Finally, an effective method to control the bursting-like motion is pro- posed by introducing a periodic gain parameter with appropriate amplitude. Theoretical results are in agreement with that from numerical method.

End-to-end rate-based congestion control with random loss:convergence and stability

The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.

Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach

In this paper, based on the inherent characteristic of the contention relation between flows in ad hoc networks, we introduce the notion of the link＇s interference set, extend the utility maximization problem representing congestion control in wireline networks to ad hoc networks, apply the penalty function approach and the subgradient method to solve this problem, and propose the congestion control algorithm Penalty function-based Optical Congestion Control （POCC） which is implemented in NS2- simulator. Specifically, each link transmits periodically the information on its congestion state to its interference set; the set ; the sermon at each source adjusts the transmission rate based on the optimal tradeoffbetween the utility value and the congestion level which the interference set of the links that this session goes though suffers from. MATLAB-based simulation results showed that POCC can approach the globally optimal solution. The NS2-based simulation results showed that POCC outperforms default TCP and ATCP to achieve efficient and fair resource allocation in ad hoc networks.

Hybrid control of bifurcation and chaos in stroboscopic model of Internet congestion control system

Interaction between transmission control protocol （TCP） and random early detection （RED） gateway in the Internet congestion control system has been modelled as a discrete-time dynamic system which exhibits complex bifurcating and chaotic behaviours. In this paper, a hybrid control strategy using both state feedback and parameter perturbation is employed to control the bifurcation and stabilize the chaotic orbits embedded in this discrete-time dynamic system of TCP/RED. Theoretical analysis and numerical simulations show that the bifurcation is delayed and the chaotic orbits are stabilized to a fixed point, which reliably achieves a stable average queue size in an extended range of parameters and even completely eliminates the chaotic behaviour in a particular range of parameters. Therefore it is possible to decrease the sensitivity of RED to parameters. By using the hybrid strategy, we may improve the stability and performance of TCP/RED congestion control system significantly.

Congestion control scheme in ATM networks based on fast tracing-queue

One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate （ABR）. The dynamic controller is designed based on the control theory and the feedback mechanism of explicit rates With the given method of a chosen parameter, it can guarantee the stability of the controller and closed loop system with propagation delay and bandwidth oscillation. It needs less parameters（only one） to be designed. The queue length can converge to the given value in the least steps. The fairness of different connections is considered further. The simulations show better performance and good quality of service（QoS） is achieved.

CRSG:A congestion control routing algorithm for security defense based on social psychology and game theory in DTN

The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.

Burstiness-Aware Congestion Control Protocol for Wireless Sensor Networks

In monitoring Wireless Sensor Networks(WSNs),the traffic usually has bursty characteristics when an event occurs.Transient congestion would increase delay and packet loss rate severely,which greatly reduces network performance.To solve this problem,we propose a Burstiness-aware Congestion Control Protocol(BCCP) for wireless sensor networks.In BCCP,the backoff delay is adopted as a congestion indication.Normally,sensor nodes work on contention-based MAC protocol(such as CSMA/CA).However,when congestion occurs,localized TDMA instead of CSMA/CA is embedded into the nodes around the congestion area.Thus,the congestion nodes only deliver their data during their assigned slots to alleviate the contention-caused congestion.Finally,we implement BCCP in our sensor network testbed.The experiment results show that BCCP could detect area congestion in time,and improve the network performance significantly in terms of delay and packet loss rate.

Evolution of Road Traffic Congestion Control:A Survey from Perspective of Sensing,Communication,and Computation

Road traffic congestion can inevitably de-grade road infrastructure and decrease travel efficiency in urban traffic networks,which can be relieved by employing appropriate congestion control.Accord-ing to different developmental driving forces,in this paper,the evolution of road traffic congestion control is divided into two stages.The ever-growing num-ber of advanced sensing techniques can be seen as the key driving force of the first stage,called the sens-ing stage,in which congestion control strategies ex-perienced rapid growth owing to the accessibility of traffic data.At the second stage,i.e.,the communica-tion stage,communication and computation capabil-ity can be regarded as the identifying symbols for this stage,where the ability of collecting finer-grained in-sight into transportation and mobility reality improves dramatically with advances in vehicular networks,Big Data,and artificial intelligence.Specifically,as the pre-requisite for congestion control,in this paper,ex-isting congestion detection techniques are first elab-orated and classified.Then,a comprehensive survey of the recent advances for current congestion control strategies with a focus on traffic signal control,vehi-cle route guidance,and their combined techniques is provided.In this regard,the evolution of these strate-gies with continuous development of sensing,com-munication,and computation capability are also intro-duced.Finally,the paper concludes with several re-search challenges and trends to fully promote the in-tegration of advanced techniques for traffic congestion mitigation in transportation systems.

Congestion control algorithm in large-delay uncertain networks

Based on Smith-fuzzy controller, a new active queue management （AQM） algorithm adaptable to the large-delay uncertain networks is presented. It can compensate the negative impact on the queue stability caused by the large delay, and it also maintains strong robustness under the condition of dynamic network fluid. Its stability is proven through Lyapunov method. Simulation results demonstrated that this method enables the queue length to converge at a preset value quickly and keeps the queue oscillation small, the simulation results also show that the scheme is very robust to disturbance under various network conditions and large delay and, in particular, the algorithm proposed outperforms the conventional PI control and fuzzy control when the network parameters and network delay change.

Intelligent DoS Attack Detection with Congestion Control Technique for VANETs

VehicularAd hoc Network(VANET)has become an integral part of Intelligent Transportation Systems(ITS)in today’s life.VANET is a network that can be heavily scaled up with a number of vehicles and road side units that keep fluctuating in real world.VANET is susceptible to security issues,particularly DoS attacks,owing to maximum unpredictability in location.So,effective identification and the classification of attacks have become the major requirements for secure data transmission in VANET.At the same time,congestion control is also one of the key research problems in VANET which aims at minimizing the time expended on roads and calculating travel time as well as waiting time at intersections,for a traveler.With this motivation,the current research paper presents an intelligent DoS attack detection with Congestion Control(IDoS-CC)technique for VANET.The presented IDoSCC technique involves two-stage processes namely,Teaching and Learning Based Optimization(TLBO)-based Congestion Control(TLBO-CC)and Gated Recurrent Unit(GRU)-based DoS detection(GRU-DoSD).The goal of IDoS-CC technique is to reduce the level of congestion and detect the attacks that exist in the network.TLBO algorithm is also involved in IDoS-CC technique for optimization of the routes taken by vehicles via traffic signals and to minimize the congestion on a particular route instantaneously so as to assure minimal fuel utilization.TLBO is applied to avoid congestion on roadways.Besides,GRU-DoSD model is employed as a classification model to effectively discriminate the compromised and genuine vehicles in the network.The outcomes from a series of simulation analyses highlight the supremacy of the proposed IDoS-CC technique as it reduced the congestion and successfully identified the DoS attacks in network.