Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Engineering Internet QoS / / Sanjay Jha, Mahbub Hassan
| Engineering Internet QoS / / Sanjay Jha, Mahbub Hassan |
| Autore | Jha Sanjay |
| Pubbl/distr/stampa | Boston : , : Artech House, , ©2002 |
| Descrizione fisica | 1 online resource (346 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) | HassanMahbub |
| Collana | Artech House telecommunications library |
| Soggetto topico |
Internet - Evaluation
Telecommunication - Traffic - Management Quality control |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-58053-566-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Vii; Preface xv; 1 Introduction 1; 1.1 QoS Framework 1; 1.2 Video-Conferencing System 5; 1.3 Overview of Audio-Video Compression Techniques 6; 1.4 End-System Considerations 9; 1.5 Operating-System Approach 10; 1.6 Overview of Networking and Media Technologies 11; 1.7 End-to-End QoS in the Internet 13; 1.8 Supporting QoS in Best-Effort Networks 14; 1.9 Application-Level Adaptation 16; 1.10 Real-Time Protocol 20; 1.11 Real-Time Control Protocol 22; 1.12 Summary 26; 2 QoS Fundamentals 31; 2.1 Traffic Description 31; 2.2 QoS Specification and Contract 34; 2.3 QoS Signaling 34. |
| Record Nr. | UNINA-9910456061403321 |
Jha Sanjay
|
||
| Boston : , : Artech House, , ©2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Engineering Internet QoS / / Sanjay Jha, Mahbub Hassan
| Engineering Internet QoS / / Sanjay Jha, Mahbub Hassan |
| Autore | Jha Sanjay |
| Pubbl/distr/stampa | Boston : , : Artech House, , ©2002 |
| Descrizione fisica | 1 online resource (346 p.) |
| Disciplina | 004.6 |
| Altri autori (Persone) | HassanMahbub |
| Collana | Artech House telecommunications library |
| Soggetto topico |
Internet - Evaluation
Telecommunication - Traffic - Management Quality control |
| ISBN | 1-58053-566-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Table of Contents -- Intro -- Contents -- Preface -- 1 Introduction -- 2 QoS Fundamentals -- 3 Scheduling for QoS Management -- 4 TCP/IP and Queue Management -- 5 Integrated Services Packet Network -- 6 Resource Reservation Protocol -- 7 IP Differentiated Services Network -- 8 Policy-Based QoS Management -- 9 ATM QoS -- 10 Multiprotocol Label Switching -- 11 QoS in Mobile Wireless Networks -- 12 Future -- About the Authors -- Index. |
| Record Nr. | UNINA-9910780270203321 |
|
Jha Sanjay
|
||
| Boston : , : Artech House, , ©2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
GMPLS [electronic resource] : architecture and applications / Adrian Farrel, Igor Bryskin
| GMPLS [electronic resource] : architecture and applications / Adrian Farrel, Igor Bryskin |
| Autore | Farrel, Adrian |
| Pubbl/distr/stampa | San Francisco : Elsevier/Morgan Kaufman, c2006 |
| Descrizione fisica | xxiii, 412 p. : ill. ; 24 cm. |
| Disciplina | 004.67/8 |
| Altri autori (Persone) | Bryskin, Igor.author |
| Soggetto topico |
Internet
Computer networks - Management Telecommunication - Traffic - Management |
| Soggetto genere / forma | Electronic books. |
| ISBN |
9780120884223
0120884224 |
| Formato | Risorse elettroniche  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contents -- Preface -- Chapter 1: Generalized Multiprotocol Label Switching -- Chapter 2: Transport Networks -- Chapter 3: From MPLS To GMPLS -- Chapter 4: GMPLS Signaling -- Chapter 5: GMPLS Routing -- Chapter 6: Link Management -- Chapter 7: Resource Management -- Chapter 8: GMPLS and Service Recovery -- Chapter 9: GMPLS and Traffic Engineering -- Chapter 10: GMPLS and Path Computation -- Chapter 11: Constraint Based Path Computation -- Chapter 12: Emerging Applications -- Chapter 13: Architectural Models -- Chapter 14: Provisioning Systems -- Chapter 15: GMPLS MIB Modules -- Glossary -- Index. |
| Record Nr. | UNISALENTO-991003243399707536 |
|
Farrel, Adrian
|
||
| San Francisco : Elsevier/Morgan Kaufman, c2006 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Influenza pandemic [[electronic resource] ] : key securities market participants are making progress, but agencies could do more to address potential internet congestion and encourage readiness : report to congressional requesters
| Influenza pandemic [[electronic resource] ] : key securities market participants are making progress, but agencies could do more to address potential internet congestion and encourage readiness : report to congressional requesters |
| Pubbl/distr/stampa | [Washington, D.C.] : , : U.S. Govt. Accountability Office, , [2009] |
| Descrizione fisica | 1 online resource (iii, 71 pages) : illustrations, map |
| Soggetto topico |
Securities industry - United States
Emergency management - United States - Computer network resources Internet - Planning Telecommunication - Traffic - Management |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Influenza pandemic |
| Record Nr. | UNINA-9910696903803321 |
| [Washington, D.C.] : , : U.S. Govt. Accountability Office, , [2009] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet congestion control / / Subir Varma
| Internet congestion control / / Subir Varma |
| Autore | Varma Subir |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Waltham, MA : , : Elsevier Science, , [2015] |
| Descrizione fisica | 1 online resource (287 p.) |
| Disciplina | 004.6 |
| Soggetto topico |
Internet
Telecommunication - Traffic - Management |
| ISBN | 0-12-803600-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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; 1.2.7 Implicit versus Explicit Indication of Network Congestion
1.3 Description of TCP Reno1.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); 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 Control2.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; 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 Errors2.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; 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-Friendly Algorithms 3.4 Stability Analysis of TCP with Active Queue Management3.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; 3.7 Further Reading; Appendix 3.A: Linearization of the Fluid Flow Model; Appendix 3.B: The Nyquist Stability Criterion; Appendix 3.C: Transfer Function for the RED Controller; Appendix 3.D: Convex Optimization Theory; Appendix 3.E: A General Class of Utility Functions References |
| Record Nr. | UNINA-9910797586703321 |
|
Varma Subir
|
||
| Waltham, MA : , : Elsevier Science, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet congestion control / / Subir Varma
| Internet congestion control / / Subir Varma |
| Autore | Varma Subir |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Waltham, MA : , : Elsevier Science, , [2015] |
| Descrizione fisica | 1 online resource (287 p.) |
| Disciplina | 004.6 |
| Soggetto topico |
Internet
Telecommunication - Traffic - Management |
| ISBN | 0-12-803600-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
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; 1.2.7 Implicit versus Explicit Indication of Network Congestion
1.3 Description of TCP Reno1.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); 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 Control2.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; 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 Errors2.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; 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-Friendly Algorithms 3.4 Stability Analysis of TCP with Active Queue Management3.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; 3.7 Further Reading; Appendix 3.A: Linearization of the Fluid Flow Model; Appendix 3.B: The Nyquist Stability Criterion; Appendix 3.C: Transfer Function for the RED Controller; Appendix 3.D: Convex Optimization Theory; Appendix 3.E: A General Class of Utility Functions References |
| Record Nr. | UNINA-9910827317303321 |
|
Varma Subir
|
||
| Waltham, MA : , : Elsevier Science, , [2015] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet QoS [electronic resource] : architectures and mechanisms for quality of service / Zheng Wang
| Internet QoS [electronic resource] : architectures and mechanisms for quality of service / Zheng Wang |
| Autore | Wang, Zheng |
| Pubbl/distr/stampa | San Francisco : Morgan Kaufmann, c2001 |
| Descrizione fisica | xv, 239 p. : ill. ; 25 cm. |
| Disciplina | 004.67 |
| Soggetto topico |
Internet - Evaluation
Telecommunication - Traffic - Management |
| Soggetto genere / forma | Electronic books. |
| ISBN |
9781558606081
1558606084 |
| Formato | Risorse elettroniche |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 The Big Picture -- 2 Integrated Services -- 3 Differentiated Services -- 4 Multiprotocol Label Switching -- 5 Internet Traffic Engineering. |
| Record Nr. | UNISALENTO-991003248169707536 |
|
Wang, Zheng
|
||
| San Francisco : Morgan Kaufmann, c2001 | ||
| Risorse elettroniche | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Network congestion control [[electronic resource] ] : managing Internet traffic / / Michael Welzl
| Network congestion control [[electronic resource] ] : managing Internet traffic / / Michael Welzl |
| Autore | Welzl Michael <1973-> |
| Pubbl/distr/stampa | Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 |
| Descrizione fisica | 1 online resource (283 p.) |
| Disciplina |
004.67/8
004.678 |
| Collana | Wiley Series on Communications Networking & Distributed Systems |
| Soggetto topico |
Internet
Telecommunication - Traffic - Management |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-28759-4
9786610287598 0-470-02531-X 0-470-02529-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Network Congestion Control; Contents; Foreword; Preface; List of Tables; List of Figures; 1 Introduction; 1.1 Who should read this book?; 1.2 Contents; 1.3 Structure; 1.3.1 Reader's guide; 2 Congestion control principles; 2.1 What is congestion?; 2.1.1 Overprovisioning or control?; 2.2 Congestion collapse; 2.3 Controlling congestion: design considerations; 2.3.1 Closed-loop versus open-loop control; 2.3.2 Congestion control and flow control; 2.4 Implicit feedback; 2.5 Source behaviour with binary feedback; 2.5.1 MIMD, AIAD, AIMD and MIAD; 2.6 Stability; 2.6.1 Control theoretic modelling
2.6.2 Heterogeneous RTTs2.6.3 The conservation of packets principle; 2.7 Rate-based versus window-based control; 2.8 RTT estimation; 2.9 Traffic phase effects; 2.9.1 Phase effects in daily life; 2.10 Queue management; 2.10.1 Choosing the right queue length; 2.10.2 Active queue management; 2.11 Scalability; 2.11.1 The end-to-end argument; 2.11.2 Other scalability hazards; 2.12 Explicit feedback; 2.12.1 Explicit congestion notification; 2.12.2 Precise feedback; 2.13 Special environments; 2.14 Congestion control and OSI layers; 2.14.1 Circuits as a hindrance; 2.15 Multicast congestion control 2.15.1 Problems2.15.2 Sender- and receiver-based schemes; 2.16 Incentive issues; 2.16.1 Tragedy of the commons; 2.16.2 Game theory; 2.16.3 Congestion pricing; 2.17 Fairness; 2.17.1 Max-min fairness; 2.17.2 Utility functions; 2.17.3 Proportional fairness; 2.17.4 TCP friendliness; 2.18 Conclusion; 3 Present technology; 3.1 Introducing TCP; 3.1.1 Basic functions; 3.1.2 Connection handling; 3.1.3 Flow control: the sliding window; 3.1.4 Reliability: timeouts and retransmission; 3.2 TCP window management; 3.2.1 Silly window syndrome; 3.2.2 SWS avoidance; 3.2.3 Delayed ACKs 3.2.4 The Nagle algorithm3.3 TCP RTO calculation; 3.3.1 Ignoring ACKs from retransmissions; 3.3.2 Not ignoring ACKs from retransmissions; 3.3.3 Updating RTO calculation; 3.4 TCP congestion control and reliability; 3.4.1 Slow start and congestion avoidance; 3.4.2 Combining the algorithms; 3.4.3 Design rationales and deployment considerations; 3.4.4 Interactions with other window-management algorithms; 3.4.5 Fast retransmit and fast recovery; 3.4.6 Multiple losses from a single window; 3.4.7 NewReno; 3.4.8 Selective Acknowledgements (SACK); 3.4.9 Explicit Congestion Notification (ECN) 3.5 Concluding remarks about TCP3.6 The Stream Control Transmission Protocol (SCTP); 3.7 Random Early Detection (RED); 3.8 The ATM 'Available Bit Rate' service; 3.8.1 Explicit rate calculation; 3.8.2 TCP over ATM; 4 Experimental enhancements; 4.1 Ensuring appropriate TCP behaviour; 4.1.1 Appropriate byte counting; 4.1.2 Limited slow start; 4.1.3 Congestion window validation; 4.1.4 Robust ECN signalling; 4.1.5 Spurious timeouts; 4.1.6 Reordering; 4.1.7 Corruption; 4.2 Maintaining congestion state; 4.2.1 TCP Control Block Interdependence; 4.2.2 The Congestion Manager; 4.2.3 MulTCP 4.3 Transparent TCP improvements |
| Record Nr. | UNINA-9910143583603321 |
|
Welzl Michael <1973->
|
||
| Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network congestion control [[electronic resource] ] : managing Internet traffic / / Michael Welzl
| Network congestion control [[electronic resource] ] : managing Internet traffic / / Michael Welzl |
| Autore | Welzl Michael <1973-> |
| Pubbl/distr/stampa | Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 |
| Descrizione fisica | 1 online resource (283 p.) |
| Disciplina |
004.67/8
004.678 |
| Collana | Wiley Series on Communications Networking & Distributed Systems |
| Soggetto topico |
Internet
Telecommunication - Traffic - Management |
| ISBN |
1-280-28759-4
9786610287598 0-470-02531-X 0-470-02529-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Network Congestion Control; Contents; Foreword; Preface; List of Tables; List of Figures; 1 Introduction; 1.1 Who should read this book?; 1.2 Contents; 1.3 Structure; 1.3.1 Reader's guide; 2 Congestion control principles; 2.1 What is congestion?; 2.1.1 Overprovisioning or control?; 2.2 Congestion collapse; 2.3 Controlling congestion: design considerations; 2.3.1 Closed-loop versus open-loop control; 2.3.2 Congestion control and flow control; 2.4 Implicit feedback; 2.5 Source behaviour with binary feedback; 2.5.1 MIMD, AIAD, AIMD and MIAD; 2.6 Stability; 2.6.1 Control theoretic modelling
2.6.2 Heterogeneous RTTs2.6.3 The conservation of packets principle; 2.7 Rate-based versus window-based control; 2.8 RTT estimation; 2.9 Traffic phase effects; 2.9.1 Phase effects in daily life; 2.10 Queue management; 2.10.1 Choosing the right queue length; 2.10.2 Active queue management; 2.11 Scalability; 2.11.1 The end-to-end argument; 2.11.2 Other scalability hazards; 2.12 Explicit feedback; 2.12.1 Explicit congestion notification; 2.12.2 Precise feedback; 2.13 Special environments; 2.14 Congestion control and OSI layers; 2.14.1 Circuits as a hindrance; 2.15 Multicast congestion control 2.15.1 Problems2.15.2 Sender- and receiver-based schemes; 2.16 Incentive issues; 2.16.1 Tragedy of the commons; 2.16.2 Game theory; 2.16.3 Congestion pricing; 2.17 Fairness; 2.17.1 Max-min fairness; 2.17.2 Utility functions; 2.17.3 Proportional fairness; 2.17.4 TCP friendliness; 2.18 Conclusion; 3 Present technology; 3.1 Introducing TCP; 3.1.1 Basic functions; 3.1.2 Connection handling; 3.1.3 Flow control: the sliding window; 3.1.4 Reliability: timeouts and retransmission; 3.2 TCP window management; 3.2.1 Silly window syndrome; 3.2.2 SWS avoidance; 3.2.3 Delayed ACKs 3.2.4 The Nagle algorithm3.3 TCP RTO calculation; 3.3.1 Ignoring ACKs from retransmissions; 3.3.2 Not ignoring ACKs from retransmissions; 3.3.3 Updating RTO calculation; 3.4 TCP congestion control and reliability; 3.4.1 Slow start and congestion avoidance; 3.4.2 Combining the algorithms; 3.4.3 Design rationales and deployment considerations; 3.4.4 Interactions with other window-management algorithms; 3.4.5 Fast retransmit and fast recovery; 3.4.6 Multiple losses from a single window; 3.4.7 NewReno; 3.4.8 Selective Acknowledgements (SACK); 3.4.9 Explicit Congestion Notification (ECN) 3.5 Concluding remarks about TCP3.6 The Stream Control Transmission Protocol (SCTP); 3.7 Random Early Detection (RED); 3.8 The ATM 'Available Bit Rate' service; 3.8.1 Explicit rate calculation; 3.8.2 TCP over ATM; 4 Experimental enhancements; 4.1 Ensuring appropriate TCP behaviour; 4.1.1 Appropriate byte counting; 4.1.2 Limited slow start; 4.1.3 Congestion window validation; 4.1.4 Robust ECN signalling; 4.1.5 Spurious timeouts; 4.1.6 Reordering; 4.1.7 Corruption; 4.2 Maintaining congestion state; 4.2.1 TCP Control Block Interdependence; 4.2.2 The Congestion Manager; 4.2.3 MulTCP 4.3 Transparent TCP improvements |
| Record Nr. | UNINA-9910830492603321 |
|
Welzl Michael <1973->
|
||
| Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Network congestion control : managing Internet traffic / / Michael Welzl
| Network congestion control : managing Internet traffic / / Michael Welzl |
| Autore | Welzl Michael <1973-> |
| Pubbl/distr/stampa | Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 |
| Descrizione fisica | 1 online resource (283 p.) |
| Disciplina | 004.67/8 |
| Collana | Wiley Series on Communications Networking & Distributed Systems |
| Soggetto topico |
Internet
Telecommunication - Traffic - Management |
| ISBN |
1-280-28759-4
9786610287598 0-470-02531-X 0-470-02529-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Network Congestion Control; Contents; Foreword; Preface; List of Tables; List of Figures; 1 Introduction; 1.1 Who should read this book?; 1.2 Contents; 1.3 Structure; 1.3.1 Reader's guide; 2 Congestion control principles; 2.1 What is congestion?; 2.1.1 Overprovisioning or control?; 2.2 Congestion collapse; 2.3 Controlling congestion: design considerations; 2.3.1 Closed-loop versus open-loop control; 2.3.2 Congestion control and flow control; 2.4 Implicit feedback; 2.5 Source behaviour with binary feedback; 2.5.1 MIMD, AIAD, AIMD and MIAD; 2.6 Stability; 2.6.1 Control theoretic modelling
2.6.2 Heterogeneous RTTs2.6.3 The conservation of packets principle; 2.7 Rate-based versus window-based control; 2.8 RTT estimation; 2.9 Traffic phase effects; 2.9.1 Phase effects in daily life; 2.10 Queue management; 2.10.1 Choosing the right queue length; 2.10.2 Active queue management; 2.11 Scalability; 2.11.1 The end-to-end argument; 2.11.2 Other scalability hazards; 2.12 Explicit feedback; 2.12.1 Explicit congestion notification; 2.12.2 Precise feedback; 2.13 Special environments; 2.14 Congestion control and OSI layers; 2.14.1 Circuits as a hindrance; 2.15 Multicast congestion control 2.15.1 Problems2.15.2 Sender- and receiver-based schemes; 2.16 Incentive issues; 2.16.1 Tragedy of the commons; 2.16.2 Game theory; 2.16.3 Congestion pricing; 2.17 Fairness; 2.17.1 Max-min fairness; 2.17.2 Utility functions; 2.17.3 Proportional fairness; 2.17.4 TCP friendliness; 2.18 Conclusion; 3 Present technology; 3.1 Introducing TCP; 3.1.1 Basic functions; 3.1.2 Connection handling; 3.1.3 Flow control: the sliding window; 3.1.4 Reliability: timeouts and retransmission; 3.2 TCP window management; 3.2.1 Silly window syndrome; 3.2.2 SWS avoidance; 3.2.3 Delayed ACKs 3.2.4 The Nagle algorithm3.3 TCP RTO calculation; 3.3.1 Ignoring ACKs from retransmissions; 3.3.2 Not ignoring ACKs from retransmissions; 3.3.3 Updating RTO calculation; 3.4 TCP congestion control and reliability; 3.4.1 Slow start and congestion avoidance; 3.4.2 Combining the algorithms; 3.4.3 Design rationales and deployment considerations; 3.4.4 Interactions with other window-management algorithms; 3.4.5 Fast retransmit and fast recovery; 3.4.6 Multiple losses from a single window; 3.4.7 NewReno; 3.4.8 Selective Acknowledgements (SACK); 3.4.9 Explicit Congestion Notification (ECN) 3.5 Concluding remarks about TCP3.6 The Stream Control Transmission Protocol (SCTP); 3.7 Random Early Detection (RED); 3.8 The ATM 'Available Bit Rate' service; 3.8.1 Explicit rate calculation; 3.8.2 TCP over ATM; 4 Experimental enhancements; 4.1 Ensuring appropriate TCP behaviour; 4.1.1 Appropriate byte counting; 4.1.2 Limited slow start; 4.1.3 Congestion window validation; 4.1.4 Robust ECN signalling; 4.1.5 Spurious timeouts; 4.1.6 Reordering; 4.1.7 Corruption; 4.2 Maintaining congestion state; 4.2.1 TCP Control Block Interdependence; 4.2.2 The Congestion Manager; 4.2.3 MulTCP 4.3 Transparent TCP improvements |
| Record Nr. | UNINA-9910876923203321 |
|
Welzl Michael <1973->
|
||
| Chichester, West Sussex, England ; ; Hoboken, NJ, : J. Wiley, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
