Analytical Methods for Network Congestion Control (Record no. 85227)

000 -LEADER
fixed length control field 04075nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-79275-5
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730164024.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2017 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031792755
-- 978-3-031-79275-5
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Low, Steven H.
245 10 - TITLE STATEMENT
Title Analytical Methods for Network Congestion Control
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2017.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XX, 193 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Learning, Networks, and Algorithms,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Preface -- 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 ## - SUMMARY, ETC.
Summary, etc 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. 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.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-79275-5
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2017.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cooperating objects (Computer systems).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming languages (Electronic computers).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Telecommunication.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cyber-Physical Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming Language.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Communications Engineering, Networks.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2690-4314
912 ## -
-- ZDB-2-SXSC

No items available.