Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices, Second Edition takes an interdisciplinary approach to applying principles for efficient implementation of network devices, offering solutions to the problem of network implementation bottlenecks. In designing a network device, there are dozens of decisions that affect the speed with which it will perform – sometimes for better, but sometimes for worse. The book provides a complete and coherent methodology for maximizing speed while meeting network design goals. The book is uniquely focused on the seamless integration of data structures, algorithms, operating systems and hardware/software co-designs for high-performance routers/switches and network end systems.
Thoroughly updated based on courses taught by the authors over the past decade, the book lays out the bottlenecks most often encountered at four disparate levels of implementation: protocol, OS, hardware and architecture. It then develops fifteen principles key to breaking these bottlenecks, systematically applying them to bottlenecks found in end-nodes, interconnect devices and specialty functions located along the network. Later sections discuss the inherent challenges of modern cloud computing and data center networking.
1. Title of Book - p. i 2. Cover image - p. i 3. Title page - p. ii 4. Table of Contents - p. iii 5. Copyright - p. iii 6. Dedication - p. iii 7. Preface to the second edition - p. xvii 8. Preface - p. xix 9. 15 principles used to overcome network bottlenecks - p. xxiv 10. Part 1: The rules of the game - p. xxiv 11. Chapter 1. Introducing network algorithmics - p. 3 12. Chapter 2. Network implementation models - p. 17 13. Chapter 3. Fifteen implementation principles - p. 51 14. Chapter 4. Principles in action - p. 75 15. Part 2: Playing with endnodes - p. 107 16. Chapter 5. Copying data - p. 111 17. Chapter 6. Transferring control - p. 145 18. Chapter 7. Maintaining timers - p. 179 19. Chapter 8. Demultiplexing - p. 195 20. Chapter 9. Protocol processing - p. 211 21. Part 3: Playing with routers - p. 232 22. Chapter 10. Exact-match lookups - p. 235 23. Chapter 11. Prefix-match lookups - p. 249 24. Chapter 12. Packet classification - p. 295 25. Chapter 13. Switching - p. 331 26. Chapter 14. Scheduling packets - p. 383 27. Chapter 15. Routers as distributed systems - p. 429 28. Part 4: Endgame - p. 445 29. Chapter 16. Measuring network traffic - p. 449 30. Chapter 17. Network security - p. 489 31. Chapter 18. Conclusions - p. 513 32. Appendix A. Detailed models - p. 529 33. References - p. 541 34. Index - p. 559
Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices, Second Edition takes an interdisciplinary approach to applying principles for efficient implementation of network devices, offering solutions to the problem of network implementation bottlenecks. In designing a network device, there are dozens of decisions that affect the speed with which it will perform – sometimes for better, but sometimes for worse. The book provides a complete and coherent methodology for maximizing speed while meeting network design goals. The book is uniquely focused on the seamless integration of data structures, algorithms, operating systems and hardware/software co-designs for high-performance routers/switches and network end systems.
Thoroughly updated based on courses taught by the authors over the past decade, the book lays out the bottlenecks most often encountered at four disparate levels of implementation: protocol, OS, hardware and architecture. It then develops fifteen principles key to breaking these bottlenecks, systematically applying them to bottlenecks found in end-nodes, interconnect devices and specialty functions located along the network. Later sections discuss the inherent challenges of modern cloud computing and data center networking.
1. Title of Book - p. i 2. Cover image - p. i 3. Title page - p. ii 4. Table of Contents - p. iii 5. Copyright - p. iii 6. Dedication - p. iii 7. Preface to the second edition - p. xvii 8. Preface - p. xix 9. 15 principles used to overcome network bottlenecks - p. xxiv 10. Part 1: The rules of the game - p. xxiv 11. Chapter 1. Introducing network algorithmics - p. 3 12. Chapter 2. Network implementation models - p. 17 13. Chapter 3. Fifteen implementation principles - p. 51 14. Chapter 4. Principles in action - p. 75 15. Part 2: Playing with endnodes - p. 107 16. Chapter 5. Copying data - p. 111 17. Chapter 6. Transferring control - p. 145 18. Chapter 7. Maintaining timers - p. 179 19. Chapter 8. Demultiplexing - p. 195 20. Chapter 9. Protocol processing - p. 211 21. Part 3: Playing with routers - p. 232 22. Chapter 10. Exact-match lookups - p. 235 23. Chapter 11. Prefix-match lookups - p. 249 24. Chapter 12. Packet classification - p. 295 25. Chapter 13. Switching - p. 331 26. Chapter 14. Scheduling packets - p. 383 27. Chapter 15. Routers as distributed systems - p. 429 28. Part 4: Endgame - p. 445 29. Chapter 16. Measuring network traffic - p. 449 30. Chapter 17. Network security - p. 489 31. Chapter 18. Conclusions - p. 513 32. Appendix A. Detailed models - p. 529 33. References - p. 541 34. Index - p. 559
