000			03681nam a2200409 i 4500
999			_c387644 _d387644
001			387644
003			ES-MaUEC
005			20230328183017.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2017 sz | o |||| 0|eng d
020			_a9783031792755
024	7		_a10.1007/978-3-031-79275-5 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTK5105.5 _b2017 EB
100	1		_aLow, Steven H. _q(Steven Hwye) _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687829
245	1	0	_aAnalytical Methods for Network Congestion Control _cby Steven Low
250			_a1st edition 2017
264		1	_aCham _bSpringer International Publishing _c2017
300			_a1 recurso en línea (XX, 193 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Learning Networks and Algorithms _x2690-4314
505	0		_aPreface -- Acknowledgments -- Notations -- Congestion Control Models -- Equilibrium Structure -- Global Stability: Lyapunov Method -- Global Stability: Passivity Method -- Global Stability: Gradient Projection Method -- Local Stability with Delay -- Bibliography -- Author's Biography.
520			_aThe congestion control mechanism has been responsible for maintaining stability as the Internet scaled up by many orders of magnitude in size, speed, traffic volume, coverage, and complexity over the last three decades. In this book, we develop a coherent theory of congestion control from the ground up to help understand and design these algorithms. We model network traffic as fluids that flow from sources to destinations and model congestion control algorithms as feedback dynamical systems. We show that the model is well defined. We characterize its equilibrium points and prove their stability. We will use several real protocols for illustration but the emphasis will be on various mathematical techniques for algorithm analysis. Specifically we are interested in four questions: 1. How are congestion control algorithms modelled? 2. Are the models well defined? 3. How are the equilibrium points of a congestion control model characterized? 4. How are the stability of these equilibrium points analyzed? For each topic, we first present analytical tools, from convex optimization, to control and dynamical systems, Lyapunov and Nyquist stability theorems, and to projection and contraction theorems. We then apply these basic tools to congestion control algorithms and rigorously prove their equilibrium and stability properties. A notable feature of this book is the careful treatment of projected dynamics that introduces discontinuity in our differential equations. Even though our development is carried out in the context of congestion control, the set of system theoretic tools employed and the process of understanding a physical system, building mathematical models, and analyzing these models for insights have a much wider applicability than to congestion control.
988			_aSynthesis Collection of Technology_2017
650		7	_2embne _9141354 _aRedes informáticas
650		7	_2embne _9138446 _aAnálisis de sistemas
776	0	8	_iPrinted edition: _z9783031792748
776	0	8	_iPrinted edition: _z9783031792762
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79275-5 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _eb _zSI