Open AccessReaching law‐based sliding mode congestion control for communication networks
Author(s) -
Bartoszewicz Andrzej,
Leśniewski Piotr
Publication year - 2014
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2014.0503
Subject(s) - bottleneck , control theory (sociology) , network congestion , bounded function , computer science , sliding mode control , transmission (telecommunications) , bandwidth (computing) , controller (irrigation) , mode (computer interface) , variable structure control , law , control (management) , mathematics , nonlinear system , computer network , network packet , telecommunications , physics , quantum mechanics , artificial intelligence , political science , operating system , mathematical analysis , agronomy , biology , embedded system
In this study, a new reaching law for sliding mode control of discrete time systems is proposed and applied to solve the problem of congestion avoidance in multi‐source, connection oriented data transmission networks. Since the proposed reaching law does not require switching of the sliding variable between positive and negative values in each successive control step, it leads to chattering free operation, does not cause overshoots and helps achieve 100% exploitation of the bottleneck link available bandwidth. Furthermore, the proposed controller always generates bounded data transmission rates. The rates are limited by design parameters and they do not depend on the network initial conditions. The properties of the proposed controller are stated as three theorems, formally proved and verified in a simulation example.