Analytical methods for network congestion control, Steven H. Low, (electronic book)

Resource Information

The instance Analytical methods for network congestion control, Steven H. Low, (electronic book) represents a material embodiment of a distinct intellectual or artistic creation found in University of Liverpool. This resource is a combination of several types including: Instance, Electronic.

Image

http://covers.openlibrary.org/b/isbn/9781627057332-M.jpg?default=false

Label

Analytical methods for network congestion control, Steven H. Low, (electronic book)

Medium

electronic book

Statement of responsibility

Steven H. Low

Instantiates

• Analytical methods for network congestion control

Publication

• San Rafael, California, Morgan & Claypool, 2017

Bibliography note

Includes bibliographical references (pages 187-191)

Carrier category

online resource

Carrier MARC source

rdacarrier

Color

multicolored

Content category

text

Content type MARC source

rdacontent

Contents

• 1. Congestion control models -- 1.1 Network model -- 1.2 Classical TCP/AQM protocols -- 1.2.1 Window-based congestion control -- 1.2.2 TCP algorithms -- 1.2.3 AQM algorithms -- 1.3 Models of classical algorithms -- 1.3.1 Reno/RED -- 1.3.2 Vegas/DropTail -- 1.3.3 FAST/DropTail -- 1.4 A general setup -- 1.4.1 The basic models -- 1.4.2 Limitations and extensions -- 1.5 Solution of the basic models -- 1.5.1 Existence and uniqueness theorems -- 1.5.2 Application to TCP/AQM models -- 1.5.3 Appendix: proof of lemma 1.3 -- 1.5.4 Appendix: proof of theorem 1.10 -- 1.6 Bibliographical notes -- 1.7 Problems --
• 2. Equilibrium structure -- 2.1 Convex optimization -- 2.1.1 Convex program -- 2.1.2 KKT theorem and duality -- 2.2 Network utility maximization -- 2.2.1 Example: Reno/RED -- 2.2.2 Examples: Vegas/DropTail; FAST/DropTail -- 2.2.3 Equilibrium of dual algorithms -- 2.2.4 Equilibrium of primal-dual algorithms -- 2.3 Implications of network utility maximization -- 2.3.1 TCP/AQM protocols -- 2.3.2 Utility function, throughput, and fairness -- 2.4 Appendix: existence of utility functions -- 2.5 Bibliographical notes -- 2.6 Problems --
• 3. Global stability: Lyapunov method -- 3.1 Lyapunov stability theorems -- 3.2 Stability of dual algorithms -- 3.3 Stability of primal-dual algorithms -- 3.4 Appendix: proof of lemma 3.10 -- 3.5 Bibliographical notes -- 3.6 Problems --
• 4. Global stability: passivity method -- 4.1 Passive systems -- 4.2 Feedback systems -- 4.3 Stability of primal algorithms -- 4.4 Stability of primal-dual algorithms -- 4.5 Bibliographical notes --
• 5. Global stability: gradient projection method -- 5.1 Convergence theorems -- 5.2 Stability of dual algorithms -- 5.3 Appendix: proof of lemma 5.2 -- 5.4 Appendix: proof of lemma 5.4 -- 5.5 Bibliographical notes --
• 6. Local stability with delay -- 6.1 Linear model with feedback delay -- 6.2 Nyquist stability theory -- 6.2.1 LTI systems, transfer functions, and realizations -- 6.2.2 Stability of LTI systems -- 6.2.3 Feedback systems and loop functions -- 6.2.4 Stability of closed-loop systems -- 6.2.5 Generalized Nyquist stability criterion -- 6.2.6 Unity feedback systems -- 6.3 Stability of primal algorithms -- 6.4 Stability of dual algorithms -- 6.5 Appendix: proof of theorem 6.14 -- 6.6 Bibliographical notes -- 6.7 Problems --
• Bibliography -- Author's biography

Control code

201705CNT018

Dimensions

unknown

Extent

1 PDF (xx, 193 pages)

File format

multiple file formats

Form of item

online

Isbn

9781627057332

Media category

electronic

Media MARC source

isbdmedia

Other control number

10.2200/S00778ED1V01Y201705CNT018

Other physical details

illustrations.

Record ID

b4412091

Reformatting quality

access

Specific material designation

remote

System details

System requirements: Adobe Acrobat Reader