corpsber.blogg.se

Finite state automata congestion control
Finite state automata congestion control











finite state automata congestion control

The stability analysis can be applied to various TCP/AQM systems other than FAST TCP/DropTail and TCP/AVQ. The primal-dual algorithm has been analyzed from the multivariable time-delay control theory standpoint in. analyzed the TCP/RED model from a time-delay control theory standpoint, and the time-delayed control analyzing techniques explored can be extended to other AQM or AQM-based schemes for their stability analysis. proposed a congestion control scheme composed of source and link algorithms. In, considering the limited input of the TCP network system, an AQM algorithm is presented on the strength of the sliding-mode control method, which makes the system obtain better asymptotic stability. An AQM algorithm is presented on the strength of the fuzzy sliding-mode control method in the nonlinear control method in, which improves the control effect of the system.

finite state automata congestion control

Based on the above model, many researchers have combined control theory to design several congestion schemes, such as P and PI, PD, and PID. proposed a nonlinear model of TCP/AQM in 2000. The first algorithm is named as random early detection (RED), but RED and its improved algorithms are too complicated for parameter configuration.

FINITE STATE AUTOMATA CONGESTION CONTROL FULL

It can drop or mark some packets before the router generates a full queue state, so that the TCP source can timely sense the network congestion state and take corresponding measures. After that, some scholars have proposed a solution called AQM, which is one of the most widely studied congestion solutions at present.

finite state automata congestion control

However, with the increasing demand of application and the improvement of service quality, the TCP congestion control mechanism of end-to-end is no longer suitable. Since Jacobson proposed the end-to-end TCP congestion control algorithm in 1988, many scholars have conducted more in-depth and detailed research, such as Vegas, Sack, and New Reno, and they all concentrate on end-to-end congestion control based on the end system. It is of great significance to maintain the stability and robustness of the TCP network. TCP congestion control can not only ward off network collapse and avert locking behavior, but also effectively reduce the probability of control loop synchronization. However, the congestion of network traffic has become a critical problem in network control. Recently, the communication network based on TCP has been rapidly developed and widely used. At last, the simulation results show that the control strategy is effective. This controller guarantees that the queue length tracks the desired queue in finite-time, and it is semiglobally practical finite-time stable (SGPFS) for all the signals of the closed-loop system. A finite-time congestion controller is designed by the backstepping technique and the adaptive neural control method. The issue of adaptive practical finite-time (FT) congestion control for the transmission control protocol/active queue management (TCP/AQM) network with unknown hysteresis and external disturbance is considered in this paper.













Finite state automata congestion control