## Application of Finite-Time Stability Concepts to the Control of ATM Networks

dc.contributor.author | Abdallah, Chaouki T. | |

dc.contributor.author | Amato, F. | |

dc.contributor.author | Ariola, M. | |

dc.contributor.author | Cosentino, C. | |

dc.date.accessioned | 2012-03-30T21:17:38Z | |

dc.date.available | 2012-03-30T21:17:38Z | |

dc.date.issued | 2012-03-30 | |

dc.identifier.uri | http://hdl.handle.net/1928/20305 | |

dc.description | Pre-Print | en_US |

dc.description.abstract | When dealing with the stability of a system, a distinction should be made between classical Lyapunov Stability and Finite-Time Stability (FTS) (or Short-Time Stability). The concept of Lyapunov Asymptotic Stability is largely known to the control community; on the other hand a system is said to be finite-time stable if, once we fix a time-interval, its state does not exceeds some bounds during this time-interval. Often asymptotic stability is enough for practical applications, but there are some cases where large values of the state are not acceptable, for instance in the presence of saturations. In these cases, we need to check that these unacceptable values are not attained by the state; for these purposes FTS could be used. Some early results on FTS can be found in [9], [12] and [8]; more recently the concept of FTS has been revisited in the light of recent results coming from Linear Matrix Inequalities (LMIs) theory, which has allowed to find less conservative conditions guaranteeing FTS and finite time stabilization of uncertain, linear continuous-time systems (see [3]). In this note we consider the problem of applying some sufficient conditions for finite time stabilization to design the control algorithm of an ATM network described via a discrete-time system. The extended abstract is organized as follows: in Section 2 we provide a sufficient condition for finite time stabilization of a discrete time system; in Section 3 we detail the model of an ATM network; finally in Section 4 some concluding remarks and plans for the final version of the paper are given. | en_US |

dc.description.sponsorship | PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING, 40(2): 1071-1079 | en_US |

dc.language.iso | en_US | en_US |

dc.title | Application of Finite-Time Stability Concepts to the Control of ATM Networks | en_US |

dc.type | Article | en_US |

dc.data.json | { "@context": { "rdf": "http://www.w3.org/1999/02/22-rdf-syntax-ns#", "rdfs": "http://www.w3.org/2000/01/rdf-schema#", "xsd": "http://www.w3.org/2001/XMLSchema#" }, "@graph": [ { "@id": "http://54.191.234.158/entities/resource/Amato_F.", "@type": "http://schema.org/Person" }, { "@id": "http://54.191.234.158/entities/resource/Abdallah_Chaouki_T.", "@type": "http://schema.org/Person" }, { "@id": "http://54.191.234.158/entities/resource/Cosentino_C.", "@type": "http://schema.org/Person" }, { "@id": "http://54.191.234.158/entities/resource/Ariola_M.", "@type": "http://schema.org/Person" }, { "@id": "http://hdl.handle.net/1928/282", "@type": "http://schema.org/WebSite" }, { "@id": "http://hdl.handle.net/1928/20305", "@type": "http://schema.org/CreativeWork", "http://schema.org/author": [ { "@id": "http://54.191.234.158/entities/resource/Abdallah_Chaouki_T." }, { "@id": "http://54.191.234.158/entities/resource/Ariola_M." }, { "@id": "http://54.191.234.158/entities/resource/Amato_F." }, { "@id": "http://54.191.234.158/entities/resource/Cosentino_C." } ], "http://schema.org/datePublished": "2012-03-30", "http://schema.org/description": [ "When dealing with the stability of a system, a distinction should be made between classical Lyapunov Stability and Finite-Time Stability (FTS) (or Short-Time Stability). The concept of Lyapunov Asymptotic Stability is largely known to the control community; on the other hand a system is said to be finite-time stable if, once we fix a time-interval, its state does not exceeds some bounds during this time-interval. Often asymptotic stability is enough for practical applications, but there are some cases where large values of the state are not acceptable, for instance in the presence of saturations. In these cases, we need to check that these unacceptable values are not attained by the state; for these purposes FTS could be used. Some early results on FTS can be found in [9], [12] and [8]; more recently the concept of FTS has been revisited in the light of recent results coming from Linear Matrix Inequalities (LMIs) theory, which has allowed to find less conservative conditions guaranteeing FTS and finite time stabilization of uncertain, linear continuous-time systems (see [3]). In this note we consider the problem of applying some sufficient conditions for finite time stabilization to design the control algorithm of an ATM network described via a discrete-time system. The extended abstract is organized as follows: in Section 2 we provide a sufficient condition for finite time stabilization of a discrete time system; in Section 3 we detail the model of an ATM network; finally in Section 4 some concluding remarks and plans for the final version of the paper are given.", "Pre-Print" ], "http://schema.org/inLanguage": "en_US", "http://schema.org/isPartOf": { "@id": "http://hdl.handle.net/1928/282" }, "http://schema.org/name": "Application of Finite-Time Stability Concepts to the Control of ATM Networks" } ]} |