國立虎尾科技大學 |

登入

回首頁

Analytical methods for network conge...

Low, Steven H.

Analytical methods for network congestion control /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Analytical methods for network congestion control // Steven H. Low.
作者:	Low, Steven H.
其他作者:	Srikant, R.
出版者:	[San Rafael, California] :Morgan & Claypool Publishers, : c2017. ,
面頁冊數:	xx, 193 p. :ill. (some col.) ; : 24 cm.;
標題:	System analysis - Mathematical models. -
ISBN:	1627057331 (pbk.) :

Analytical methods for network congestion control /
Low, Steven H.

Analytical methods for network congestion control /Steven H. Low. - [San Rafael, California] :Morgan & Claypool Publishers,c2017. - xx, 193 p. :ill. (some col.) ;24 cm. - Synthesis lectures on communication networks,#181935-4193 ;. - Synthesis lectures on communication networks ;# 14 .

Includes bibliographical references (p. 187-191)

The 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. Howare 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 projectionand 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 projecteddynamics that introduces discontinuity in our differentialequations. 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

ISBN: 1627057331 (pbk.) :NT1992Subjects--Topical Terms:

720410
System analysis
--Mathematical models.

LC Class. No.: TK5105.5485 / .L682 2017

Dewey Class. No.: 004.24

Analytical methods for network congestion control /
LDR:02541cam a2200229 a 4500 001 891200
005 20180302152500.0
008 180920s2017 caua b 000 0 eng d
020 $a 1627057331 (pbk.) : $c NT1992
020 $a 9781627057332 (pbk.)
035 $a (OCoLC)ocn995273860
035 $a 002147608
040 $a YDX $b eng $c NFU $d OCLCO $d TKU
041 0 $a eng
042 $a nbic
050 4 $a TK5105.5485 $b .L682 2017
082 0 4 $a 004.24 $2 23
100 1 $a Low, Steven H. $q (Steven Hwye) $3 1149439
245 1 0 $a Analytical methods for network congestion control / $c Steven H. Low.
260 $a [San Rafael, California] : $b Morgan & Claypool Publishers, $c c2017.
300 $a xx, 193 p. : $b ill. (some col.) ; $c 24 cm.
490 1 $a Synthesis lectures on communication networks, $x 1935-4193 ; $v #18
504 $a Includes bibliographical references (p. 187-191)
520 3 $a The 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. Howare 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 projectionand 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 projecteddynamics that introduces discontinuity in our differentialequations. 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
650 0 $a System analysis $x Mathematical models. $3 720410
650 0 $a Stability. $3 527666
650 0 $a Internet $x Management $x Data processing. $3 1149441
650 0 $a Computer networks $x Access control. $3 784848
700 1 $a Srikant, R. $3 1149440
830 0 $a Synthesis lectures on communication networks ; $v # 14 $3 931433