Hidden Clicker Hidden Clicker
首頁 > 館藏查詢 > 查詢結果 > 書目資料
後分類 X

目前查詢

歷史查詢

精確檢索

Analytical methods for network congestion control
切換:
  • 簡略
  • 詳細(MARC)
  • ISBD
  • 分享

Analytical methods for network congestion control

紀錄類型 : 書目-語言資料,印刷品: 單行本

作者 : LowSteven H.,

出版地 : [San Rafael, California]

出版者 : Morgan & Claypool Publishers;

出版年 : c2017.

面頁冊數 : xx, 193 p.ill. : 24 cm. ;

集叢名 : Synthesis lectures on communication networks#18

標題 : Computer networks - Access control -

標題 : Internet - Management -

標題 : Stability -

標題 : System analysis - Mathematical models -

摘要註 : 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 : 9781627057332

ISBN : 1627057331

LEADER 02635cam a2200277 450

001 210938

005 20180302152500.0

009 a(OCoLC)ocn995273860

009 vtls002147608

009 223775

010 1 $a9781627057332$bpbk.$dNT1756

010 1 $a1627057331$bpbk.

010 1 $z9781627055994$bebook

042 $anbic

100 $a20181012d2017 m y0engy09 b

101 0 $aeng

102 $aus

105 $aa a 000yy

200 1 $aAnalytical methods for network congestion control$fSteven H. Low.

210 $a[San Rafael, California]$dc2017.$cMorgan & Claypool Publishers

215 1 $axx, 193 p.$cill.$d24 cm.

225 2 $aSynthesis lectures on communication networks$v#18

320 $aIncludes bibliographical references (p. 187-191)

330 $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. 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

410 0$12001 $aSynthesis lectures on communication networks

606 $aComputer networks$xAccess control$2lc$3254687

606 $aInternet$xManagement$xData processing$2lc$3254688

606 $aStability$2lc$3254689

606 $aSystem analysis$xMathematical models$2lc$392271

676 $a004.24$v23

680 $aTK5105.5485$b.L682 2017

700 1$aLow$bSteven H.$gSteven Hwye$4author $3254686

Low, Steven H.

Analytical methods for network congestion control / Steven H. Low. - [San Rafael, California] : Morgan & Claypool Publishers, c2017.. - xx, 193 p. ; ill. ; 24 cm. . - (Synthesis lectures on communication networks ; #18 ).
Includes bibliographical references (p. 187-191) .
ISBN 9781627057332ISBN 1627057331
Computer networksInternetStabilitySystem analysis -- Access control -- Management -- Mathematical models
  • 館藏(1)
  • 心得(0)
  • 標籤
Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker Hidden Clicker