- Cover image
- Title page
- Table of Contents
- Copyright page
- Dedication
- Preface
- Part I: The Rules of the Game
- Introduction
- Chapter 1: Introducing Network Algorithmics
- Chapter 2: Network Implementation Models
- Chapter 3: Fifteen Implementation Principles
- Chapter 4: Principles in Action
- 4.1 BUFFER VALIDATION OF APPLICATION DEVICE CHANNELS
- 4.2 SCHEDULER FOR ASYNCHRONOUS TRANSFER MODE FLOW CONTROL
- 4.3 ROUTE COMPUTATION USING DIJKSTRA’S ALGORITHM
- 4.4 ETHERNET MONITOR USING BRIDGE HARDWARE
- 4.5 DEMULTIPLEXING IN THE X-KERNEL
- 4.6 TRIES WITH NODE COMPRESSION
- 4.7 PACKET FILTERING IN ROUTERS
- 4.8 AVOIDING FRAGMENTATION OF LINK STATE PACKETS
- 4.9 POLICING TRAFFIC PATTERNS
- 4.10 IDENTIFYING A RESOURCE HOG
- 4.11 GETTING RID OF THE TCP OPEN CONNECTION LIST
- 4.12 ACKNOWLEDGMENT WITH HOLDING
- 4.13 INCREMENTALLY READING A LARGE DATABASE
- 4.14 BINARY SEARCH OF LONG IDENTIFIERS
- 4.15 VIDEO CONFERENCING VIA ASYNCHRONOUS TRANSFER MODE
- Part II: Playing with Endnodes
- Introduction
- Chapter 5: Copying Data
- Chapter 6: Transferring Control
- Chapter 7: Maintaining Timers
- Chapter 8: Demultiplexing
- 8.1 OPPORTUNITIES AND CHALLENGES OF EARLY DEMULTIPLEXING
- 8.2 GOALS
- 8.3 CMU/STANFORD PACKET FILTER: PIONEERING PACKET FILTERS
- 8.4 BERKELEY PACKET FILTER: ENABLING HIGH-PERFORMANCE MONITORING
- 8.5 PATHFINDER: FACTORING OUT COMMON CHECKS
- 8.6 DYNAMIC PACKET FILTER: COMPILERS TO THE RESCUE
- 8.7 CONCLUSIONS
- 8.8 EXERCISES
- Chapter 9: Protocol Processing
- Part III: Playing with Routers
- Chapter 12: Packet Classification
- 12.1 WHY PACKET CLASSIFICATION?
- 12.2 PACKET-CLASSIFICATION PROBLEM
- 12.3 REQUIREMENTS AND METRICS
- 12.4 SIMPLE SOLUTIONS
- 12.5 TWO-DIMENSIONAL SCHEMES
- 12.6 APPROACHES TO GENERAL RULE SETS
- 12.7 EXTENDING TWO-DIMENSIONAL SCHEMES
- 12.8 USING DIVIDE-AND-CONQUER
- 12.9 BIT VECTOR LINEAR SEARCH
- 12.10 CROSS-PRODUCTING
- 12.11 EQUIVALENCED CROSS-PRODUCTING
- 12.12 DECISION TREE APPROACHES
- 12.13 CONCLUSIONS
- 12.14 EXERCISES
- Chapter 13: Switching
- 13.1 ROUTER VERSUS TELEPHONE SWITCHES
- 13.2 SHARED-MEMORY SWITCHES
- 13.3 ROUTER HISTORY: FROM BUSES TO CROSSBARS
- 13.4 THE TAKE-A-TICKET CROSSBAR SCHEDULER
- 13.5 HEAD-OF-LINE BLOCKING
- 13.6 AVOIDING HEAD-OF-LINE BLOCKING VIA OUTPUT QUEUING
- 13.7 AVOIDING HEAD-OF-LINE BLOCKING BY USING PARALLEL ITERATIVE MATCHING
- 13.8 AVOIDING RANDOMIZATION WITH iSLIP
- 13.9 SCALING TO LARGER SWITCHES
- 13.10 SCALING TO FASTER SWITCHES
- 13.11 CONCLUSIONS
- 13.12 EXERCISES
- Chapter 14: Scheduling Packets
- 14.1 MOTIVATION FOR QUALITY OF SERVICE
- 14.2 RANDOM EARLY DETECTION
- 14.3 TOKEN BUCKET POLICING
- 14.4 MULTIPLE OUTBOUND QUEUES AND PRIORITY
- 14.5 A QUICK DETOUR INTO RESERVATION PROTOCOLS
- 14.6 PROVIDING BANDWIDTH GUARANTEES
- 14.7 SCHEDULERS THAT PROVIDE DELAY GUARANTEES
- 14.8 SCALABLE FAIR QUEUING
- 14.9 SUMMARY
- 14.10 EXERCISES
- Chapter 15: Routers as Distributed Systems
- Part IV: Endgame
- Chapter 16: Measuring Network Traffic
- 16.1 WHY MEASUREMENT IS HARD
- 16.2 REDUCING SRAM WIDTH USING DRAM BACKING STORE
- 16.3 REDUCING COUNTER WIDTH USING RANDOMIZED COUNTING
- 16.4 REDUCING COUNTERS USING THRESHOLD AGGREGATION
- 16.5 REDUCING COUNTERS USING FLOW COUNTING
- 16.6 REDUCING PROCESSING USING SAMPLED NETFLOW
- 16.7 REDUCING REPORTING USING SAMPLED CHARGING
- 16.8 CORRELATING MEASUREMENTS USING TRAJECTORY SAMPLING
- 16.9 A CONCERTED APPROACH TO ACCOUNTING
- 16.10 COMPUTING TRAFFIC MATRICES
- 16.11 STING AS AN EXAMPLE OF PASSIVE MEASUREMENT
- 16.12 CONCLUSION
- 16.13 EXERCISES
- Chapter 17: Network Security
- Chapter 18: Conclusions
- Chapter 16: Measuring Network Traffic
- Appendix: Detailed Models
- Bibliography
- Index
Dedication
For Aju and Tim and Andrew, who made all this possible ...
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.