000 06292cam a2200709Ii 4500
001 ocn918983951
003 OCoLC
005 20190328114812.0
006 m o d
007 cr cnu---unuuu
008 150820s2015 mau ob 001 0 eng d
010 _a 2015942015
040 _aN$T
_beng
_erda
_epn
_cN$T
_dIDEBK
_dN$T
_dYDXCP
_dCDX
_dCOO
_dUIU
_dOCLCF
_dUMI
_dEBLCP
_dDEBSZ
_dDEBBG
_dB24X7
_dD6H
_dZ5A
_dLIV
_dOCLCQ
_dMERUC
_dOCLCQ
_dWRM
_dU3W
_dCEF
_dOCLCQ
_dCDN
_dCUY
_dZCU
_dUAB
_dICG
_dVT2
_dDKC
019 _a920541009
_a923544990
_a929142574
_a966355713
_a1088988833
020 _a9780128036006
_q(electronic bk.)
020 _a0128036001
_q(electronic bk.)
020 _z9780128035832
020 _z0128035838
035 _a(OCoLC)918983951
_z(OCoLC)920541009
_z(OCoLC)923544990
_z(OCoLC)929142574
_z(OCoLC)966355713
_z(OCoLC)1088988833
050 4 _aTK5105.875.I57
072 7 _aCOM
_x013000
_2bisacsh
072 7 _aCOM
_x014000
_2bisacsh
072 7 _aCOM
_x018000
_2bisacsh
072 7 _aCOM
_x067000
_2bisacsh
072 7 _aCOM
_x032000
_2bisacsh
072 7 _aCOM
_x037000
_2bisacsh
072 7 _aCOM
_x052000
_2bisacsh
082 0 4 _a004.678
_223
100 1 _aVarma, Subir,
_eauthor.
245 1 0 _aInternet congestion control /
_h[electronic resource]
_cSubir Varma.
264 1 _aWaltham, MA :
_bMorgan Kaufmann, an imprint of Elsevier,
_c2015.
264 4 _c�2015
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
588 0 _aOnline resource; title from PDF title page (EBSCO, viewed August 21, 2015).
504 _aIncludes bibliographical references and index.
505 0 _a""Front Cover""; ""Internet Congestion Control""; ""Copyright Page""; ""Dedication""; ""Contents""; ""Preface""; ""About the Author""; ""Acknowledgments""; ""List of Abbreviations""; ""1 Introduction""; ""1.1 Introduction""; ""1.2 Basics of Congestion Control""; ""1.2.1 The Congestion Control Problem Definition""; ""1.2.2 Optimization Criteria for Congestion Control""; ""1.2.3 Optimality of Additive Increase Multiplicative Decrease Congestion Control""; ""1.2.4 Window-Based Congestion Control""; ""1.2.5 Rate-Based Congestion Control""; ""1.2.6 End-to-End versus Hop-by-Hop Congestion Control""
505 8 _a""1.2.7 Implicit versus Explicit Indication of Network Congestion""""1.3 Description of TCP Reno""; ""1.3.1 Basic TCP Windowing Operations""; ""1.3.2 Window Size Decrements, Part 1: Timer Operation and Timeouts""; ""1.3.3 Window Size Increments: Slow Start and Congestion Avoidance""; ""1.3.3.1 Slow Start""; ""1.3.3.2 Congestion Avoidance""; ""1.3.4 Window Size Decrements, Part 2: Fast Retransmit and Fast Recovery""; ""1.3.5 TCP New Reno""; ""1.3.6 TCP Reno and AIMD""; ""1.4 Network Feedback Techniques""; ""1.4.1 Passive Queue Management""; ""1.4.2 Active Queue Management (AQM)""
505 8 _a""1.5 Delay-Based Congestion Control: TCP Vegas""""1.6 Outline of the Rest of the Book""; ""1.7 Further Reading""; ""References""; ""1 Theory""; ""2 Analytic Modeling of Congestion Control""; ""2.1 Introduction""; ""2.2 TCP Throughput Analysis""; ""2.2.1 Throughput as a Function of Window Size""; ""2.2.2 Throughput as a Function of Buffer Size""; ""2.2.3 Throughput as a Function of Link Error Rate""; ""2.2.3.1 Link Errors Recovered by Duplicate ACKs""; ""2.2.3.2 Link Errors Recovered by Duplicate ACKs and Timeouts""; ""2.3 A Fluid Flow Model for Congestion Control""
505 8 _a""A General Procedure for Computing the Average Throughput""""2.3.1 Throughput for General Additive Increase/Multiplicative Decrease (AIMD) Congestion Control""; ""2.3.2 Differentiating Buffer Overflows from Link Errors""; ""2.4 A Stochastic Model for Congestion Control""; ""2.5 Why Does the Square-Root Formula Work Well?""; ""2.6 The Case of Multiple Parallel TCP Connections""; ""2.6.1 Homogeneous Case""; ""2.6.2 Heterogeneous Case""; ""2.7 Further Reading""; ""Appendix 2.A: Derivation of Q=min(1,3/E(W))""; ""References""; ""Suggested Reading""
505 8 _a""3 Optimization and Control Theoretic Analysis of Congestion Control""""3.1 Introduction""; ""3.2 Congestion Control Using Optimization Theory""; ""3.2.1 Utility Function for TCP Reno""; ""3.3 Generalized TCP�a�?Friendly Algorithms""; ""3.4 Stability Analysis of TCP with Active Queue Management""; ""3.4.1 The Addition of Controllers to the Mix""; ""3.4.1.1 Random Early Detection (RED) Controllers""; ""3.4.1.2 Proportional Controllers""; ""3.4.1.3 Proportional-Integral (PI) Controllers""; ""3.5 The Averaging Principle (AP)""; ""3.6 Implications for Congestion Control Algorithms""
520 _aInternet Congestion Control provides a description of some of the most important topics in the area of congestion control in computer networks, with special emphasis on the analytical modeling of congestion control algorithms. The field of congestion control has seen many notable advances in recent years and the purpose of this book, which is targeted towards the advanced and intermediate reader, is to inform about the most important developments in this area. The book should enable the reader to gain a good understanding of the application of congestion control theory to a number of applic.
650 0 _aInternet
_xTechnological innovations.
650 0 _aTCP/IP (Computer network protocol)
650 0 _aComputer algorithms.
650 7 _aCOMPUTERS
_xComputer Literacy.
_2bisacsh
650 7 _aCOMPUTERS
_xComputer Science.
_2bisacsh
650 7 _aCOMPUTERS
_xData Processing.
_2bisacsh
650 7 _aCOMPUTERS
_xHardware
_xGeneral.
_2bisacsh
650 7 _aCOMPUTERS
_xInformation Technology.
_2bisacsh
650 7 _aCOMPUTERS
_xMachine Theory.
_2bisacsh
650 7 _aCOMPUTERS
_xReference.
_2bisacsh
650 7 _aComputer algorithms.
_2fast
_0(OCoLC)fst00872010
650 7 _aInternet
_xTechnological innovations.
_2fast
_0(OCoLC)fst00977206
650 7 _aTCP/IP (Computer network protocol)
_2fast
_0(OCoLC)fst01141584
655 4 _aElectronic books.
655 7 _aElectronic books.
_2lcgft
776 0 8 _iPrint version:
_aVarma, Subir.
_tInternet Congestion Control.
_d: Elsevier Science, �2015
_z9780128035832
856 4 0 _3ScienceDirect
_uhttp://www.sciencedirect.com/science/book/9780128035832
999 _c247139
_d247139