Suboptimal RED feedback control for buffered TCP flow dynamics in computer network.

*(English)*Zbl 1169.68345Summary: We present an improved dynamical system that simulates the behavior of TCP flows and active queue management system. This system can be modeled by a set of stochastic differential equations driven by a doubly stochastic point process with intensities being the controls. The feedback laws proposed monitor the status of buffers and multiplexor of the router, detect incipient congestion by sending warning signals to the sources. The simulation results show that the optimal feedback control law from the class of linear as well as quadratic polynomials can improve the system performance significantly in terms of maximizing the link utilization, minimizing congestion, packet losses, as well as global synchronization. The optimization process used is based on random recursive search technique known as RRS.

##### MSC:

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

68M15 | Reliability, testing and fault tolerance of networks and computer systems |

##### References:

[1] | S. Floyd and V. Jacobson, “Random early detection gateways for congestion avoidance,” IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397-413, 1993. |

[2] | J. Chung and M. Claypool, “Analysis of active queue management,” in Proceedings of the 2nd IEEE International Symposium on Network Computing and Applications (NCA /03), pp. 359-366, Cambridge, Mass, USA, April 2003. |

[3] | N. U. Ahmed and C. Li, “Suboptimal feedback control of TCP flows in computer network using random early discard (RED) mechanism,” Mathematical Problems in Engineering, vol. 2005, no. 5, pp. 477-489, 2005. · Zbl 1200.68040 |

[4] | T. Ye and S. Kalyanaraman, “A recursive random search for optimizing network protocol parameters,” Tech. Rep., ECSE Department, Rensselaer Polytechnique Institute, Troy, NY, USA, December 2001. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.