Premium
Feedback control of congestion in packet switching networks: the case of multiple congested nodes
Author(s) -
Benmohamed Lotfi,
Meerkov Semyon M.
Publication year - 1997
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/(sici)1099-1131(199709/10)10:5<227::aid-dac341>3.0.co;2-u
Subject(s) - computer science , controller (irrigation) , network congestion , network packet , generalization , control theory (sociology) , node (physics) , computer network , control (management) , mathematics , artificial intelligence , mathematical analysis , structural engineering , agronomy , biology , engineering
In this paper, an analytical method for the design of a congestion control scheme in packet switching networks is presented. This scheme is particularly suitable for implementation in ATM switches, for the support of the available bit rate (ABR) service in ATM networks. The control architecture is rate‐based with a local feedback controller associated with each switching node. The controller itself is a generalization of the standard proportional‐plus‐derivative controller, with the difference that extra higher‐order derivative terms are involved to accommodate the delay present in high‐speed networks. It is shown that, under the specific service discipline introduced here, there exists a set of control gains that result in asymptotic stability of the linearized network model. A method for calculating these gains is given. In addition, it is shown that the resulting steady state rate allocation possesses the so‐called max‐min fairness property. The theoretical results are illustrated by a simulation example, where it is shown that the controller designed, using the methods developed here, works well for both the service discipline introduced in this paper and for the standard FCFS scheme. © 1997 John Wiley & Sons, Ltd.