A decentralized routing control scheme for data communication networks (Q474467)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A decentralized routing control scheme for data communication networks |
scientific article; zbMATH DE number 6372883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decentralized routing control scheme for data communication networks |
scientific article; zbMATH DE number 6372883 |
Statements
A decentralized routing control scheme for data communication networks (English)
0 references
24 November 2014
0 references
Summary: This paper studies the decentralized routing control of data communication networks. Taking the physical constraints on the data flow and the network-induced delays into consideration, the decentralized routing control problem is reformulated as a constrained control problem, and the restriction of initial message lengths is no longer needed. By defining a general Lyapunov functional and applying a reciprocally convex combination technique to deal with the network-induced delays, less conservative and less complex designing conditions are obtained in terms of linear matrix inequalities (LMIs). A simulation example is also given to illustrate the effectiveness of the proposed designing scheme.
0 references
0 references
0.853244423866272
0 references
0.8489363789558411
0 references
0.8020066618919373
0 references
0.7783713340759277
0 references